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-171640601200283.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-c004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K 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 98K 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-c004-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716436964028

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:02:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 04:02:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:02:45] [INFO ] Load time of PNML (sax parser for PT used): 603 ms
[2024-05-23 04:02:46] [INFO ] Transformed 2826 places.
[2024-05-23 04:02:46] [INFO ] Transformed 8960 transitions.
[2024-05-23 04:02:46] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 802 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 138 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 77 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 309 place count 1319 transition count 3750
Iterating global reduction 1 with 293 rules applied. Total rules applied 602 place count 1319 transition count 3750
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 998 place count 1319 transition count 3354
Discarding 149 places :
Symmetric choice reduction at 2 with 149 rule applications. Total rules 1147 place count 1170 transition count 3056
Iterating global reduction 2 with 149 rules applied. Total rules applied 1296 place count 1170 transition count 3056
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1380 place count 1170 transition count 2972
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1393 place count 1157 transition count 2946
Iterating global reduction 3 with 13 rules applied. Total rules applied 1406 place count 1157 transition count 2946
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1418 place count 1145 transition count 2922
Iterating global reduction 3 with 12 rules applied. Total rules applied 1430 place count 1145 transition count 2922
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1442 place count 1133 transition count 2898
Iterating global reduction 3 with 12 rules applied. Total rules applied 1454 place count 1133 transition count 2898
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1466 place count 1121 transition count 2874
Iterating global reduction 3 with 12 rules applied. Total rules applied 1478 place count 1121 transition count 2874
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1490 place count 1109 transition count 2850
Iterating global reduction 3 with 12 rules applied. Total rules applied 1502 place count 1109 transition count 2850
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1512 place count 1099 transition count 2830
Iterating global reduction 3 with 10 rules applied. Total rules applied 1522 place count 1099 transition count 2830
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1531 place count 1090 transition count 2812
Iterating global reduction 3 with 9 rules applied. Total rules applied 1540 place count 1090 transition count 2812
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1570 place count 1060 transition count 2702
Iterating global reduction 3 with 30 rules applied. Total rules applied 1600 place count 1060 transition count 2702
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1642 place count 1018 transition count 2534
Iterating global reduction 3 with 42 rules applied. Total rules applied 1684 place count 1018 transition count 2534
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1726 place count 976 transition count 2416
Iterating global reduction 3 with 42 rules applied. Total rules applied 1768 place count 976 transition count 2416
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1809 place count 935 transition count 2334
Iterating global reduction 3 with 41 rules applied. Total rules applied 1850 place count 935 transition count 2334
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1891 place count 894 transition count 2252
Iterating global reduction 3 with 41 rules applied. Total rules applied 1932 place count 894 transition count 2252
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1973 place count 853 transition count 2170
Iterating global reduction 3 with 41 rules applied. Total rules applied 2014 place count 853 transition count 2170
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2054 place count 813 transition count 2090
Iterating global reduction 3 with 40 rules applied. Total rules applied 2094 place count 813 transition count 2090
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2111 place count 796 transition count 2056
Iterating global reduction 3 with 17 rules applied. Total rules applied 2128 place count 796 transition count 2056
Applied a total of 2128 rules in 1590 ms. Remains 796 /1628 variables (removed 832) and now considering 2056/5962 (removed 3906) transitions.
[2024-05-23 04:02:48] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
// Phase 1: matrix 1386 rows 796 cols
[2024-05-23 04:02:48] [INFO ] Computed 2 invariants in 40 ms
[2024-05-23 04:02:49] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2024-05-23 04:02:49] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-23 04:02:49] [INFO ] Invariant cache hit.
[2024-05-23 04:02:49] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-23 04:02:52] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 4120 ms to find 0 implicit places.
Running 2054 sub problems to find dead transitions.
[2024-05-23 04:02:52] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-23 04:02:52] [INFO ] Invariant cache hit.
[2024-05-23 04:02:52] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/795 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 795/2182 variables, and 2 constraints, problems are : Problem set: 0 solved, 2054 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/796 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 2054/2054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/795 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 795/2182 variables, and 2 constraints, problems are : Problem set: 0 solved, 2054 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/796 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 0/2054 constraints, Known Traps: 0/0 constraints]
After SMT, in 70175ms problems are : Problem set: 0 solved, 2054 unsolved
Search for dead transitions found 0 dead transitions in 70214ms
Starting structural reductions in LTL mode, iteration 1 : 796/1628 places, 2056/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75955 ms. Remains : 796/1628 places, 2056/5962 transitions.
Support contains 27 out of 796 places after structural reductions.
[2024-05-23 04:04:02] [INFO ] Flatten gal took : 152 ms
[2024-05-23 04:04:03] [INFO ] Flatten gal took : 102 ms
[2024-05-23 04:04:03] [INFO ] Input system was already deterministic with 2056 transitions.
RANDOM walk for 40000 steps (8 resets) in 2305 ms. (17 steps per ms) remains 11/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
[2024-05-23 04:04:04] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-23 04:04:04] [INFO ] Invariant cache hit.
[2024-05-23 04:04:04] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 382/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/436 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 766/1202 variables, 436/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1202 variables, 25/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1202 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 8 (OVERLAPS) 374/1576 variables, 54/517 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 242/759 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 0/759 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 487/2063 variables, 213/972 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2063 variables, 66/1038 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2063 variables, 0/1038 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 92/2155 variables, 79/1117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2155 variables, 0/1117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 23/2178 variables, 10/1127 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2178 variables, 0/1127 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 4/2182 variables, 4/1131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2182 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/2182 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 1131 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 796/796 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 354/1382 variables, 6/392 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1382 variables, 240/632 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1382 variables, 3/635 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1382 variables, 0/635 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 587/1969 variables, 262/897 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1969 variables, 1/898 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1969 variables, 93/991 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1969 variables, 0/991 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 168/2137 variables, 120/1111 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2137 variables, 0/1111 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 28/2165 variables, 13/1124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2165 variables, 0/1124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 17/2182 variables, 10/1134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2182 variables, 0/1134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/2182 variables, 0/1134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 1134 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 796/796 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3140ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 125 ms.
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 3358 edges and 796 vertex of which 603 are kept as prefixes of interest. Removing 193 places using SCC suffix rule.9 ms
Discarding 193 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 603 transition count 1672
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 401 place count 587 transition count 1636
Iterating global reduction 1 with 16 rules applied. Total rules applied 417 place count 587 transition count 1636
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 423 place count 587 transition count 1630
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 438 place count 572 transition count 1590
Iterating global reduction 2 with 15 rules applied. Total rules applied 453 place count 572 transition count 1590
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 468 place count 557 transition count 1546
Iterating global reduction 2 with 15 rules applied. Total rules applied 483 place count 557 transition count 1546
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 503 place count 537 transition count 1482
Iterating global reduction 2 with 20 rules applied. Total rules applied 523 place count 537 transition count 1482
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 542 place count 518 transition count 1428
Iterating global reduction 2 with 19 rules applied. Total rules applied 561 place count 518 transition count 1428
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 580 place count 499 transition count 1390
Iterating global reduction 2 with 19 rules applied. Total rules applied 599 place count 499 transition count 1390
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 619 place count 479 transition count 1346
Iterating global reduction 2 with 20 rules applied. Total rules applied 639 place count 479 transition count 1346
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 657 place count 461 transition count 1306
Iterating global reduction 2 with 18 rules applied. Total rules applied 675 place count 461 transition count 1306
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 690 place count 446 transition count 1276
Iterating global reduction 2 with 15 rules applied. Total rules applied 705 place count 446 transition count 1276
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 716 place count 435 transition count 1254
Iterating global reduction 2 with 11 rules applied. Total rules applied 727 place count 435 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 730 place count 432 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 733 place count 432 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 736 place count 429 transition count 1238
Iterating global reduction 2 with 3 rules applied. Total rules applied 739 place count 429 transition count 1238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 742 place count 426 transition count 1232
Iterating global reduction 2 with 3 rules applied. Total rules applied 745 place count 426 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 746 place count 425 transition count 1230
Iterating global reduction 2 with 1 rules applied. Total rules applied 747 place count 425 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 748 place count 424 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 749 place count 424 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 750 place count 423 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 751 place count 423 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 752 place count 422 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 753 place count 422 transition count 1224
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 757 place count 422 transition count 1220
Applied a total of 757 rules in 671 ms. Remains 422 /796 variables (removed 374) and now considering 1220/2056 (removed 836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 684 ms. Remains : 422/796 places, 1220/2056 transitions.
RANDOM walk for 40001 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 524801 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 524801 steps, saw 321802 distinct states, run finished after 3004 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 04:04:11] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 04:04:11] [INFO ] Computed 3 invariants in 10 ms
[2024-05-23 04:04:11] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 50 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 74 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 04:04:11] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 04:04:11] [INFO ] Invariant cache hit.
[2024-05-23 04:04:12] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 04:04:12] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 04:04:12] [INFO ] Invariant cache hit.
[2024-05-23 04:04:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 04:04:13] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1538 ms to find 0 implicit places.
[2024-05-23 04:04:13] [INFO ] Redundant transitions in 82 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 04:04:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 04:04:13] [INFO ] Invariant cache hit.
[2024-05-23 04:04:13] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 04:04:27] [INFO ] Deduced a trap composed of 131 places in 219 ms of which 26 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34019ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34033ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35742 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
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 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
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 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 75 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 04:04:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 04:04:47] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 04:04:47] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:04:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:04:47] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:04:47] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:04:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:04:47] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:04:47] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:04:47] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:04:47] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 182 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c004-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-c004-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 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 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 52 place count 764 transition count 1976
Iterating global reduction 2 with 15 rules applied. Total rules applied 67 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 82 place count 749 transition count 1930
Iterating global reduction 2 with 15 rules applied. Total rules applied 97 place count 749 transition count 1930
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 116 place count 730 transition count 1870
Iterating global reduction 2 with 19 rules applied. Total rules applied 135 place count 730 transition count 1870
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 153 place count 712 transition count 1822
Iterating global reduction 2 with 18 rules applied. Total rules applied 171 place count 712 transition count 1822
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 694 transition count 1786
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 694 transition count 1786
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 226 place count 675 transition count 1744
Iterating global reduction 2 with 19 rules applied. Total rules applied 245 place count 675 transition count 1744
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 262 place count 658 transition count 1706
Iterating global reduction 2 with 17 rules applied. Total rules applied 279 place count 658 transition count 1706
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 293 place count 644 transition count 1678
Iterating global reduction 2 with 14 rules applied. Total rules applied 307 place count 644 transition count 1678
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 316 place count 635 transition count 1660
Iterating global reduction 2 with 9 rules applied. Total rules applied 325 place count 635 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 329 place count 631 transition count 1648
Iterating global reduction 2 with 4 rules applied. Total rules applied 333 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 337 place count 627 transition count 1636
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 345 place count 623 transition count 1628
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 621 transition count 1624
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 619 transition count 1620
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 359 place count 617 transition count 1616
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 363 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 365 place count 615 transition count 1612
Applied a total of 365 rules in 449 ms. Remains 615 /796 variables (removed 181) and now considering 1612/2056 (removed 444) transitions.
[2024-05-23 04:04:48] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 04:04:48] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 04:04:48] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-23 04:04:48] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 04:04:48] [INFO ] Invariant cache hit.
[2024-05-23 04:04:49] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:04:50] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 04:04:50] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 04:04:50] [INFO ] Invariant cache hit.
[2024-05-23 04:04:50] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69293ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69315ms
Starting structural reductions in LTL mode, iteration 1 : 615/796 places, 1612/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72076 ms. Remains : 615/796 places, 1612/2056 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 749 ms.
Product exploration explored 100000 steps with 50000 reset in 580 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c004-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-00 finished in 73702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 780 transition count 2024
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 780 transition count 2024
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 780 transition count 2018
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 51 place count 766 transition count 1984
Iterating global reduction 2 with 14 rules applied. Total rules applied 65 place count 766 transition count 1984
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 752 transition count 1942
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 752 transition count 1942
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 2 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 2 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 2 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 259 place count 660 transition count 1708
Iterating global reduction 2 with 18 rules applied. Total rules applied 277 place count 660 transition count 1708
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 293 place count 644 transition count 1676
Iterating global reduction 2 with 16 rules applied. Total rules applied 309 place count 644 transition count 1676
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 320 place count 633 transition count 1654
Iterating global reduction 2 with 11 rules applied. Total rules applied 331 place count 633 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 334 place count 630 transition count 1646
Iterating global reduction 2 with 3 rules applied. Total rules applied 337 place count 630 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 340 place count 627 transition count 1638
Iterating global reduction 2 with 3 rules applied. Total rules applied 343 place count 627 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 346 place count 624 transition count 1632
Iterating global reduction 2 with 3 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 354 place count 621 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 356 place count 620 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 620 transition count 1624
Applied a total of 357 rules in 251 ms. Remains 620 /796 variables (removed 176) and now considering 1624/2056 (removed 432) transitions.
[2024-05-23 04:06:01] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 620 cols
[2024-05-23 04:06:01] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:06:02] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-23 04:06:02] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:06:02] [INFO ] Invariant cache hit.
[2024-05-23 04:06:02] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:06:04] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
Running 1622 sub problems to find dead transitions.
[2024-05-23 04:06:04] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:06:04] [INFO ] Invariant cache hit.
[2024-05-23 04:06:04] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 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 620/1705 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1705 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1705 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 2512 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 69686ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 69702ms
Starting structural reductions in LTL mode, iteration 1 : 620/796 places, 1624/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72430 ms. Remains : 620/796 places, 1624/2056 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 488 ms.
Product exploration explored 100000 steps with 33333 reset in 495 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 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c004-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-01 finished in 73720 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(F(p0))||G(p1))))'
Support contains 4 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 782 transition count 2026
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 782 transition count 2026
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 782 transition count 2020
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 769 transition count 1986
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 769 transition count 1986
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 756 transition count 1946
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 756 transition count 1946
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 104 place count 738 transition count 1886
Iterating global reduction 1 with 18 rules applied. Total rules applied 122 place count 738 transition count 1886
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 139 place count 721 transition count 1836
Iterating global reduction 1 with 17 rules applied. Total rules applied 156 place count 721 transition count 1836
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 173 place count 704 transition count 1802
Iterating global reduction 1 with 17 rules applied. Total rules applied 190 place count 704 transition count 1802
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 208 place count 686 transition count 1762
Iterating global reduction 1 with 18 rules applied. Total rules applied 226 place count 686 transition count 1762
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 243 place count 669 transition count 1724
Iterating global reduction 1 with 17 rules applied. Total rules applied 260 place count 669 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 274 place count 655 transition count 1696
Iterating global reduction 1 with 14 rules applied. Total rules applied 288 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 298 place count 645 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 308 place count 645 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 310 place count 643 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 312 place count 643 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 314 place count 641 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 316 place count 641 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 318 place count 639 transition count 1664
Iterating global reduction 1 with 2 rules applied. Total rules applied 320 place count 639 transition count 1664
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 326 place count 639 transition count 1658
Applied a total of 326 rules in 1072 ms. Remains 639 /796 variables (removed 157) and now considering 1658/2056 (removed 398) transitions.
[2024-05-23 04:07:16] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-23 04:07:16] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:07:17] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-23 04:07:17] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:07:17] [INFO ] Invariant cache hit.
[2024-05-23 04:07:17] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-23 04:07:19] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2665 ms to find 0 implicit places.
[2024-05-23 04:07:19] [INFO ] Redundant transitions in 37 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-23 04:07:19] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:07:19] [INFO ] Invariant cache hit.
[2024-05-23 04:07:19] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1656/1656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1747 variables, 638/640 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1747 variables, 273/913 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1747/1748 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 638/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 256/1656 constraints, Known Traps: 0/0 constraints]
After SMT, in 69220ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 69236ms
Starting structural reductions in SI_LTL mode, iteration 1 : 639/796 places, 1658/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73036 ms. Remains : 639/796 places, 1658/2056 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 492 ms.
Product exploration explored 100000 steps with 0 reset in 581 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/2 properties
[2024-05-23 04:08:30] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:08:30] [INFO ] Invariant cache hit.
[2024-05-23 04:08:30] [INFO ] State equation strengthened by 273 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/1294 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 371/1665 variables, 162/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1665 variables, 72/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 77/1742 variables, 73/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1742 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1747 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1747 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1748 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 914 constraints, problems are : Problem set: 0 solved, 1 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 273/273 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1283 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1294 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 371/1665 variables, 162/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 72/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1665 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 77/1742 variables, 73/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1742 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1747 variables, 3/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1747 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1748 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1748 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1748 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 915 constraints, problems are : Problem set: 0 solved, 1 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1177ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 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 447 transition count 1274
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 387 place count 447 transition count 1272
Applied a total of 387 rules in 101 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 447/639 places, 1272/1658 transitions.
RANDOM walk for 40001 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549705 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549705 steps, saw 337072 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-23 04:08:34] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-23 04:08:34] [INFO ] Computed 3 invariants in 5 ms
[2024-05-23 04:08:34] [INFO ] State equation strengthened by 83 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1103 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/1154 variables, 34/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1154 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/1167 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1172 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1172 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1173 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/1154 variables, 34/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/1167 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1172 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1172 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1173 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 815ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 46 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 46 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-23 04:08:35] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 04:08:35] [INFO ] Invariant cache hit.
[2024-05-23 04:08:35] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-23 04:08:35] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 04:08:35] [INFO ] Invariant cache hit.
[2024-05-23 04:08:35] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-23 04:08:37] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2024-05-23 04:08:37] [INFO ] Redundant transitions in 19 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-23 04:08:37] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 04:08:37] [INFO ] Invariant cache hit.
[2024-05-23 04:08:37] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-05-23 04:08:52] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1173 variables, and 4 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/447 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 1270/1270 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 3 (OVERLAPS) 726/1172 variables, 446/450 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 83/533 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1172 variables, 256/789 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1172/1173 variables, and 789 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 446/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 256/1270 constraints, Known Traps: 1/1 constraints]
After SMT, in 64140ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 64153ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65971 ms. Remains : 447/447 places, 1272/1272 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
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 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
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 4 with 2 rules applied. Total rules applied 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 74 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2024-05-23 04:09:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 04:09:41] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:09:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 04:09:41] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:09:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:09:41] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:09:41] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:09:41] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 210 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 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 82 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-23 04:09:42] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-23 04:09:42] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:09:42] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-23 04:09:42] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:09:42] [INFO ] Invariant cache hit.
[2024-05-23 04:09:42] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-23 04:09:44] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2387 ms to find 0 implicit places.
[2024-05-23 04:09:44] [INFO ] Redundant transitions in 24 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-23 04:09:44] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:09:44] [INFO ] Invariant cache hit.
[2024-05-23 04:09:44] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1656/1656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1747 variables, 638/640 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1747 variables, 273/913 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1747/1748 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 638/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 256/1656 constraints, Known Traps: 0/0 constraints]
After SMT, in 69433ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 69449ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71955 ms. Remains : 639/639 places, 1658/1658 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 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 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
[2024-05-23 04:10:54] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:10:54] [INFO ] Invariant cache hit.
[2024-05-23 04:10:54] [INFO ] State equation strengthened by 273 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, 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/1294 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 371/1665 variables, 162/765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1665 variables, 72/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 77/1742 variables, 73/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1742 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1747 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1747 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1748 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 914 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: 639/639 constraints, ReadFeed: 273/273 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1283 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/1294 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1294 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 371/1665 variables, 162/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 72/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1665 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 77/1742 variables, 73/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1742 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/1747 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1747 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1748 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1748 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1748 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 916 constraints, problems are : Problem set: 0 solved, 2 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1559ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 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 447 transition count 1274
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 387 place count 447 transition count 1272
Applied a total of 387 rules in 104 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 447/639 places, 1272/1658 transitions.
RANDOM walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/2 properties
[2024-05-23 04:10:55] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-23 04:10:55] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 04:10:55] [INFO ] State equation strengthened by 83 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1103 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/1154 variables, 34/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1154 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/1167 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1172 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1172 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1173 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/1154 variables, 34/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/1167 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1172 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1172 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1173 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 51 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 447/447 places, 1272/1272 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 554216 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 554216 steps, saw 339838 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-23 04:10:59] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 04:10:59] [INFO ] Invariant cache hit.
[2024-05-23 04:10:59] [INFO ] State equation strengthened by 83 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1103 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/1154 variables, 34/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1154 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/1167 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1172 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1172 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1173 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 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) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/1154 variables, 34/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/1167 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1172 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1172 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1173 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 818ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 51 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 50 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-23 04:11:00] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 04:11:00] [INFO ] Invariant cache hit.
[2024-05-23 04:11:01] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-23 04:11:01] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 04:11:01] [INFO ] Invariant cache hit.
[2024-05-23 04:11:01] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-23 04:11:02] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2024-05-23 04:11:02] [INFO ] Redundant transitions in 22 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-23 04:11:02] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 04:11:02] [INFO ] Invariant cache hit.
[2024-05-23 04:11:02] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-05-23 04:11:17] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1270 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 446/1173 variables, and 4 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/447 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 1270/1270 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 3 (OVERLAPS) 726/1172 variables, 446/450 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 83/533 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1172 variables, 256/789 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1172/1173 variables, and 789 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 446/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 256/1270 constraints, Known Traps: 1/1 constraints]
After SMT, in 64879ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 64892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66714 ms. Remains : 447/447 places, 1272/1272 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
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 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
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 4 with 2 rules applied. Total rules applied 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 24 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2024-05-23 04:12:07] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 04:12:07] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:12:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:12:07] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:12:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:12:07] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:12:07] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:12:07] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 108 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 213 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 444 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 75 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-23 04:12:09] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-23 04:12:09] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:12:09] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-23 04:12:09] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:12:09] [INFO ] Invariant cache hit.
[2024-05-23 04:12:09] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-23 04:12:11] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2429 ms to find 0 implicit places.
[2024-05-23 04:12:11] [INFO ] Redundant transitions in 28 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-23 04:12:11] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 04:12:11] [INFO ] Invariant cache hit.
[2024-05-23 04:12:11] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1656/1656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1747 variables, 638/640 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1747 variables, 273/913 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1747/1748 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 638/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 256/1656 constraints, Known Traps: 0/0 constraints]
After SMT, in 68891ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 68909ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71464 ms. Remains : 639/639 places, 1658/1658 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-04 finished in 365152 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||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 781 transition count 2024
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 781 transition count 2024
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 33 place count 781 transition count 2020
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 768 transition count 1984
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 768 transition count 1984
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 72 place count 755 transition count 1942
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 755 transition count 1942
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 738 transition count 1886
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 738 transition count 1886
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 136 place count 721 transition count 1840
Iterating global reduction 1 with 17 rules applied. Total rules applied 153 place count 721 transition count 1840
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 170 place count 704 transition count 1806
Iterating global reduction 1 with 17 rules applied. Total rules applied 187 place count 704 transition count 1806
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 1 with 17 rules applied. Total rules applied 221 place count 687 transition count 1772
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 236 place count 672 transition count 1742
Iterating global reduction 1 with 15 rules applied. Total rules applied 251 place count 672 transition count 1742
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 263 place count 660 transition count 1718
Iterating global reduction 1 with 12 rules applied. Total rules applied 275 place count 660 transition count 1718
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 282 place count 653 transition count 1704
Iterating global reduction 1 with 7 rules applied. Total rules applied 289 place count 653 transition count 1704
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 291 place count 651 transition count 1696
Iterating global reduction 1 with 2 rules applied. Total rules applied 293 place count 651 transition count 1696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 295 place count 649 transition count 1688
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 649 transition count 1688
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 299 place count 647 transition count 1684
Iterating global reduction 1 with 2 rules applied. Total rules applied 301 place count 647 transition count 1684
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 303 place count 645 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 305 place count 645 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 307 place count 643 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 309 place count 643 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 311 place count 641 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 313 place count 641 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 315 place count 639 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 317 place count 639 transition count 1668
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 325 place count 639 transition count 1660
Applied a total of 325 rules in 407 ms. Remains 639 /796 variables (removed 157) and now considering 1660/2056 (removed 396) transitions.
[2024-05-23 04:13:20] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2024-05-23 04:13:21] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:13:21] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-23 04:13:21] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:13:21] [INFO ] Invariant cache hit.
[2024-05-23 04:13:21] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-23 04:13:23] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
[2024-05-23 04:13:23] [INFO ] Redundant transitions in 29 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-23 04:13:23] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:13:23] [INFO ] Invariant cache hit.
[2024-05-23 04:13:23] [INFO ] State equation strengthened by 275 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 10.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 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 1.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 0.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/1750 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1111/1750 variables, 639/641 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1750 variables, 275/916 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 2574 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 31638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 70188ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 70205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 639/796 places, 1660/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73058 ms. Remains : 639/796 places, 1660/2056 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 428 ms.
Product exploration explored 100000 steps with 0 reset in 474 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 134 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2024-05-23 04:14:35] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:14:35] [INFO ] Invariant cache hit.
[2024-05-23 04:14:35] [INFO ] State equation strengthened by 275 read => feed constraints.
All remaining problems are real, not stopping.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 561/568 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 964/1532 variables, 486/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1532 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1532 variables, 273/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1532 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1594 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1594 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 145/1739 variables, 138/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1739 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1747 variables, 5/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1747 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1750 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1750 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1750 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 916 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 561/568 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 964/1532 variables, 486/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1532 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1532 variables, 273/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1532 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1594 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1594 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 145/1739 variables, 138/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1739 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1747 variables, 5/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1747 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1750 variables, 2/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1750 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1750 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 917 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 994ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Graph (complete) has 2769 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 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 447 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 446 transition count 1274
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 446 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 445 transition count 1272
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 445 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 444 transition count 1270
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 444 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 443 transition count 1268
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 443 transition count 1268
Applied a total of 393 rules in 72 ms. Remains 443 /639 variables (removed 196) and now considering 1268/1660 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 443/639 places, 1268/1660 transitions.
RANDOM walk for 40009 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 598471 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 598471 steps, saw 366971 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2024-05-23 04:14:39] [INFO ] Flow matrix only has 722 transitions (discarded 546 similar events)
// Phase 1: matrix 722 rows 443 cols
[2024-05-23 04:14:39] [INFO ] Computed 3 invariants in 8 ms
[2024-05-23 04:14:39] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/388 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 624/1012 variables, 351/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 80/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1074 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 80/1154 variables, 73/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1162 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1162 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1165 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1165 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1165 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1165/1165 variables, and 528 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 443/443 constraints, ReadFeed: 82/82 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/374 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/388 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 624/1012 variables, 351/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 80/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1012 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1074 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/1154 variables, 73/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1154 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1162 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1162 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/1165 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1165 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1165 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 443/443 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 672ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1268/1268 transitions.
Applied a total of 0 rules in 46 ms. Remains 443 /443 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 443/443 places, 1268/1268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1268/1268 transitions.
Applied a total of 0 rules in 44 ms. Remains 443 /443 variables (removed 0) and now considering 1268/1268 (removed 0) transitions.
[2024-05-23 04:14:40] [INFO ] Flow matrix only has 722 transitions (discarded 546 similar events)
[2024-05-23 04:14:40] [INFO ] Invariant cache hit.
[2024-05-23 04:14:40] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-23 04:14:40] [INFO ] Flow matrix only has 722 transitions (discarded 546 similar events)
[2024-05-23 04:14:40] [INFO ] Invariant cache hit.
[2024-05-23 04:14:40] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-05-23 04:14:41] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
[2024-05-23 04:14:41] [INFO ] Redundant transitions in 17 ms returned []
Running 1266 sub problems to find dead transitions.
[2024-05-23 04:14:41] [INFO ] Flow matrix only has 722 transitions (discarded 546 similar events)
[2024-05-23 04:14:41] [INFO ] Invariant cache hit.
[2024-05-23 04:14:41] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
[2024-05-23 04:14:56] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
(s281 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.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 1.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 0.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0timeout
)
(s282 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/1165 variables, and 4 constraints, problems are : Problem set: 0 solved, 1266 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/443 constraints, ReadFeed: 0/82 constraints, PredecessorRefiner: 1266/1266 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 3 (OVERLAPS) 722/1165 variables, 443/447 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 82/529 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 1266/1795 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1165/1165 variables, and 1795 constraints, problems are : Problem set: 0 solved, 1266 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 443/443 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 1266/1266 constraints, Known Traps: 1/1 constraints]
After SMT, in 64340ms problems are : Problem set: 0 solved, 1266 unsolved
Search for dead transitions found 0 dead transitions in 64357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66101 ms. Remains : 443/443 places, 1268/1268 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 443 transition count 709
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 572 place count 430 transition count 709
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 572 place count 430 transition count 628
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 734 place count 349 transition count 628
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 992 place count 220 transition count 499
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1056 place count 156 transition count 371
Iterating global reduction 2 with 64 rules applied. Total rules applied 1120 place count 156 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1121 place count 156 transition count 370
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1184 place count 93 transition count 244
Iterating global reduction 3 with 63 rules applied. Total rules applied 1247 place count 93 transition count 244
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1310 place count 30 transition count 118
Iterating global reduction 3 with 63 rules applied. Total rules applied 1373 place count 30 transition count 118
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1436 place count 30 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1436 place count 30 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1438 place count 29 transition count 54
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 4 with 2 rules applied. Total rules applied 1440 place count 28 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1446 place count 25 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1449 place count 25 transition count 50
Applied a total of 1449 rules in 26 ms. Remains 25 /443 variables (removed 418) and now considering 50/1268 (removed 1218) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 25 cols
[2024-05-23 04:15:46] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 04:15:46] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:15:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:15:46] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:15:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:15:46] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:15:46] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:15:46] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 100 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 248 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 80 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-23 04:15:46] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2024-05-23 04:15:46] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 04:15:47] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-23 04:15:47] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:15:47] [INFO ] Invariant cache hit.
[2024-05-23 04:15:47] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-23 04:15:49] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2024-05-23 04:15:49] [INFO ] Redundant transitions in 29 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-23 04:15:49] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:15:49] [INFO ] Invariant cache hit.
[2024-05-23 04:15:49] [INFO ] State equation strengthened by 275 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 10.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)
timeout
(s29 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/1750 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1111/1750 variables, 639/641 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1750 variables, 275/916 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 2574 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 31516 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 69790ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 69807ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72257 ms. Remains : 639/639 places, 1660/1660 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 104 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/2 properties
BEST_FIRST walk for 34784 steps (7 resets) in 43 ms. (790 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 318 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 456 ms.
Product exploration explored 100000 steps with 0 reset in 481 ms.
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 75 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-23 04:17:01] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:17:01] [INFO ] Invariant cache hit.
[2024-05-23 04:17:01] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-23 04:17:01] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:17:01] [INFO ] Invariant cache hit.
[2024-05-23 04:17:01] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-23 04:17:03] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
[2024-05-23 04:17:03] [INFO ] Redundant transitions in 25 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-23 04:17:03] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 04:17:03] [INFO ] Invariant cache hit.
[2024-05-23 04:17:03] [INFO ] State equation strengthened by 275 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
(s215 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 10.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 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 1.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 0.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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/1750 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1111/1750 variables, 639/641 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1750 variables, 275/916 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 2574 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 31641 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 71496ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 71513ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74067 ms. Remains : 639/639 places, 1660/1660 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-05 finished in 294540 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((p0||X(p0))))'
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 51 place count 766 transition count 1980
Iterating global reduction 2 with 14 rules applied. Total rules applied 65 place count 766 transition count 1980
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 752 transition count 1940
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 752 transition count 1940
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 2 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 2 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 2 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 258 place count 661 transition count 1710
Iterating global reduction 2 with 17 rules applied. Total rules applied 275 place count 661 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 290 place count 646 transition count 1680
Iterating global reduction 2 with 15 rules applied. Total rules applied 305 place count 646 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 316 place count 635 transition count 1658
Iterating global reduction 2 with 11 rules applied. Total rules applied 327 place count 635 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 330 place count 632 transition count 1650
Iterating global reduction 2 with 3 rules applied. Total rules applied 333 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 336 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 339 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 342 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 345 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 625 transition count 1634
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Applied a total of 353 rules in 214 ms. Remains 622 /796 variables (removed 174) and now considering 1628/2056 (removed 428) transitions.
[2024-05-23 04:18:15] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-23 04:18:15] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 04:18:15] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-23 04:18:15] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:18:15] [INFO ] Invariant cache hit.
[2024-05-23 04:18:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:18:17] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-23 04:18:17] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:18:17] [INFO ] Invariant cache hit.
[2024-05-23 04:18:17] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 71443ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 71462ms
Starting structural reductions in LTL mode, iteration 1 : 622/796 places, 1628/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74037 ms. Remains : 622/796 places, 1628/2056 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 414 ms.
Product exploration explored 100000 steps with 0 reset in 447 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 40002 steps (8 resets) in 336 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 464853 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 464853 steps, saw 301723 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-05-23 04:19:33] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:19:33] [INFO ] Invariant cache hit.
[2024-05-23 04:19:33] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 557/578 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/585 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 934/1519 variables, 473/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1519 variables, 267/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1519 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 128/1709 variables, 130/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1709/1709 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 557/578 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/585 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 934/1519 variables, 473/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1519 variables, 267/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1519 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1581 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1581 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/1709 variables, 130/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1709 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1709 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 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 430 transition count 1244
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 391 place count 430 transition count 1238
Applied a total of 391 rules in 129 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 430/622 places, 1238/1628 transitions.
RANDOM walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30804 steps (6 resets) in 26 ms. (1140 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 13 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-23 04:19:35] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:19:35] [INFO ] Invariant cache hit.
[2024-05-23 04:19:35] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-23 04:19:35] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:19:35] [INFO ] Invariant cache hit.
[2024-05-23 04:19:36] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:19:37] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-23 04:19:37] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:19:37] [INFO ] Invariant cache hit.
[2024-05-23 04:19:37] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 7.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 0.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 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 70181ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 70196ms
Finished structural reductions in LTL mode , in 1 iterations and 72508 ms. Remains : 622/622 places, 1628/1628 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37826 steps (8 resets) in 43 ms. (859 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 0 reset in 626 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-23 04:20:49] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:20:49] [INFO ] Invariant cache hit.
[2024-05-23 04:20:50] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-23 04:20:50] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:20:50] [INFO ] Invariant cache hit.
[2024-05-23 04:20:50] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:20:52] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-23 04:20:52] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:20:52] [INFO ] Invariant cache hit.
[2024-05-23 04:20:52] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31484 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 70202ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 70221ms
Finished structural reductions in LTL mode , in 1 iterations and 72527 ms. Remains : 622/622 places, 1628/1628 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 227396 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 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 778 transition count 2018
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 778 transition count 2018
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 778 transition count 2012
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 762 transition count 1970
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 762 transition count 1970
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 89 place count 746 transition count 1922
Iterating global reduction 1 with 16 rules applied. Total rules applied 105 place count 746 transition count 1922
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 126 place count 725 transition count 1854
Iterating global reduction 1 with 21 rules applied. Total rules applied 147 place count 725 transition count 1854
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 167 place count 705 transition count 1798
Iterating global reduction 1 with 20 rules applied. Total rules applied 187 place count 705 transition count 1798
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 207 place count 685 transition count 1758
Iterating global reduction 1 with 20 rules applied. Total rules applied 227 place count 685 transition count 1758
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 248 place count 664 transition count 1712
Iterating global reduction 1 with 21 rules applied. Total rules applied 269 place count 664 transition count 1712
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 288 place count 645 transition count 1670
Iterating global reduction 1 with 19 rules applied. Total rules applied 307 place count 645 transition count 1670
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 323 place count 629 transition count 1638
Iterating global reduction 1 with 16 rules applied. Total rules applied 339 place count 629 transition count 1638
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 350 place count 618 transition count 1616
Iterating global reduction 1 with 11 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 364 place count 615 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 367 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 370 place count 612 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 373 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 376 place count 609 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 379 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 380 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 381 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 382 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 383 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 384 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 385 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 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 389 place count 605 transition count 1584
Applied a total of 389 rules in 378 ms. Remains 605 /796 variables (removed 191) and now considering 1584/2056 (removed 472) transitions.
[2024-05-23 04:22:02] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 04:22:02] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:22:03] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-23 04:22:03] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:22:03] [INFO ] Invariant cache hit.
[2024-05-23 04:22:03] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:22:05] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2306 ms to find 0 implicit places.
[2024-05-23 04:22:05] [INFO ] Redundant transitions in 23 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:22:05] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:22:05] [INFO ] Invariant cache hit.
[2024-05-23 04:22:05] [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 30036 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 31283 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 69742ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 69763ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/796 places, 1584/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72486 ms. Remains : 605/796 places, 1584/2056 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 428 ms.
Stack based approach found an accepted trace after 1032 steps with 0 reset with depth 1033 and stack size 1033 in 7 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-07 finished in 73001 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 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 37 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 764 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 749 transition count 1930
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 749 transition count 1930
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 116 place count 730 transition count 1870
Iterating global reduction 1 with 19 rules applied. Total rules applied 135 place count 730 transition count 1870
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 153 place count 712 transition count 1822
Iterating global reduction 1 with 18 rules applied. Total rules applied 171 place count 712 transition count 1822
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 189 place count 694 transition count 1786
Iterating global reduction 1 with 18 rules applied. Total rules applied 207 place count 694 transition count 1786
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 226 place count 675 transition count 1744
Iterating global reduction 1 with 19 rules applied. Total rules applied 245 place count 675 transition count 1744
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 262 place count 658 transition count 1706
Iterating global reduction 1 with 17 rules applied. Total rules applied 279 place count 658 transition count 1706
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 293 place count 644 transition count 1678
Iterating global reduction 1 with 14 rules applied. Total rules applied 307 place count 644 transition count 1678
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 316 place count 635 transition count 1660
Iterating global reduction 1 with 9 rules applied. Total rules applied 325 place count 635 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 329 place count 631 transition count 1648
Iterating global reduction 1 with 4 rules applied. Total rules applied 333 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 337 place count 627 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 341 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 345 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 349 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 351 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 353 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 355 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 357 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 359 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 361 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 363 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 365 place count 615 transition count 1612
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 369 place count 615 transition count 1608
Applied a total of 369 rules in 378 ms. Remains 615 /796 variables (removed 181) and now considering 1608/2056 (removed 448) transitions.
[2024-05-23 04:23:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-23 04:23:15] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:23:16] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-23 04:23:16] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:23:16] [INFO ] Invariant cache hit.
[2024-05-23 04:23:16] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:23:20] [INFO ] Implicit Places using invariants and state equation in 3843 ms returned []
Implicit Place search using SMT with State Equation took 4307 ms to find 0 implicit places.
[2024-05-23 04:23:20] [INFO ] Redundant transitions in 23 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 04:23:20] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:23:20] [INFO ] Invariant cache hit.
[2024-05-23 04:23:20] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 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/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 70049ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 70064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/796 places, 1608/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74783 ms. Remains : 615/796 places, 1608/2056 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 451 ms.
Product exploration explored 100000 steps with 2 reset in 451 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30243 steps (6 resets) in 98 ms. (305 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 83 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 04:24:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:24:31] [INFO ] Invariant cache hit.
[2024-05-23 04:24:32] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-23 04:24:32] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:24:32] [INFO ] Invariant cache hit.
[2024-05-23 04:24:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:24:36] [INFO ] Implicit Places using invariants and state equation in 3920 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
[2024-05-23 04:24:36] [INFO ] Redundant transitions in 29 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 04:24:36] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:24:36] [INFO ] Invariant cache hit.
[2024-05-23 04:24:36] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 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/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31668 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 70085ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 70102ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74648 ms. Remains : 615/615 places, 1608/1608 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8237 steps (2 resets) in 30 ms. (265 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 421 ms.
Product exploration explored 100000 steps with 1 reset in 452 ms.
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 85 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-23 04:25:47] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:25:47] [INFO ] Invariant cache hit.
[2024-05-23 04:25:48] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-23 04:25:48] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:25:48] [INFO ] Invariant cache hit.
[2024-05-23 04:25:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:25:52] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 4161 ms to find 0 implicit places.
[2024-05-23 04:25:52] [INFO ] Redundant transitions in 23 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-23 04:25:52] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 04:25:52] [INFO ] Invariant cache hit.
[2024-05-23 04:25:52] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 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 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 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/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69646ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69663ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73944 ms. Remains : 615/615 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-08 finished in 226383 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 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 765 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 765 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 750 transition count 1932
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 750 transition count 1932
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 117 place count 730 transition count 1868
Iterating global reduction 1 with 20 rules applied. Total rules applied 137 place count 730 transition count 1868
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 156 place count 711 transition count 1814
Iterating global reduction 1 with 19 rules applied. Total rules applied 175 place count 711 transition count 1814
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 194 place count 692 transition count 1776
Iterating global reduction 1 with 19 rules applied. Total rules applied 213 place count 692 transition count 1776
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 233 place count 672 transition count 1732
Iterating global reduction 1 with 20 rules applied. Total rules applied 253 place count 672 transition count 1732
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 271 place count 654 transition count 1692
Iterating global reduction 1 with 18 rules applied. Total rules applied 289 place count 654 transition count 1692
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 304 place count 639 transition count 1662
Iterating global reduction 1 with 15 rules applied. Total rules applied 319 place count 639 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 330 place count 628 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 341 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 344 place count 625 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 347 place count 625 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 350 place count 622 transition count 1624
Iterating global reduction 1 with 3 rules applied. Total rules applied 353 place count 622 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 356 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 359 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 360 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 364 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 365 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 366 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 367 place count 615 transition count 1610
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 371 place count 615 transition count 1606
Applied a total of 371 rules in 377 ms. Remains 615 /796 variables (removed 181) and now considering 1606/2056 (removed 450) transitions.
[2024-05-23 04:27:02] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 615 cols
[2024-05-23 04:27:02] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 04:27:02] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-23 04:27:02] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-23 04:27:02] [INFO ] Invariant cache hit.
[2024-05-23 04:27:02] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 04:27:04] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2024-05-23 04:27:04] [INFO ] Redundant transitions in 26 ms returned []
Running 1604 sub problems to find dead transitions.
[2024-05-23 04:27:04] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-23 04:27:04] [INFO ] Invariant cache hit.
[2024-05-23 04:27:04] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.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 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 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/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1689 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1689 variables, 267/884 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1689/1689 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 69855ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 69872ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/796 places, 1606/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72630 ms. Remains : 615/796 places, 1606/2056 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 398 ms.
Stack based approach found an accepted trace after 5280 steps with 0 reset with depth 5281 and stack size 5281 in 22 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-09 finished in 73123 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||G(p1))))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 39 place count 779 transition count 2014
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 764 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 84 place count 749 transition count 1932
Iterating global reduction 1 with 15 rules applied. Total rules applied 99 place count 749 transition count 1932
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 119 place count 729 transition count 1866
Iterating global reduction 1 with 20 rules applied. Total rules applied 139 place count 729 transition count 1866
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 158 place count 710 transition count 1812
Iterating global reduction 1 with 19 rules applied. Total rules applied 177 place count 710 transition count 1812
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 195 place count 692 transition count 1776
Iterating global reduction 1 with 18 rules applied. Total rules applied 213 place count 692 transition count 1776
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 232 place count 673 transition count 1734
Iterating global reduction 1 with 19 rules applied. Total rules applied 251 place count 673 transition count 1734
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 268 place count 656 transition count 1696
Iterating global reduction 1 with 17 rules applied. Total rules applied 285 place count 656 transition count 1696
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 300 place count 641 transition count 1666
Iterating global reduction 1 with 15 rules applied. Total rules applied 315 place count 641 transition count 1666
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 326 place count 630 transition count 1644
Iterating global reduction 1 with 11 rules applied. Total rules applied 337 place count 630 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 340 place count 627 transition count 1636
Iterating global reduction 1 with 3 rules applied. Total rules applied 343 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 346 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 349 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 352 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 355 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 356 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 357 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 358 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 359 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 360 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 617 transition count 1614
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 367 place count 617 transition count 1610
Applied a total of 367 rules in 391 ms. Remains 617 /796 variables (removed 179) and now considering 1610/2056 (removed 446) transitions.
[2024-05-23 04:28:15] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
// Phase 1: matrix 1077 rows 617 cols
[2024-05-23 04:28:15] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:28:15] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-23 04:28:15] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-23 04:28:15] [INFO ] Invariant cache hit.
[2024-05-23 04:28:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:28:17] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
[2024-05-23 04:28:17] [INFO ] Redundant transitions in 23 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-23 04:28:17] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-23 04:28:17] [INFO ] Invariant cache hit.
[2024-05-23 04:28:17] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1694 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 268/887 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2495 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 31485 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
After SMT, in 69832ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 69847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 617/796 places, 1610/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72659 ms. Remains : 617/796 places, 1610/2056 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 435 ms.
Stack based approach found an accepted trace after 1300 steps with 0 reset with depth 1301 and stack size 1301 in 5 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-10 finished in 73162 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(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
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((p0||X(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLCardinality-06
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 766 transition count 1980
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 766 transition count 1980
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 79 place count 752 transition count 1940
Iterating global reduction 1 with 14 rules applied. Total rules applied 93 place count 752 transition count 1940
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 1 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 1 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 1 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 1 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 258 place count 661 transition count 1710
Iterating global reduction 1 with 17 rules applied. Total rules applied 275 place count 661 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 290 place count 646 transition count 1680
Iterating global reduction 1 with 15 rules applied. Total rules applied 305 place count 646 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 316 place count 635 transition count 1658
Iterating global reduction 1 with 11 rules applied. Total rules applied 327 place count 635 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 330 place count 632 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 333 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 336 place count 629 transition count 1642
Iterating global reduction 1 with 3 rules applied. Total rules applied 339 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 342 place count 626 transition count 1636
Iterating global reduction 1 with 3 rules applied. Total rules applied 345 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 346 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 347 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 348 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Applied a total of 353 rules in 249 ms. Remains 622 /796 variables (removed 174) and now considering 1628/2056 (removed 428) transitions.
[2024-05-23 04:29:28] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-23 04:29:28] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:29:29] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-23 04:29:29] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:29:29] [INFO ] Invariant cache hit.
[2024-05-23 04:29:29] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:29:31] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-23 04:29:31] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:29:31] [INFO ] Invariant cache hit.
[2024-05-23 04:29:31] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 70392ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 70412ms
Starting structural reductions in LI_LTL mode, iteration 1 : 622/796 places, 1628/2056 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 73063 ms. Remains : 622/796 places, 1628/2056 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 398 ms.
Product exploration explored 100000 steps with 0 reset in 430 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35236 steps (7 resets) in 30 ms. (1136 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 14 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-23 04:30:43] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:30:43] [INFO ] Invariant cache hit.
[2024-05-23 04:30:43] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-23 04:30:43] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:30:43] [INFO ] Invariant cache hit.
[2024-05-23 04:30:43] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:30:45] [INFO ] Implicit Places using invariants and state equation in 1839 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-23 04:30:45] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:30:45] [INFO ] Invariant cache hit.
[2024-05-23 04:30:45] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31383 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 69961ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 69994ms
Finished structural reductions in LTL mode , in 1 iterations and 72314 ms. Remains : 622/622 places, 1628/1628 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 40002 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 489908 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 489908 steps, saw 317984 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-23 04:31:58] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:31:58] [INFO ] Invariant cache hit.
[2024-05-23 04:31:58] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 557/578 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/585 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 934/1519 variables, 473/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1519 variables, 267/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1519 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 128/1709 variables, 130/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1709/1709 variables, and 892 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: 622/622 constraints, ReadFeed: 268/268 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 557/578 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/585 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 934/1519 variables, 473/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1519 variables, 267/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1519 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1581 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1581 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/1709 variables, 130/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1709 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1709 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 870ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 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 430 transition count 1244
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 391 place count 430 transition count 1238
Applied a total of 391 rules in 96 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 430/622 places, 1238/1628 transitions.
RANDOM walk for 33519 steps (7 resets) in 112 ms. (296 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 397 ms.
Product exploration explored 100000 steps with 0 reset in 520 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 9 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-23 04:32:01] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:32:01] [INFO ] Invariant cache hit.
[2024-05-23 04:32:01] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-23 04:32:01] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:32:01] [INFO ] Invariant cache hit.
[2024-05-23 04:32:01] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:32:03] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-23 04:32:03] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-23 04:32:03] [INFO ] Invariant cache hit.
[2024-05-23 04:32:03] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31198 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 69887ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 69905ms
Finished structural reductions in LTL mode , in 1 iterations and 72279 ms. Remains : 622/622 places, 1628/1628 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 225031 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)))'
[2024-05-23 04:33:13] [INFO ] Flatten gal took : 73 ms
[2024-05-23 04:33:13] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 04:33:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 796 places, 2056 transitions and 8350 arcs took 15 ms.
Total runtime 1828410 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 796
TRANSITIONS: 2056
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.041s, Sys 0.004s]


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


----------------------------------------------------------------------
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: 1811
MODEL NAME: /home/mcc/execution/412/model
796 places, 2056 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.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716439230206

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-c004"
export BK_EXAMINATION="LTLCardinality"
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-c004, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601200283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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