MCC'2024- Execution of r180-tall-171640603100283

About the Execution of ITS-Tools for FunctionPointer-PT-c004

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	806209.00	0.00	0.00	TTTT???????TFTFF	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640603100283.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 itstools
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 r180-tall-171640603100283
=====================================================================

--------------------
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 1716477945063

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 15:25:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 15:25:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:25:46] [INFO ] Load time of PNML (sax parser for PT used): 397 ms
[2024-05-23 15:25:46] [INFO ] Transformed 2826 places.
[2024-05-23 15:25:46] [INFO ] Transformed 8960 transitions.
[2024-05-23 15:25:46] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 40 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 1232 ms. Remains 796 /1628 variables (removed 832) and now considering 2056/5962 (removed 3906) transitions.
[2024-05-23 15:25:48] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
// Phase 1: matrix 1386 rows 796 cols
[2024-05-23 15:25:48] [INFO ] Computed 2 invariants in 51 ms
[2024-05-23 15:25:49] [INFO ] Implicit Places using invariants in 860 ms returned []
[2024-05-23 15:25:49] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-23 15:25:49] [INFO ] Invariant cache hit.
[2024-05-23 15:25:49] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-23 15:25:51] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 3612 ms to find 0 implicit places.
Running 2054 sub problems to find dead transitions.
[2024-05-23 15:25:52] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-23 15:25:52] [INFO ] Invariant cache hit.
[2024-05-23 15:25: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 30054 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 30040 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 71082ms problems are : Problem set: 0 solved, 2054 unsolved
Search for dead transitions found 0 dead transitions in 71123ms
Starting structural reductions in LTL mode, iteration 1 : 796/1628 places, 2056/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76013 ms. Remains : 796/1628 places, 2056/5962 transitions.
Support contains 27 out of 796 places after structural reductions.
[2024-05-23 15:27:03] [INFO ] Flatten gal took : 156 ms
[2024-05-23 15:27:03] [INFO ] Flatten gal took : 103 ms
[2024-05-23 15:27:03] [INFO ] Input system was already deterministic with 2056 transitions.
RANDOM walk for 40006 steps (8 resets) in 3874 ms. (10 steps per ms) remains 12/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
[2024-05-23 15:27:05] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-23 15:27:05] [INFO ] Invariant cache hit.
[2024-05-23 15:27:05] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 382/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 50/435 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 764/1199 variables, 435/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1199 variables, 25/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1199 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 8 (OVERLAPS) 367/1566 variables, 52/514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1566 variables, 242/756 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1566 variables, 0/756 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 483/2049 variables, 210/966 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2049 variables, 66/1032 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2049 variables, 0/1032 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 101/2150 variables, 82/1114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2150 variables, 0/1114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 28/2178 variables, 13/1127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2178 variables, 0/1127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/2182 variables, 4/1131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2182 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2182 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 1131 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1009 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/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 382/384 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 346/1371 variables, 4/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1371 variables, 240/629 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1371 variables, 2/631 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1371 variables, 0/631 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 575/1946 variables, 257/888 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1946 variables, 1/889 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1946 variables, 93/982 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1946 variables, 0/982 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 175/2121 variables, 120/1102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2121 variables, 0/1102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 40/2161 variables, 18/1120 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2161 variables, 0/1120 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 21/2182 variables, 13/1133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2182 variables, 0/1133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2182 variables, 0/1133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 1133 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1047 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: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2088ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 92 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.8 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 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 402 place count 586 transition count 1634
Iterating global reduction 1 with 17 rules applied. Total rules applied 419 place count 586 transition count 1634
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 425 place count 586 transition count 1628
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 441 place count 570 transition count 1586
Iterating global reduction 2 with 16 rules applied. Total rules applied 457 place count 570 transition count 1586
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 473 place count 554 transition count 1538
Iterating global reduction 2 with 16 rules applied. Total rules applied 489 place count 554 transition count 1538
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 510 place count 533 transition count 1470
Iterating global reduction 2 with 21 rules applied. Total rules applied 531 place count 533 transition count 1470
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 551 place count 513 transition count 1414
Iterating global reduction 2 with 20 rules applied. Total rules applied 571 place count 513 transition count 1414
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 591 place count 493 transition count 1374
Iterating global reduction 2 with 20 rules applied. Total rules applied 611 place count 493 transition count 1374
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 632 place count 472 transition count 1328
Iterating global reduction 2 with 21 rules applied. Total rules applied 653 place count 472 transition count 1328
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 672 place count 453 transition count 1286
Iterating global reduction 2 with 19 rules applied. Total rules applied 691 place count 453 transition count 1286
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 707 place count 437 transition count 1254
Iterating global reduction 2 with 16 rules applied. Total rules applied 723 place count 437 transition count 1254
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 734 place count 426 transition count 1232
Iterating global reduction 2 with 11 rules applied. Total rules applied 745 place count 426 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 748 place count 423 transition count 1224
Iterating global reduction 2 with 3 rules applied. Total rules applied 751 place count 423 transition count 1224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 754 place count 420 transition count 1216
Iterating global reduction 2 with 3 rules applied. Total rules applied 757 place count 420 transition count 1216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 760 place count 417 transition count 1210
Iterating global reduction 2 with 3 rules applied. Total rules applied 763 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 764 place count 416 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 765 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 766 place count 415 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 767 place count 415 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 768 place count 414 transition count 1204
Iterating global reduction 2 with 1 rules applied. Total rules applied 769 place count 414 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 770 place count 413 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 771 place count 413 transition count 1202
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 773 place count 413 transition count 1200
Applied a total of 773 rules in 440 ms. Remains 413 /796 variables (removed 383) and now considering 1200/2056 (removed 856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 413/796 places, 1200/2056 transitions.
RANDOM walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 551995 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 551995 steps, saw 338475 distinct states, run finished after 3007 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-23 15:27:10] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 15:27:10] [INFO ] Computed 3 invariants in 4 ms
[2024-05-23 15:27:10] [INFO ] State equation strengthened by 72 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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 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) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 758ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 772 steps, including 24 resets, run visited all 1 properties in 5 ms. (steps per millisecond=154 )
Parikh walk visited 1 properties in 10 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.22 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 309 ms. Remains 615 /796 variables (removed 181) and now considering 1612/2056 (removed 444) transitions.
[2024-05-23 15:27:12] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-23 15:27:12] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 15:27:12] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-23 15:27:12] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 15:27:12] [INFO ] Invariant cache hit.
[2024-05-23 15:27:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 15:27:14] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-23 15:27:14] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-23 15:27:14] [INFO ] Invariant cache hit.
[2024-05-23 15:27:14] [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
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 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30033 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 31604 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 69499ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69520ms
Starting structural reductions in LTL mode, iteration 1 : 615/796 places, 1612/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72124 ms. Remains : 615/796 places, 1612/2056 transitions.
Stuttering acceptance computed with spot in 206 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 668 ms.
Product exploration explored 100000 steps with 50000 reset in 566 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 16 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 73666 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 291 ms. Remains 620 /796 variables (removed 176) and now considering 1624/2056 (removed 432) transitions.
[2024-05-23 15:28:25] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 620 cols
[2024-05-23 15:28:25] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 15:28:26] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-23 15:28:26] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 15:28:26] [INFO ] Invariant cache hit.
[2024-05-23 15:28:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 15:28:28] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
Running 1622 sub problems to find dead transitions.
[2024-05-23 15:28:28] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 15:28:28] [INFO ] Invariant cache hit.
[2024-05-23 15:28:28] [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: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 7.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.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 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 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 30038 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 31652 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 69709ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 69726ms
Starting structural reductions in LTL mode, iteration 1 : 620/796 places, 1624/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72721 ms. Remains : 620/796 places, 1624/2056 transitions.
Stuttering acceptance computed with spot in 160 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 486 ms.
Product exploration explored 100000 steps with 33333 reset in 508 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 94 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 74001 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 557 ms. Remains 639 /796 variables (removed 157) and now considering 1658/2056 (removed 398) transitions.
[2024-05-23 15:29:40] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-23 15:29:40] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 15:29:40] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-23 15:29:40] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:29:40] [INFO ] Invariant cache hit.
[2024-05-23 15:29:40] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-23 15:29:42] [INFO ] Implicit Places using invariants and state equation in 2071 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
[2024-05-23 15:29:42] [INFO ] Redundant transitions in 85 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-23 15:29:42] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:29:42] [INFO ] Invariant cache hit.
[2024-05-23 15:29:42] [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 30047 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 30269 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 68771ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 68805ms
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 72023 ms. Remains : 639/796 places, 1658/2056 transitions.
Stuttering acceptance computed with spot in 95 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 535 ms.
Product exploration explored 100000 steps with 0 reset in 785 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.5 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 111 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (8 resets) in 312 ms. (127 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
[2024-05-23 15:30:53] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:30:53] [INFO ] Invariant cache hit.
[2024-05-23 15:30:53] [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 637 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 915 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 1568ms 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 102 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 102 ms. Remains : 447/639 places, 1272/1658 transitions.
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-05-23 15:30:55] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-23 15:30:55] [INFO ] Computed 3 invariants in 7 ms
[2024-05-23 15:30: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 329 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 408 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 758ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 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 50 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 50 ms. Remains : 447/447 places, 1272/1272 transitions.
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567223 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 567223 steps, saw 347813 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
[2024-05-23 15:30:59] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:30:59] [INFO ] Invariant cache hit.
[2024-05-23 15:30: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 380 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 413 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 804ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 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.
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.
[2024-05-23 15:31:00] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:31:00] [INFO ] Invariant cache hit.
[2024-05-23 15:31:00] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-23 15:31:00] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:31:00] [INFO ] Invariant cache hit.
[2024-05-23 15:31:00] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-23 15:31:01] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2024-05-23 15:31:01] [INFO ] Redundant transitions in 64 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-23 15:31:01] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:31:01] [INFO ] Invariant cache hit.
[2024-05-23 15:31:01] [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 15:31:17] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 21 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 30034 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 64885ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 64899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66805 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 49 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 15:32:06] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 15:32:06] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:32:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 15:32:06] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 15:32:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 15:32:06] [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 15:32:06] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:32:06] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 155 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 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 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 83 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-23 15:32:07] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-23 15:32:07] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 15:32:07] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-23 15:32:07] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:32:07] [INFO ] Invariant cache hit.
[2024-05-23 15:32:08] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-23 15:32:09] [INFO ] Implicit Places using invariants and state equation in 2034 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2024-05-23 15:32:09] [INFO ] Redundant transitions in 42 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-23 15:32:09] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:32:09] [INFO ] Invariant cache hit.
[2024-05-23 15:32:09] [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
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 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 30248 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 68265ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 68279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70921 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.4 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 166 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
[2024-05-23 15:33:18] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:33:18] [INFO ] Invariant cache hit.
[2024-05-23 15:33:18] [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 695 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 911 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 1666ms 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.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 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 102 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 102 ms. Remains : 447/639 places, 1272/1658 transitions.
RANDOM walk for 40000 steps (8 resets) in 388 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/2 properties
[2024-05-23 15:33:20] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-23 15:33:20] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 15:33:20] [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 365 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 410 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 830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 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 49 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 50 ms. Remains : 447/447 places, 1272/1272 transitions.
RANDOM walk for 40001 steps (8 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 544217 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 544217 steps, saw 333707 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-23 15:33:24] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:33:24] [INFO ] Invariant cache hit.
[2024-05-23 15:33:24] [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 351 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 427 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 826ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 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 52 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 53 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 15:33:25] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:33:25] [INFO ] Invariant cache hit.
[2024-05-23 15:33:25] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-23 15:33:25] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:33:25] [INFO ] Invariant cache hit.
[2024-05-23 15:33:26] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-23 15:33:27] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2024-05-23 15:33:27] [INFO ] Redundant transitions in 14 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-23 15:33:27] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-23 15:33:27] [INFO ] Invariant cache hit.
[2024-05-23 15:33:27] [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 15:33:43] [INFO ] Deduced a trap composed of 131 places in 175 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 30026 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1172/1173 variables, and 789 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 30034 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 64869ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 64882ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66711 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 29 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 15:34:32] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 15:34:32] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 15:34:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 15:34:32] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 15:34:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 15:34:32] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 15:34:32] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 15:34:32] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 130 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 189 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 466 ms.
Product exploration explored 100000 steps with 0 reset in 515 ms.
Built C files in :
/tmp/ltsmin467240133090200323
[2024-05-23 15:34:33] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2024-05-23 15:34:33] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin467240133090200323
Running compilation step : cd /tmp/ltsmin467240133090200323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin467240133090200323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin467240133090200323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 83 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-23 15:34:37] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-23 15:34:37] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 15:34:37] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-23 15:34:37] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:34:37] [INFO ] Invariant cache hit.
[2024-05-23 15:34:37] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-23 15:34:39] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
[2024-05-23 15:34:39] [INFO ] Redundant transitions in 25 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-23 15:34:39] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-23 15:34:39] [INFO ] Invariant cache hit.
[2024-05-23 15:34:39] [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
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 638/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30031 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 30230 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 69037ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 69054ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71710 ms. Remains : 639/639 places, 1658/1658 transitions.
Built C files in :
/tmp/ltsmin4825046507797881787
[2024-05-23 15:35:48] [INFO ] Too many transitions (1658) to apply POR reductions. Disabling POR matrices.
[2024-05-23 15:35:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4825046507797881787
Running compilation step : cd /tmp/ltsmin4825046507797881787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4825046507797881787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4825046507797881787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 15:35:52] [INFO ] Flatten gal took : 127 ms
[2024-05-23 15:35:52] [INFO ] Flatten gal took : 134 ms
[2024-05-23 15:35:52] [INFO ] Time to serialize gal into /tmp/LTL8032340210622888538.gal : 29 ms
[2024-05-23 15:35:52] [INFO ] Time to serialize properties into /tmp/LTL5613228810178762893.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8032340210622888538.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12452561252931685346.hoa' '-atoms' '/tmp/LTL5613228810178762893.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5613228810178762893.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12452561252931685346.hoa
Detected timeout of ITS tools.
[2024-05-23 15:36:07] [INFO ] Flatten gal took : 57 ms
[2024-05-23 15:36:07] [INFO ] Flatten gal took : 66 ms
[2024-05-23 15:36:07] [INFO ] Time to serialize gal into /tmp/LTL2223399361627694420.gal : 31 ms
[2024-05-23 15:36:07] [INFO ] Time to serialize properties into /tmp/LTL15151700848348651251.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2223399361627694420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15151700848348651251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p1539>=1)||(l2616<2))")))||(G("(l1659<=l932)")))))
Formula 0 simplified : G(FG!"((p1539>=1)||(l2616<2))" & F!"(l1659<=l932)")
Detected timeout of ITS tools.
[2024-05-23 15:36:22] [INFO ] Flatten gal took : 48 ms
[2024-05-23 15:36:22] [INFO ] Applying decomposition
[2024-05-23 15:36:22] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12671096197197037882.txt' '-o' '/tmp/graph12671096197197037882.bin' '-w' '/tmp/graph12671096197197037882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12671096197197037882.bin' '-l' '-1' '-v' '-w' '/tmp/graph12671096197197037882.weights' '-q' '0' '-e' '0.001'
[2024-05-23 15:36:23] [INFO ] Decomposing Gal with order
[2024-05-23 15:36:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 15:36:23] [INFO ] Removed a total of 559 redundant transitions.
[2024-05-23 15:36:23] [INFO ] Flatten gal took : 495 ms
[2024-05-23 15:36:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 48 ms.
[2024-05-23 15:36:24] [INFO ] Time to serialize gal into /tmp/LTL13348484821290317793.gal : 24 ms
[2024-05-23 15:36:24] [INFO ] Time to serialize properties into /tmp/LTL6305569531237164024.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13348484821290317793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6305569531237164024.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((gi0.gu2.p1539>=1)||(gi0.gu64.l2616<2))")))||(G("(gu63.l1659<=gu63.l932)")))))
Formula 0 simplified : G(FG!"((gi0.gu2.p1539>=1)||(gi0.gu64.l2616<2))" & F!"(gu63.l1659<=gu63.l932)")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-04 finished in 419541 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.2 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 481 ms. Remains 639 /796 variables (removed 157) and now considering 1660/2056 (removed 396) transitions.
[2024-05-23 15:36:39] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2024-05-23 15:36:39] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 15:36:40] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-23 15:36:40] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 15:36:40] [INFO ] Invariant cache hit.
[2024-05-23 15:36:40] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-23 15:36:42] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
[2024-05-23 15:36:42] [INFO ] Redundant transitions in 25 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-23 15:36:42] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 15:36:42] [INFO ] Invariant cache hit.
[2024-05-23 15:36:42] [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
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 30037 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 31598 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 70172ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 70189ms
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 73207 ms. Remains : 639/796 places, 1660/2056 transitions.
Stuttering acceptance computed with spot in 110 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 385 ms.
Product exploration explored 100000 steps with 0 reset in 457 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 183 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 140 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 0/5 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 278 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 198 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 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 79 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-23 15:37:54] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 15:37:54] [INFO ] Invariant cache hit.
[2024-05-23 15:37:54] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-23 15:37:54] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 15:37:54] [INFO ] Invariant cache hit.
[2024-05-23 15:37:55] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-23 15:37:56] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
[2024-05-23 15:37:56] [INFO ] Redundant transitions in 25 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-23 15:37:56] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-23 15:37:56] [INFO ] Invariant cache hit.
[2024-05-23 15:37:56] [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
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 30050 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 31670 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 70352ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 70366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72981 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 158 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 126 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/2 properties
BEST_FIRST walk for 39027 steps (8 resets) in 40 ms. (951 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 274 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 107 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 414 ms.
Product exploration explored 100000 steps with 0 reset in 446 ms.
Built C files in :
/tmp/ltsmin12934459970579507785
[2024-05-23 15:39:09] [INFO ] Too many transitions (1660) to apply POR reductions. Disabling POR matrices.
[2024-05-23 15:39:09] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12934459970579507785
Running compilation step : cd /tmp/ltsmin12934459970579507785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

BK_STOP 1716478751272

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r180-tall-171640603100283"
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 ;