fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640603100316
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FunctionPointer-PT-c064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13647.491 837731.00 1215228.00 1413.00 TFTTFFFFT?FFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:11 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-c064-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717194519139

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:28:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:28:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:28:40] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2024-05-31 22:28:40] [INFO ] Transformed 2826 places.
[2024-05-31 22:28:40] [INFO ] Transformed 8960 transitions.
[2024-05-31 22:28:40] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 39 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c064-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 310 place count 1318 transition count 3740
Iterating global reduction 1 with 293 rules applied. Total rules applied 603 place count 1318 transition count 3740
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 1 with 384 rules applied. Total rules applied 987 place count 1318 transition count 3356
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 1139 place count 1166 transition count 3052
Iterating global reduction 2 with 152 rules applied. Total rules applied 1291 place count 1166 transition count 3052
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1359 place count 1166 transition count 2984
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1373 place count 1152 transition count 2956
Iterating global reduction 3 with 14 rules applied. Total rules applied 1387 place count 1152 transition count 2956
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1401 place count 1138 transition count 2928
Iterating global reduction 3 with 14 rules applied. Total rules applied 1415 place count 1138 transition count 2928
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1429 place count 1124 transition count 2900
Iterating global reduction 3 with 14 rules applied. Total rules applied 1443 place count 1124 transition count 2900
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1457 place count 1110 transition count 2872
Iterating global reduction 3 with 14 rules applied. Total rules applied 1471 place count 1110 transition count 2872
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1485 place count 1096 transition count 2844
Iterating global reduction 3 with 14 rules applied. Total rules applied 1499 place count 1096 transition count 2844
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1511 place count 1084 transition count 2820
Iterating global reduction 3 with 12 rules applied. Total rules applied 1523 place count 1084 transition count 2820
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1535 place count 1072 transition count 2796
Iterating global reduction 3 with 12 rules applied. Total rules applied 1547 place count 1072 transition count 2796
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1592 place count 1027 transition count 2630
Iterating global reduction 3 with 45 rules applied. Total rules applied 1637 place count 1027 transition count 2630
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1693 place count 971 transition count 2406
Iterating global reduction 3 with 56 rules applied. Total rules applied 1749 place count 971 transition count 2406
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1804 place count 916 transition count 2262
Iterating global reduction 3 with 55 rules applied. Total rules applied 1859 place count 916 transition count 2262
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1914 place count 861 transition count 2152
Iterating global reduction 3 with 55 rules applied. Total rules applied 1969 place count 861 transition count 2152
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2024 place count 806 transition count 2042
Iterating global reduction 3 with 55 rules applied. Total rules applied 2079 place count 806 transition count 2042
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2134 place count 751 transition count 1932
Iterating global reduction 3 with 55 rules applied. Total rules applied 2189 place count 751 transition count 1932
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2241 place count 699 transition count 1828
Iterating global reduction 3 with 52 rules applied. Total rules applied 2293 place count 699 transition count 1828
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2310 place count 682 transition count 1794
Iterating global reduction 3 with 17 rules applied. Total rules applied 2327 place count 682 transition count 1794
Applied a total of 2327 rules in 1150 ms. Remains 682 /1628 variables (removed 946) and now considering 1794/5962 (removed 4168) transitions.
[2024-05-31 22:28:42] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
// Phase 1: matrix 1200 rows 682 cols
[2024-05-31 22:28:42] [INFO ] Computed 2 invariants in 30 ms
[2024-05-31 22:28:42] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-31 22:28:42] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
[2024-05-31 22:28:42] [INFO ] Invariant cache hit.
[2024-05-31 22:28:43] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-05-31 22:28:44] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
Running 1792 sub problems to find dead transitions.
[2024-05-31 22:28:44] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
[2024-05-31 22:28:44] [INFO ] Invariant cache hit.
[2024-05-31 22:28:44] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/1882 variables, and 2 constraints, problems are : Problem set: 0 solved, 1792 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/682 constraints, ReadFeed: 0/292 constraints, PredecessorRefiner: 1792/1792 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/682 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 3 (OVERLAPS) 1200/1882 variables, 682/684 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1882 variables, 292/976 constraints. Problems are: Problem set: 0 solved, 1792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1882/1882 variables, and 2768 constraints, problems are : Problem set: 0 solved, 1792 unsolved in 31901 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 682/682 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 1792/1792 constraints, Known Traps: 0/0 constraints]
After SMT, in 69744ms problems are : Problem set: 0 solved, 1792 unsolved
Search for dead transitions found 0 dead transitions in 69780ms
Starting structural reductions in LTL mode, iteration 1 : 682/1628 places, 1794/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73438 ms. Remains : 682/1628 places, 1794/5962 transitions.
Support contains 16 out of 682 places after structural reductions.
[2024-05-31 22:29:54] [INFO ] Flatten gal took : 130 ms
[2024-05-31 22:29:54] [INFO ] Flatten gal took : 87 ms
[2024-05-31 22:29:55] [INFO ] Input system was already deterministic with 1794 transitions.
Support contains 15 out of 682 places (down from 16) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40093 steps (8 resets) in 1766 ms. (22 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 167463 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 12
Probabilistic random walk after 167463 steps, saw 108714 distinct states, run finished after 3004 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-31 22:29:58] [INFO ] Flow matrix only has 1200 transitions (discarded 594 similar events)
[2024-05-31 22:29:58] [INFO ] Invariant cache hit.
[2024-05-31 22:29:58] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 383/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 928/1325 variables, 397/398 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 217/615 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 463/1788 variables, 197/812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1788 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1788 variables, 75/888 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1788 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 90/1878 variables, 85/973 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1878 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 4/1882 variables, 3/976 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1882 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/1882 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1882/1882 variables, and 976 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3000 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 682/682 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 383/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 928/1325 variables, 397/398 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 217/615 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 463/1788 variables, 197/812 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1788 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1788 variables, 75/888 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1788 variables, 12/900 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1788 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 90/1878 variables, 85/985 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1878 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 4/1882 variables, 3/988 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1882 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/1882 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1882/1882 variables, and 988 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 682/682 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 7775ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 10 properties in 14104 ms.
Support contains 5 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 674 transition count 1768
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 674 transition count 1768
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 674 transition count 1760
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 665 transition count 1742
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 665 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 665 transition count 1738
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 659 transition count 1718
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 659 transition count 1718
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 653 transition count 1696
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 653 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 647 transition count 1680
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 647 transition count 1680
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 641 transition count 1666
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 641 transition count 1666
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 635 transition count 1654
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 635 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 629 transition count 1642
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 629 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 623 transition count 1630
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 621 transition count 1626
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 620 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 620 transition count 1624
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 620 transition count 1618
Applied a total of 142 rules in 445 ms. Remains 620 /682 variables (removed 62) and now considering 1618/1794 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 620/682 places, 1618/1794 transitions.
RANDOM walk for 40020 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 293699 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 293699 steps, saw 190642 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-31 22:30:24] [INFO ] Flow matrix only has 1084 transitions (discarded 534 similar events)
// Phase 1: matrix 1084 rows 620 cols
[2024-05-31 22:30:24] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 22:30:24] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 546/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 950/1501 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1501 variables, 270/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 62/1563 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1563 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 135/1698 variables, 133/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1698 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/1704 variables, 4/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1704 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1704 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1704/1704 variables, and 892 constraints, problems are : Problem set: 0 solved, 2 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 270/270 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 546/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 950/1501 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1501 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1501 variables, 270/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1501 variables, 2/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1501 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1563 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 22:30:25] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1563 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1563 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 135/1698 variables, 133/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1698 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/1704 variables, 4/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1704 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1704 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1704/1704 variables, and 895 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2177ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 18557 steps, including 102 resets, run visited all 2 properties in 251 ms. (steps per millisecond=73 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 255 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)||G(!p2)) U p3))'
Support contains 6 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 675 transition count 1774
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 675 transition count 1774
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 24 place count 675 transition count 1764
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 668 transition count 1748
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 668 transition count 1748
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 664 transition count 1736
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 664 transition count 1736
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 660 transition count 1722
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 660 transition count 1722
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 656 transition count 1712
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 656 transition count 1712
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 652 transition count 1704
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 652 transition count 1704
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 648 transition count 1696
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 648 transition count 1696
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 645 transition count 1690
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 645 transition count 1690
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 642 transition count 1684
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 642 transition count 1684
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 641 transition count 1682
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 641 transition count 1682
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 102 place count 641 transition count 1672
Applied a total of 102 rules in 462 ms. Remains 641 /682 variables (removed 41) and now considering 1672/1794 (removed 122) transitions.
[2024-05-31 22:30:27] [INFO ] Flow matrix only has 1117 transitions (discarded 555 similar events)
// Phase 1: matrix 1117 rows 641 cols
[2024-05-31 22:30:27] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 22:30:27] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-31 22:30:27] [INFO ] Flow matrix only has 1117 transitions (discarded 555 similar events)
[2024-05-31 22:30:27] [INFO ] Invariant cache hit.
[2024-05-31 22:30:28] [INFO ] State equation strengthened by 274 read => feed constraints.
[2024-05-31 22:30:29] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
[2024-05-31 22:30:29] [INFO ] Redundant transitions in 91 ms returned []
Running 1670 sub problems to find dead transitions.
[2024-05-31 22:30:29] [INFO ] Flow matrix only has 1117 transitions (discarded 555 similar events)
[2024-05-31 22:30:29] [INFO ] Invariant cache hit.
[2024-05-31 22:30:29] [INFO ] State equation strengthened by 274 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1670 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 641/1758 variables, and 2 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/641 constraints, ReadFeed: 0/274 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/641 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 3 (OVERLAPS) 1117/1758 variables, 641/643 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1758 variables, 274/917 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1758/1758 variables, and 2587 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 31092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 641/641 constraints, ReadFeed: 274/274 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints]
After SMT, in 69262ms problems are : Problem set: 0 solved, 1670 unsolved
Search for dead transitions found 0 dead transitions in 69279ms
Starting structural reductions in SI_LTL mode, iteration 1 : 641/682 places, 1672/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71829 ms. Remains : 641/682 places, 1672/1794 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p3), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-01
Stuttering criterion allowed to conclude after 10974 steps with 78 reset in 122 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-01 finished in 72257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1760
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 672 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 661 transition count 1728
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 661 transition count 1728
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 661 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 62 place count 653 transition count 1700
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 653 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 645 transition count 1674
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 645 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 637 transition count 1654
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 637 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 629 transition count 1636
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 629 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 125 place count 622 transition count 1622
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 622 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 616 transition count 1610
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 616 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 610 transition count 1598
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 610 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 608 transition count 1594
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 607 transition count 1592
Applied a total of 162 rules in 202 ms. Remains 607 /682 variables (removed 75) and now considering 1592/1794 (removed 202) transitions.
[2024-05-31 22:31:39] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-31 22:31:39] [INFO ] Computed 2 invariants in 14 ms
[2024-05-31 22:31:39] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-31 22:31:39] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-31 22:31:39] [INFO ] Invariant cache hit.
[2024-05-31 22:31:40] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-31 22:31:41] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2024-05-31 22:31:41] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2024-05-31 22:31:41] [INFO ] Invariant cache hit.
[2024-05-31 22:31:41] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1670 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1670 variables, 264/873 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1670/1670 variables, and 2463 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30595 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 607/607 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints]
After SMT, in 67669ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 67694ms
Starting structural reductions in LTL mode, iteration 1 : 607/682 places, 1592/1794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69984 ms. Remains : 607/682 places, 1592/1794 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-06
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-06 finished in 70123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1760
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 672 transition count 1752
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 661 transition count 1728
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 661 transition count 1728
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 661 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 62 place count 653 transition count 1700
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 653 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 645 transition count 1674
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 645 transition count 1674
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 637 transition count 1654
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 637 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 629 transition count 1636
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 629 transition count 1636
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 125 place count 622 transition count 1622
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 622 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 616 transition count 1610
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 616 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 610 transition count 1598
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 610 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 608 transition count 1594
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 607 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 607 transition count 1592
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 607 transition count 1590
Applied a total of 164 rules in 352 ms. Remains 607 /682 variables (removed 75) and now considering 1590/1794 (removed 204) transitions.
[2024-05-31 22:32:49] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2024-05-31 22:32:49] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 22:32:50] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-31 22:32:50] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2024-05-31 22:32:50] [INFO ] Invariant cache hit.
[2024-05-31 22:32:50] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-31 22:32:51] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2024-05-31 22:32:51] [INFO ] Redundant transitions in 83 ms returned []
Running 1588 sub problems to find dead transitions.
[2024-05-31 22:32:51] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2024-05-31 22:32:51] [INFO ] Invariant cache hit.
[2024-05-31 22:32:51] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1588 unsolved
SMT process timed out in 37837ms, After SMT, problems are : Problem set: 0 solved, 1588 unsolved
Search for dead transitions found 0 dead transitions in 37851ms
Starting structural reductions in SI_LTL mode, iteration 1 : 607/682 places, 1590/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40294 ms. Remains : 607/682 places, 1590/1794 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-07
Stuttering criterion allowed to conclude after 357 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-07 finished in 40355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 671 transition count 1758
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 671 transition count 1758
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 671 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 659 transition count 1722
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 659 transition count 1722
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 651 transition count 1694
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 651 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 643 transition count 1668
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 643 transition count 1668
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 635 transition count 1648
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 635 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 116 place count 627 transition count 1630
Iterating global reduction 2 with 8 rules applied. Total rules applied 124 place count 627 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 620 transition count 1616
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 620 transition count 1616
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 614 transition count 1604
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 614 transition count 1604
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 608 transition count 1592
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 608 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 606 transition count 1588
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 605 transition count 1584
Applied a total of 170 rules in 330 ms. Remains 605 /682 variables (removed 77) and now considering 1584/1794 (removed 210) transitions.
[2024-05-31 22:33:30] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-31 22:33:30] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 22:33:30] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-31 22:33:30] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:33:30] [INFO ] Invariant cache hit.
[2024-05-31 22:33:30] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:33:31] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2024-05-31 22:33:31] [INFO ] Redundant transitions in 35 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 22:33:32] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:33:32] [INFO ] Invariant cache hit.
[2024-05-31 22:33:32] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
SMT process timed out in 36841ms, After SMT, problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 36858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/682 places, 1584/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39133 ms. Remains : 605/682 places, 1584/1794 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-09
Product exploration explored 100000 steps with 778 reset in 560 ms.
Product exploration explored 100000 steps with 754 reset in 610 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40049 steps (8 resets) in 121 ms. (328 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 562945 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562945 steps, saw 365384 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2024-05-31 22:34:13] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:34:13] [INFO ] Invariant cache hit.
[2024-05-31 22:34:13] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1515 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1515 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1516 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 132/1648 variables, 130/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1515 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1515 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1516 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/1648 variables, 130/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:34:14] [INFO ] Deduced a trap composed of 131 places in 96 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1604ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 293 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 75 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 605/605 places, 1584/1584 transitions.
RANDOM walk for 40065 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559868 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559868 steps, saw 363388 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-31 22:34:18] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:34:18] [INFO ] Invariant cache hit.
[2024-05-31 22:34:18] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1515 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1515 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1516 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 132/1648 variables, 130/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1515 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1515 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1516 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/1648 variables, 130/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:34:19] [INFO ] Deduced a trap composed of 131 places in 94 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1523ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 76036 steps, including 165 resets, run visited all 1 properties in 194 ms. (steps per millisecond=391 )
Parikh walk visited 1 properties in 194 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 78 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-31 22:34:20] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:34:20] [INFO ] Invariant cache hit.
[2024-05-31 22:34:20] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-31 22:34:20] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:34:20] [INFO ] Invariant cache hit.
[2024-05-31 22:34:21] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:34:22] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2024-05-31 22:34:22] [INFO ] Redundant transitions in 29 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 22:34:22] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:34:22] [INFO ] Invariant cache hit.
[2024-05-31 22:34:22] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
SMT process timed out in 36905ms, After SMT, problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 36922ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38863 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40053 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 564715 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 564715 steps, saw 366532 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-31 22:35:02] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:35:02] [INFO ] Invariant cache hit.
[2024-05-31 22:35:02] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1515 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1515 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1516 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 132/1648 variables, 130/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1515 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1515 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1516 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/1648 variables, 130/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:35:03] [INFO ] Deduced a trap composed of 131 places in 89 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1499ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 236 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 67 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 605/605 places, 1584/1584 transitions.
RANDOM walk for 40087 steps (8 resets) in 91 ms. (435 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 565104 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 565104 steps, saw 366787 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2024-05-31 22:35:07] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:35:07] [INFO ] Invariant cache hit.
[2024-05-31 22:35:07] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1515 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1515 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1516 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 132/1648 variables, 130/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1120/1453 variables, 464/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1453 variables, 262/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1453 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1515 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1515 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1516 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1516 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1516 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/1648 variables, 130/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:35:08] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1500ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 243 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 69 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 605/605 places, 1584/1584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 68 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-31 22:35:09] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:35:09] [INFO ] Invariant cache hit.
[2024-05-31 22:35:09] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-31 22:35:09] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:35:09] [INFO ] Invariant cache hit.
[2024-05-31 22:35:09] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:35:10] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
[2024-05-31 22:35:10] [INFO ] Redundant transitions in 28 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 22:35:10] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:35:10] [INFO ] Invariant cache hit.
[2024-05-31 22:35:10] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
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 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30364 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 67007ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 67021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68901 ms. Remains : 605/605 places, 1584/1584 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 929 edges and 605 vertex of which 189 / 605 are part of one of the 63 SCC in 3 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 315 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 479 transition count 857
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 468 transition count 857
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 23 place count 468 transition count 788
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 161 place count 399 transition count 788
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 223 place count 337 transition count 726
Iterating global reduction 2 with 62 rules applied. Total rules applied 285 place count 337 transition count 726
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 409 place count 337 transition count 602
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 663 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 727 place count 146 transition count 347
Iterating global reduction 3 with 64 rules applied. Total rules applied 791 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 792 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 792 place count 146 transition count 345
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 794 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 857 place count 82 transition count 219
Iterating global reduction 4 with 63 rules applied. Total rules applied 920 place count 82 transition count 219
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 983 place count 19 transition count 93
Iterating global reduction 4 with 63 rules applied. Total rules applied 1046 place count 19 transition count 93
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1109 place count 19 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1109 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1111 place count 18 transition count 29
Applied a total of 1111 rules in 166 ms. Remains 18 /605 variables (removed 587) and now considering 29/1584 (removed 1555) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 29 rows 18 cols
[2024-05-31 22:36:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:36:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 22:36:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 22:36:18] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:36:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 22:36:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 22:36:18] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:36:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:36:18] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:36:18] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:36:18] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 251 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 747 reset in 459 ms.
Product exploration explored 100000 steps with 763 reset in 482 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 84 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-31 22:36:19] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-31 22:36:19] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 22:36:19] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-31 22:36:19] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:36:19] [INFO ] Invariant cache hit.
[2024-05-31 22:36:20] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:36:21] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-05-31 22:36:21] [INFO ] Redundant transitions in 27 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 22:36:21] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 22:36:21] [INFO ] Invariant cache hit.
[2024-05-31 22:36:21] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68353ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70301 ms. Remains : 605/605 places, 1584/1584 transitions.
Treatment of property FunctionPointer-PT-c064-LTLFireability-09 finished in 240031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U p1)))'
Support contains 4 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 673 transition count 1764
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 673 transition count 1764
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 673 transition count 1756
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 663 transition count 1736
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 663 transition count 1736
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 663 transition count 1732
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 656 transition count 1710
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 656 transition count 1710
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 649 transition count 1686
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 649 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 642 transition count 1668
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 642 transition count 1668
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 99 place count 635 transition count 1652
Iterating global reduction 2 with 7 rules applied. Total rules applied 106 place count 635 transition count 1652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 629 transition count 1640
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 629 transition count 1640
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 623 transition count 1628
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 623 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 617 transition count 1616
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 614 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 614 transition count 1610
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 150 place count 614 transition count 1608
Applied a total of 150 rules in 341 ms. Remains 614 /682 variables (removed 68) and now considering 1608/1794 (removed 186) transitions.
[2024-05-31 22:37:30] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
// Phase 1: matrix 1075 rows 614 cols
[2024-05-31 22:37:30] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 22:37:30] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-31 22:37:30] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2024-05-31 22:37:30] [INFO ] Invariant cache hit.
[2024-05-31 22:37:30] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 22:37:31] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2024-05-31 22:37:31] [INFO ] Redundant transitions in 26 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:37:31] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2024-05-31 22:37:31] [INFO ] Invariant cache hit.
[2024-05-31 22:37:31] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1689 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1689 variables, 267/883 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1689/1689 variables, and 2489 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68258ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/682 places, 1608/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70440 ms. Remains : 614/682 places, 1608/1794 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-10
Entered a terminal (fully accepting) state of product in 7157 steps with 57 reset in 48 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-10 finished in 70640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1764
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1764
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 672 transition count 1754
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 661 transition count 1730
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 661 transition count 1730
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 661 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 654 transition count 1702
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 654 transition count 1702
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 647 transition count 1680
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 647 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 95 place count 640 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 640 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 633 transition count 1646
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 633 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 122 place count 627 transition count 1634
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 627 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 143 place count 617 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 614 transition count 1604
Applied a total of 158 rules in 300 ms. Remains 614 /682 variables (removed 68) and now considering 1604/1794 (removed 190) transitions.
[2024-05-31 22:38:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-31 22:38:40] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 22:38:41] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-31 22:38:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:38:41] [INFO ] Invariant cache hit.
[2024-05-31 22:38:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:38:42] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
[2024-05-31 22:38:42] [INFO ] Redundant transitions in 31 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-31 22:38:42] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-31 22:38:42] [INFO ] Invariant cache hit.
[2024-05-31 22:38:42] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30457 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 67919ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 67935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/682 places, 1604/1794 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70329 ms. Remains : 614/682 places, 1604/1794 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-11
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-11 finished in 70395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 672 transition count 1760
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 672 transition count 1760
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 672 transition count 1750
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 661 transition count 1726
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 661 transition count 1726
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 661 transition count 1722
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 654 transition count 1702
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 654 transition count 1702
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 647 transition count 1680
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 647 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 640 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 640 transition count 1662
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 633 transition count 1646
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 633 transition count 1646
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 627 transition count 1634
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 627 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 622 transition count 1624
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 617 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 614 transition count 1608
Applied a total of 150 rules in 152 ms. Remains 614 /682 variables (removed 68) and now considering 1608/1794 (removed 186) transitions.
[2024-05-31 22:39:50] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-31 22:39:50] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 22:39:51] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-31 22:39:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:39:51] [INFO ] Invariant cache hit.
[2024-05-31 22:39:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 22:39:52] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-31 22:39:53] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 22:39:53] [INFO ] Invariant cache hit.
[2024-05-31 22:39:53] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1687/1687 variables, and 2487 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 68165ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 68180ms
Starting structural reductions in LTL mode, iteration 1 : 614/682 places, 1608/1794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70394 ms. Remains : 614/682 places, 1608/1794 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1680 steps with 13 reset in 14 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-14 finished in 70520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||F(p2))&&p0)))'
Support contains 3 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1794/1794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 671 transition count 1758
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 671 transition count 1758
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 671 transition count 1748
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 44 place count 659 transition count 1722
Iterating global reduction 1 with 12 rules applied. Total rules applied 56 place count 659 transition count 1722
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 651 transition count 1694
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 651 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 643 transition count 1668
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 643 transition count 1668
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 635 transition count 1648
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 635 transition count 1648
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 116 place count 627 transition count 1630
Iterating global reduction 2 with 8 rules applied. Total rules applied 124 place count 627 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 620 transition count 1616
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 620 transition count 1616
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 614 transition count 1604
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 614 transition count 1604
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 608 transition count 1592
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 608 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 606 transition count 1588
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 605 transition count 1586
Applied a total of 168 rules in 135 ms. Remains 605 /682 variables (removed 77) and now considering 1586/1794 (removed 208) transitions.
[2024-05-31 22:41:01] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-31 22:41:01] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 22:41:01] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-31 22:41:01] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:41:01] [INFO ] Invariant cache hit.
[2024-05-31 22:41:02] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 22:41:03] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-31 22:41:03] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-31 22:41:03] [INFO ] Invariant cache hit.
[2024-05-31 22:41:03] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 37210ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 37228ms
Starting structural reductions in LTL mode, iteration 1 : 605/682 places, 1586/1794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39252 ms. Remains : 605/682 places, 1586/1794 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-15 finished in 39445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-31 22:41:40] [INFO ] Flatten gal took : 66 ms
[2024-05-31 22:41:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 22:41:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 682 places, 1794 transitions and 7302 arcs took 14 ms.
Total runtime 780771 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-c064-LTLFireability-09

BK_STOP 1717195356870

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-c064-LTLFireability-09
ltl formula formula --ltl=/tmp/946/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 682 places, 1794 transitions and 7302 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.050 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/946/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/946/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/946/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/946/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 683 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 683, there are 1800 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~74712 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~149712 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~299712 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~599712 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~160000 states ~1199712 transitions
pnml2lts-mc( 2/ 4): ~80000 levels ~320000 states ~2399712 transitions
pnml2lts-mc( 2/ 4): ~160000 levels ~640000 states ~4799712 transitions
pnml2lts-mc( 2/ 4): ~320000 levels ~1280000 states ~9599712 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1338237
pnml2lts-mc( 0/ 4): unique transitions count: 11838858
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 507462
pnml2lts-mc( 0/ 4): - claim success count: 1338251
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1303669
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1338251 states 11838918 transitions, fanout: 8.847
pnml2lts-mc( 0/ 4): Total exploration time 54.590 sec (54.560 sec minimum, 54.575 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24515, Transitions per second: 216870
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 105.7MB, 20.3 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1824 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 105.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c064"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c064, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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