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.r180-tall-171640603100315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FunctionPointer-PT-c064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603100315
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716489886213

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 18:44:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 18:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:44:47] [INFO ] Load time of PNML (sax parser for PT used): 400 ms
[2024-05-23 18:44:47] [INFO ] Transformed 2826 places.
[2024-05-23 18:44:47] [INFO ] Transformed 8960 transitions.
[2024-05-23 18:44:47] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 315 place count 1313 transition count 3682
Iterating global reduction 1 with 299 rules applied. Total rules applied 614 place count 1313 transition count 3682
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 974 place count 1313 transition count 3322
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1130 place count 1157 transition count 3010
Iterating global reduction 2 with 156 rules applied. Total rules applied 1286 place count 1157 transition count 3010
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1354 place count 1157 transition count 2942
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1367 place count 1144 transition count 2916
Iterating global reduction 3 with 13 rules applied. Total rules applied 1380 place count 1144 transition count 2916
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1393 place count 1131 transition count 2890
Iterating global reduction 3 with 13 rules applied. Total rules applied 1406 place count 1131 transition count 2890
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1419 place count 1118 transition count 2864
Iterating global reduction 3 with 13 rules applied. Total rules applied 1432 place count 1118 transition count 2864
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1445 place count 1105 transition count 2838
Iterating global reduction 3 with 13 rules applied. Total rules applied 1458 place count 1105 transition count 2838
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1471 place count 1092 transition count 2812
Iterating global reduction 3 with 13 rules applied. Total rules applied 1484 place count 1092 transition count 2812
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1497 place count 1079 transition count 2786
Iterating global reduction 3 with 13 rules applied. Total rules applied 1510 place count 1079 transition count 2786
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1523 place count 1066 transition count 2760
Iterating global reduction 3 with 13 rules applied. Total rules applied 1536 place count 1066 transition count 2760
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1588 place count 1014 transition count 2566
Iterating global reduction 3 with 52 rules applied. Total rules applied 1640 place count 1014 transition count 2566
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1699 place count 955 transition count 2330
Iterating global reduction 3 with 59 rules applied. Total rules applied 1758 place count 955 transition count 2330
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1817 place count 896 transition count 2184
Iterating global reduction 3 with 59 rules applied. Total rules applied 1876 place count 896 transition count 2184
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1934 place count 838 transition count 2068
Iterating global reduction 3 with 58 rules applied. Total rules applied 1992 place count 838 transition count 2068
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2050 place count 780 transition count 1952
Iterating global reduction 3 with 58 rules applied. Total rules applied 2108 place count 780 transition count 1952
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2166 place count 722 transition count 1836
Iterating global reduction 3 with 58 rules applied. Total rules applied 2224 place count 722 transition count 1836
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2280 place count 666 transition count 1724
Iterating global reduction 3 with 56 rules applied. Total rules applied 2336 place count 666 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2350 place count 652 transition count 1696
Iterating global reduction 3 with 14 rules applied. Total rules applied 2364 place count 652 transition count 1696
Applied a total of 2364 rules in 1181 ms. Remains 652 /1628 variables (removed 976) and now considering 1696/5962 (removed 4266) transitions.
[2024-05-23 18:44:49] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
// Phase 1: matrix 1139 rows 652 cols
[2024-05-23 18:44:49] [INFO ] Computed 2 invariants in 37 ms
[2024-05-23 18:44:50] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-23 18:44:50] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
[2024-05-23 18:44:50] [INFO ] Invariant cache hit.
[2024-05-23 18:44:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-23 18:44:52] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned []
Implicit Place search using SMT with State Equation took 2927 ms to find 0 implicit places.
Running 1694 sub problems to find dead transitions.
[2024-05-23 18:44:52] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
[2024-05-23 18:44:52] [INFO ] Invariant cache hit.
[2024-05-23 18:44:52] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
(s159 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 14.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0timeout
)
(s160 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/1791 variables, and 2 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/652 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1694/1694 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1790 variables, 651/653 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1790 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1790 variables, 256/1192 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1790/1791 variables, and 1192 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/652 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 256/1694 constraints, Known Traps: 0/0 constraints]
After SMT, in 67082ms problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 67119ms
Starting structural reductions in LTL mode, iteration 1 : 652/1628 places, 1696/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71260 ms. Remains : 652/1628 places, 1696/5962 transitions.
Support contains 9 out of 652 places after structural reductions.
[2024-05-23 18:45:59] [INFO ] Flatten gal took : 136 ms
[2024-05-23 18:45:59] [INFO ] Flatten gal took : 92 ms
[2024-05-23 18:46:00] [INFO ] Input system was already deterministic with 1696 transitions.
RANDOM walk for 40056 steps (8 resets) in 1020 ms. (39 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 270 ms. (147 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (14 resets) in 155 ms. (256 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (21 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
[2024-05-23 18:46:00] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
[2024-05-23 18:46:00] [INFO ] Invariant cache hit.
[2024-05-23 18:46:00] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/30 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 585/615 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 14/629 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 959/1588 variables, 489/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1588 variables, 282/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1588 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 62/1650 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1650 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 138/1788 variables, 137/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1788 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 3/1791 variables, 2/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1791 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1791 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1791/1791 variables, and 937 constraints, problems are : Problem set: 0 solved, 3 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 652/652 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/30 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 585/615 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 14/629 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/629 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 959/1588 variables, 489/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1588 variables, 282/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1588 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 62/1650 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1650 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 138/1788 variables, 137/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1788 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 3/1791 variables, 2/940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1791 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1791 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1791/1791 variables, and 940 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 652/652 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2215ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Graph (complete) has 2821 edges and 652 vertex of which 459 are kept as prefixes of interest. Removing 193 places using SCC suffix rule.5 ms
Discarding 193 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 459 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 390 place count 454 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 395 place count 454 transition count 1300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 397 place count 454 transition count 1298
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 401 place count 450 transition count 1288
Iterating global reduction 2 with 4 rules applied. Total rules applied 405 place count 450 transition count 1288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 408 place count 447 transition count 1282
Iterating global reduction 2 with 3 rules applied. Total rules applied 411 place count 447 transition count 1282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 414 place count 444 transition count 1276
Iterating global reduction 2 with 3 rules applied. Total rules applied 417 place count 444 transition count 1276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 419 place count 442 transition count 1272
Iterating global reduction 2 with 2 rules applied. Total rules applied 421 place count 442 transition count 1272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 423 place count 440 transition count 1268
Iterating global reduction 2 with 2 rules applied. Total rules applied 425 place count 440 transition count 1268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 427 place count 438 transition count 1264
Iterating global reduction 2 with 2 rules applied. Total rules applied 429 place count 438 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 430 place count 437 transition count 1262
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 437 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 432 place count 436 transition count 1260
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 436 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 434 place count 435 transition count 1256
Iterating global reduction 2 with 1 rules applied. Total rules applied 435 place count 435 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 436 place count 434 transition count 1252
Iterating global reduction 2 with 1 rules applied. Total rules applied 437 place count 434 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 438 place count 433 transition count 1250
Iterating global reduction 2 with 1 rules applied. Total rules applied 439 place count 433 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 440 place count 432 transition count 1248
Iterating global reduction 2 with 1 rules applied. Total rules applied 441 place count 432 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 442 place count 431 transition count 1246
Iterating global reduction 2 with 1 rules applied. Total rules applied 443 place count 431 transition count 1246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 444 place count 430 transition count 1244
Iterating global reduction 2 with 1 rules applied. Total rules applied 445 place count 430 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 446 place count 429 transition count 1242
Iterating global reduction 2 with 1 rules applied. Total rules applied 447 place count 429 transition count 1242
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 453 place count 429 transition count 1236
Applied a total of 453 rules in 376 ms. Remains 429 /652 variables (removed 223) and now considering 1236/1696 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 429/652 places, 1236/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 1231 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 304117 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 3
Probabilistic random walk after 304117 steps, saw 186490 distinct states, run finished after 3006 ms. (steps per millisecond=101 ) properties seen :0
[2024-05-23 18:46:06] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
// Phase 1: matrix 701 rows 429 cols
[2024-05-23 18:46:06] [INFO ] Computed 3 invariants in 6 ms
[2024-05-23 18:46:06] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 361/383 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/392 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 610/1002 variables, 342/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 77/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 62/1064 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 66/1130 variables, 67/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1130 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1130 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 510 constraints, problems are : Problem set: 0 solved, 3 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 361/383 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/392 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 610/1002 variables, 342/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 77/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1002 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 62/1064 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1064 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 66/1130 variables, 67/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1130 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1130 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 513 constraints, problems are : Problem set: 0 solved, 3 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1011ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 55 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 429/429 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 46 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2024-05-23 18:46:07] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:46:07] [INFO ] Invariant cache hit.
[2024-05-23 18:46:08] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-23 18:46:08] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:46:08] [INFO ] Invariant cache hit.
[2024-05-23 18:46:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 18:46:09] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2024-05-23 18:46:09] [INFO ] Redundant transitions in 73 ms returned []
Running 1234 sub problems to find dead transitions.
[2024-05-23 18:46:09] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:46:09] [INFO ] Invariant cache hit.
[2024-05-23 18:46:09] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
[2024-05-23 18:46:29] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 701/1130 variables, 429/433 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
SMT process timed out in 34126ms, After SMT, problems are : Problem set: 0 solved, 1234 unsolved
Search for dead transitions found 0 dead transitions in 34141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35869 ms. Remains : 429/429 places, 1236/1236 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 429 transition count 691
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 555 place count 419 transition count 691
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 555 place count 419 transition count 616
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 705 place count 344 transition count 616
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 961 place count 216 transition count 488
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 152 transition count 360
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 152 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 152 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 89 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 89 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 26 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 26 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 26 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 26 transition count 42
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 1408 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 23 transition count 41
Applied a total of 1412 rules in 56 ms. Remains 23 /429 variables (removed 406) and now considering 41/1236 (removed 1195) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 23 cols
[2024-05-23 18:46:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 18:46:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 18:46:43] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-23 18:46:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 18:46:43] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 18:46:43] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 18:46:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 18:46:43] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 18:46:43] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 18:46:43] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 18:46:43] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 182 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3757 edges and 652 vertex of which 651 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 646 transition count 1680
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 646 transition count 1680
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 646 transition count 1678
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 641 transition count 1664
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 641 transition count 1664
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 637 transition count 1654
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 637 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 633 transition count 1644
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 633 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 630 transition count 1638
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 630 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 627 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 627 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 624 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 623 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 622 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 622 transition count 1622
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 622 transition count 1618
Applied a total of 66 rules in 617 ms. Remains 622 /652 variables (removed 30) and now considering 1618/1696 (removed 78) transitions.
[2024-05-23 18:46:44] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
// Phase 1: matrix 1081 rows 622 cols
[2024-05-23 18:46:44] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 18:46:45] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-23 18:46:45] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2024-05-23 18:46:45] [INFO ] Invariant cache hit.
[2024-05-23 18:46:45] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 18:46:47] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2493 ms to find 0 implicit places.
[2024-05-23 18:46:47] [INFO ] Redundant transitions in 44 ms returned []
Running 1616 sub problems to find dead transitions.
[2024-05-23 18:46:47] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2024-05-23 18:46:47] [INFO ] Invariant cache hit.
[2024-05-23 18:46:47] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 3 (OVERLAPS) 1081/1702 variables, 621/623 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1702 variables, 267/890 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1702 variables, 256/1146 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1702/1703 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/622 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 256/1616 constraints, Known Traps: 0/0 constraints]
After SMT, in 67442ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 67457ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/652 places, 1618/1696 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70624 ms. Remains : 622/652 places, 1618/1696 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-01
Product exploration explored 100000 steps with 733 reset in 747 ms.
Stuttering criterion allowed to conclude after 78132 steps with 606 reset in 452 ms.
FORMULA FunctionPointer-PT-c064-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLCardinality-01 finished in 72107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 651 transition count 1696
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 646 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 646 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 642 transition count 1670
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 642 transition count 1670
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 638 transition count 1660
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 638 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 634 transition count 1650
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 634 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 630 transition count 1642
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 630 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 626 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 626 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 622 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 622 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 620 transition count 1622
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 618 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 618 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 616 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 616 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 615 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 615 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 614 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 614 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 613 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 613 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 612 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 611 transition count 1600
Applied a total of 81 rules in 205 ms. Remains 611 /652 variables (removed 41) and now considering 1600/1696 (removed 96) transitions.
[2024-05-23 18:47:56] [INFO ] Flow matrix only has 1070 transitions (discarded 530 similar events)
// Phase 1: matrix 1070 rows 611 cols
[2024-05-23 18:47:56] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 18:47:56] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-23 18:47:56] [INFO ] Flow matrix only has 1070 transitions (discarded 530 similar events)
[2024-05-23 18:47:56] [INFO ] Invariant cache hit.
[2024-05-23 18:47:57] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 18:47:58] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
Running 1598 sub problems to find dead transitions.
[2024-05-23 18:47:58] [INFO ] Flow matrix only has 1070 transitions (discarded 530 similar events)
[2024-05-23 18:47:58] [INFO ] Invariant cache hit.
[2024-05-23 18:47:58] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1681 variables, and 2 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1598/1598 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1681 variables, 611/613 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1681 variables, 267/880 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1681/1681 variables, and 2478 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 30628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 611/611 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1598/1598 constraints, Known Traps: 0/0 constraints]
After SMT, in 68429ms problems are : Problem set: 0 solved, 1598 unsolved
Search for dead transitions found 0 dead transitions in 68447ms
Starting structural reductions in LTL mode, iteration 1 : 611/652 places, 1600/1696 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71012 ms. Remains : 611/652 places, 1600/1696 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c064-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c064-LTLCardinality-07 finished in 72195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 651 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 645 transition count 1682
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 645 transition count 1682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 645 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 640 transition count 1668
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 640 transition count 1668
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 636 transition count 1658
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 636 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 632 transition count 1648
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 632 transition count 1648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 626 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 623 transition count 1630
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 621 transition count 1626
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 621 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 619 transition count 1622
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 618 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 618 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 616 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 612 transition count 1604
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 612 transition count 1604
Applied a total of 81 rules in 196 ms. Remains 612 /652 variables (removed 40) and now considering 1604/1696 (removed 92) transitions.
[2024-05-23 18:49:08] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-23 18:49:08] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 18:49:09] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-23 18:49:09] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 18:49:09] [INFO ] Invariant cache hit.
[2024-05-23 18:49:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 18:49:10] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2024-05-23 18:49:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 18:49:10] [INFO ] Invariant cache hit.
[2024-05-23 18:49:10] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1683 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/879 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2481 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68027ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68045ms
Starting structural reductions in LTL mode, iteration 1 : 612/652 places, 1604/1696 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70585 ms. Remains : 612/652 places, 1604/1696 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Product exploration explored 100000 steps with 50000 reset in 500 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c064-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c064-LTLCardinality-08 finished in 71719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 651 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 645 transition count 1680
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 645 transition count 1680
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 645 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 639 transition count 1662
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 639 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 634 transition count 1650
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 634 transition count 1650
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 629 transition count 1638
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 629 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 625 transition count 1630
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 625 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 621 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 621 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 617 transition count 1614
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 615 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 613 transition count 1606
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 612 transition count 1602
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 611 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 610 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 609 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 606 transition count 1588
Applied a total of 93 rules in 196 ms. Remains 606 /652 variables (removed 46) and now considering 1588/1696 (removed 108) transitions.
[2024-05-23 18:50:20] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2024-05-23 18:50:20] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 18:50:20] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-23 18:50:20] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 18:50:20] [INFO ] Invariant cache hit.
[2024-05-23 18:50:20] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 18:50:22] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
Running 1586 sub problems to find dead transitions.
[2024-05-23 18:50:22] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 18:50:22] [INFO ] Invariant cache hit.
[2024-05-23 18:50:22] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 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 606/1667 variables, and 2 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 3 (OVERLAPS) 1061/1667 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1667 variables, 264/872 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1667/1667 variables, and 2458 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints]
After SMT, in 68039ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 68054ms
Starting structural reductions in LTL mode, iteration 1 : 606/652 places, 1588/1696 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70619 ms. Remains : 606/652 places, 1588/1696 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 513 ms.
Product exploration explored 100000 steps with 50000 reset in 521 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c064-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c064-LTLCardinality-09 finished in 71799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Graph (complete) has 3757 edges and 652 vertex of which 651 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 644 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 644 transition count 1678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 644 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 638 transition count 1660
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 638 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 633 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 633 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 628 transition count 1636
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 628 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 624 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 624 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 620 transition count 1620
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 620 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 616 transition count 1612
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 616 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 614 transition count 1608
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 614 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 612 transition count 1604
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 612 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 605 transition count 1584
Applied a total of 97 rules in 473 ms. Remains 605 /652 variables (removed 47) and now considering 1584/1696 (removed 112) transitions.
[2024-05-23 18:51:32] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 18:51:32] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 18:51:32] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-23 18:51:32] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 18:51:32] [INFO ] Invariant cache hit.
[2024-05-23 18:51:33] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 18:51:34] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2024-05-23 18:51:34] [INFO ] Redundant transitions in 24 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 18:51:34] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 18:51:34] [INFO ] Invariant cache hit.
[2024-05-23 18:51:34] [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 30038 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 30672 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 67574ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 67588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/652 places, 1584/1696 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70322 ms. Remains : 605/652 places, 1584/1696 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-10
Stuttering criterion allowed to conclude after 422 steps with 2 reset in 2 ms.
FORMULA FunctionPointer-PT-c064-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLCardinality-10 finished in 70509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(G(p2))))||p0))))'
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Graph (complete) has 3757 edges and 652 vertex of which 651 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 646 transition count 1684
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 646 transition count 1684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 646 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 642 transition count 1672
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 642 transition count 1672
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 639 transition count 1666
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 639 transition count 1666
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 636 transition count 1660
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 636 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 634 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 634 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 632 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 632 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 630 transition count 1648
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 630 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 629 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 629 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 628 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 628 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 627 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 621 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 621 transition count 1626
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 621 transition count 1622
Applied a total of 67 rules in 400 ms. Remains 621 /652 variables (removed 31) and now considering 1622/1696 (removed 74) transitions.
[2024-05-23 18:52:42] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 621 cols
[2024-05-23 18:52:42] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 18:52:43] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-23 18:52:43] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:52:43] [INFO ] Invariant cache hit.
[2024-05-23 18:52:43] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 18:52:45] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 2537 ms to find 0 implicit places.
[2024-05-23 18:52:45] [INFO ] Redundant transitions in 27 ms returned []
Running 1620 sub problems to find dead transitions.
[2024-05-23 18:52:45] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:52:45] [INFO ] Invariant cache hit.
[2024-05-23 18:52:45] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1705 variables, and 2 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/621 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1705 variables, 621/623 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1705 variables, 268/891 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 2511 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 31060 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/621 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
After SMT, in 69115ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 69130ms
Starting structural reductions in SI_LTL mode, iteration 1 : 621/652 places, 1622/1696 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72109 ms. Remains : 621/652 places, 1622/1696 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-11
Product exploration explored 100000 steps with 759 reset in 565 ms.
Product exploration explored 100000 steps with 699 reset in 567 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 112 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 5
RANDOM walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (16 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (15 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (17 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 204063 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 5
Probabilistic random walk after 204063 steps, saw 132469 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-23 18:53:59] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:53:59] [INFO ] Invariant cache hit.
[2024-05-23 18:53:59] [INFO ] State equation strengthened by 268 read => feed constraints.
Problem apf0 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/23 variables, 5/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 551/574 variables, 10/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/581 variables, 1/19 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 932/1513 variables, 472/492 constraints. Problems are: Problem set: 2 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1513 variables, 267/759 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1513 variables, 0/759 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 62/1575 variables, 1/760 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1575 variables, 0/760 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 130/1705 variables, 131/891 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1705/1705 variables, and 891 constraints, problems are : Problem set: 2 solved, 3 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/621 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 16/23 variables, 5/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 551/574 variables, 10/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 3/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/581 variables, 1/22 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 1/23 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 932/1513 variables, 472/495 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1513 variables, 267/762 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1513 variables, 0/762 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 62/1575 variables, 1/763 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1575 variables, 0/763 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 130/1705 variables, 131/894 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1705 variables, 0/894 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1705 variables, 0/894 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 894 constraints, problems are : Problem set: 2 solved, 3 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/621 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1473ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 273 ms.
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Graph (complete) has 2707 edges and 621 vertex of which 429 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 429 transition count 1238
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 429 transition count 1236
Applied a total of 387 rules in 99 ms. Remains 429 /621 variables (removed 192) and now considering 1236/1622 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 429/621 places, 1236/1622 transitions.
RANDOM walk for 40001 steps (8 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 312787 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 3
Probabilistic random walk after 312787 steps, saw 191809 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-23 18:54:04] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
// Phase 1: matrix 701 rows 429 cols
[2024-05-23 18:54:04] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 18:54:04] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 361/383 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 9/392 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 610/1002 variables, 342/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 77/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 62/1064 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 66/1130 variables, 67/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1130 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1130 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 510 constraints, problems are : Problem set: 0 solved, 3 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 361/383 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/392 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 610/1002 variables, 342/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 77/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1002 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 62/1064 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1064 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 66/1130 variables, 67/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1130 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1130 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 513 constraints, problems are : Problem set: 0 solved, 3 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 956ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 47 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 429/429 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 45 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2024-05-23 18:54:05] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:54:05] [INFO ] Invariant cache hit.
[2024-05-23 18:54:05] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-23 18:54:05] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:54:05] [INFO ] Invariant cache hit.
[2024-05-23 18:54:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 18:54:07] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2024-05-23 18:54:07] [INFO ] Redundant transitions in 16 ms returned []
Running 1234 sub problems to find dead transitions.
[2024-05-23 18:54:07] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:54:07] [INFO ] Invariant cache hit.
[2024-05-23 18:54:07] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
[2024-05-23 18:54:27] [INFO ] Deduced a trap composed of 131 places in 92 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 701/1130 variables, 429/433 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
SMT process timed out in 34858ms, After SMT, problems are : Problem set: 0 solved, 1234 unsolved
Search for dead transitions found 0 dead transitions in 34876ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36587 ms. Remains : 429/429 places, 1236/1236 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 429 transition count 691
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 555 place count 419 transition count 691
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 555 place count 419 transition count 616
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 705 place count 344 transition count 616
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 961 place count 216 transition count 488
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 152 transition count 360
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 152 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 152 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 89 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 89 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 26 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 26 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 26 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 26 transition count 42
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 1408 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 23 transition count 41
Applied a total of 1412 rules in 33 ms. Remains 23 /429 variables (removed 406) and now considering 41/1236 (removed 1195) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 23 cols
[2024-05-23 18:54:42] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 18:54:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 18:54:42] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-23 18:54:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 18:54:42] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 18:54:42] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 18:54:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 18:54:42] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 18:54:42] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 18:54:42] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 18:54:42] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 154 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1)), (G (OR (NOT p2) p0))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 113 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Applied a total of 0 rules in 78 ms. Remains 621 /621 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2024-05-23 18:54:42] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 621 cols
[2024-05-23 18:54:42] [INFO ] Computed 2 invariants in 17 ms
[2024-05-23 18:54:42] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 18:54:42] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:54:42] [INFO ] Invariant cache hit.
[2024-05-23 18:54:43] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 18:54:45] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2024-05-23 18:54:45] [INFO ] Redundant transitions in 24 ms returned []
Running 1620 sub problems to find dead transitions.
[2024-05-23 18:54:45] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:54:45] [INFO ] Invariant cache hit.
[2024-05-23 18:54:45] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1705 variables, and 2 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/621 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1705 variables, 621/623 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1705 variables, 268/891 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 2511 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 31033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/621 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
After SMT, in 69227ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 69244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71858 ms. Remains : 621/621 places, 1622/1622 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 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40044 steps (8 resets) in 82 ms. (482 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (18 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519930 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519930 steps, saw 337466 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-23 18:55:57] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:55:57] [INFO ] Invariant cache hit.
[2024-05-23 18:55:57] [INFO ] State equation strengthened by 268 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/23 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 551/574 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/581 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 932/1513 variables, 472/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1513 variables, 267/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1513 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1575 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1575 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 130/1705 variables, 131/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1705/1705 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/621 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/23 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 551/574 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/581 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 932/1513 variables, 472/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1513 variables, 267/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1513 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1575 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1575 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 130/1705 variables, 131/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1705 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1705 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/621 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Graph (complete) has 2707 edges and 621 vertex of which 429 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 429 transition count 1238
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 429 transition count 1236
Applied a total of 387 rules in 91 ms. Remains 429 /621 variables (removed 192) and now considering 1236/1622 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 429/621 places, 1236/1622 transitions.
RANDOM walk for 40000 steps (8 resets) in 118 ms. (336 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 619262 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 619262 steps, saw 379719 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-23 18:56:01] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
// Phase 1: matrix 701 rows 429 cols
[2024-05-23 18:56:01] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 18:56:01] [INFO ] State equation strengthened by 78 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/383 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/392 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 610/1002 variables, 342/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 77/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 18:56:02] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1002 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 62/1064 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1064 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/1130 variables, 67/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1130 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1130 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1130/1130 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 361/383 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/392 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 610/1002 variables, 342/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 77/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1002 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1002 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1064 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1064 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 66/1130 variables, 67/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1130 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1130 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 429/429 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 42 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 429/429 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 43 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2024-05-23 18:56:02] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:56:02] [INFO ] Invariant cache hit.
[2024-05-23 18:56:02] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-23 18:56:02] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:56:02] [INFO ] Invariant cache hit.
[2024-05-23 18:56:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-23 18:56:04] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-05-23 18:56:04] [INFO ] Redundant transitions in 15 ms returned []
Running 1234 sub problems to find dead transitions.
[2024-05-23 18:56:04] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-23 18:56:04] [INFO ] Invariant cache hit.
[2024-05-23 18:56:04] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
[2024-05-23 18:56:23] [INFO ] Deduced a trap composed of 131 places in 92 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
At refinement iteration 3 (OVERLAPS) 701/1130 variables, 429/433 constraints. Problems are: Problem set: 0 solved, 1234 unsolved
SMT process timed out in 34550ms, After SMT, problems are : Problem set: 0 solved, 1234 unsolved
Search for dead transitions found 0 dead transitions in 34561ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36238 ms. Remains : 429/429 places, 1236/1236 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 429 transition count 691
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 555 place count 419 transition count 691
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 555 place count 419 transition count 616
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 705 place count 344 transition count 616
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 961 place count 216 transition count 488
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 152 transition count 360
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 152 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 152 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 89 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 89 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 26 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 26 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 26 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 26 transition count 42
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 1408 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 23 transition count 41
Applied a total of 1412 rules in 18 ms. Remains 23 /429 variables (removed 406) and now considering 41/1236 (removed 1195) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 23 cols
[2024-05-23 18:56:38] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 18:56:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 18:56:38] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 18:56:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 18:56:38] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:56:38] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 18:56:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 18:56:38] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 18:56:38] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 18:56:38] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 18:56:38] [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 91 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 742 reset in 496 ms.
Product exploration explored 100000 steps with 765 reset in 525 ms.
Built C files in :
/tmp/ltsmin3219931425253072380
[2024-05-23 18:56:40] [INFO ] Too many transitions (1622) to apply POR reductions. Disabling POR matrices.
[2024-05-23 18:56:40] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3219931425253072380
Running compilation step : cd /tmp/ltsmin3219931425253072380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3219931425253072380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3219931425253072380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Applied a total of 0 rules in 75 ms. Remains 621 /621 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2024-05-23 18:56:43] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 621 cols
[2024-05-23 18:56:43] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 18:56:43] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-23 18:56:43] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:56:43] [INFO ] Invariant cache hit.
[2024-05-23 18:56:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 18:56:46] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2600 ms to find 0 implicit places.
[2024-05-23 18:56:46] [INFO ] Redundant transitions in 27 ms returned []
Running 1620 sub problems to find dead transitions.
[2024-05-23 18:56:46] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-23 18:56:46] [INFO ] Invariant cache hit.
[2024-05-23 18:56:46] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 7.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1705 variables, and 2 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/621 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 3 (OVERLAPS) 1084/1705 variables, 621/623 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1705 variables, 268/891 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 2511 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 31317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 621/621 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 0/0 constraints]
After SMT, in 69298ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 69312ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72023 ms. Remains : 621/621 places, 1622/1622 transitions.
Built C files in :
/tmp/ltsmin15739956843194216757
[2024-05-23 18:57:55] [INFO ] Too many transitions (1622) to apply POR reductions. Disabling POR matrices.
[2024-05-23 18:57:55] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15739956843194216757
Running compilation step : cd /tmp/ltsmin15739956843194216757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15739956843194216757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15739956843194216757;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 18:57:58] [INFO ] Flatten gal took : 56 ms
[2024-05-23 18:57:58] [INFO ] Flatten gal took : 55 ms
[2024-05-23 18:57:58] [INFO ] Time to serialize gal into /tmp/LTL4784507895212330952.gal : 17 ms
[2024-05-23 18:57:58] [INFO ] Time to serialize properties into /tmp/LTL14450482298564189734.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4784507895212330952.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6785873064062553702.hoa' '-atoms' '/tmp/LTL14450482298564189734.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14450482298564189734.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6785873064062553702.hoa
Detected timeout of ITS tools.
[2024-05-23 18:58:13] [INFO ] Flatten gal took : 48 ms
[2024-05-23 18:58:13] [INFO ] Flatten gal took : 46 ms
[2024-05-23 18:58:13] [INFO ] Time to serialize gal into /tmp/LTL4770321958052462973.gal : 9 ms
[2024-05-23 18:58:13] [INFO ] Time to serialize properties into /tmp/LTL7977439790224170656.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4770321958052462973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7977439790224170656.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((l1515<2)||(p1609<2))")||(G(("(p1609>=2)")&&(F(G("(l1515<2)")))))))))
Formula 0 simplified : G(F(!"(p1609>=2)" | GF!"(l1515<2)") & FG!"((l1515<2)||(p1609<2))")
Detected timeout of ITS tools.
[2024-05-23 18:58:29] [INFO ] Flatten gal took : 44 ms
[2024-05-23 18:58:29] [INFO ] Applying decomposition
[2024-05-23 18:58:29] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1968973085098575764.txt' '-o' '/tmp/graph1968973085098575764.bin' '-w' '/tmp/graph1968973085098575764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1968973085098575764.bin' '-l' '-1' '-v' '-w' '/tmp/graph1968973085098575764.weights' '-q' '0' '-e' '0.001'
[2024-05-23 18:58:29] [INFO ] Decomposing Gal with order
[2024-05-23 18:58:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 18:58:29] [INFO ] Removed a total of 2692 redundant transitions.
[2024-05-23 18:58:29] [INFO ] Flatten gal took : 147 ms
[2024-05-23 18:58:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1183 labels/synchronizations in 91 ms.
[2024-05-23 18:58:29] [INFO ] Time to serialize gal into /tmp/LTL11614447254369175327.gal : 15 ms
[2024-05-23 18:58:29] [INFO ] Time to serialize properties into /tmp/LTL13411044964346141871.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11614447254369175327.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13411044964346141871.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i23.i1.u143.l1515<2)||(i23.i2.u145.p1609<2))")||(G(("(i23.i2.u145.p1609>=2)")&&(F(G("(i23.i1.u143.l1515<2)")))))))))
Formula 0 simplified : G(F(!"(i23.i2.u145.p1609>=2)" | GF!"(i23.i1.u143.l1515<2)") & FG!"((i23.i1.u143.l1515<2)||(i23.i2.u145.p1609<2))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c064-LTLCardinality-11 finished in 362288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(G(p2))))||p0))))'
[2024-05-23 18:58:44] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12085586949204524427
[2024-05-23 18:58:44] [INFO ] Too many transitions (1696) to apply POR reductions. Disabling POR matrices.
[2024-05-23 18:58:44] [INFO ] Applying decomposition
[2024-05-23 18:58:44] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12085586949204524427
Running compilation step : cd /tmp/ltsmin12085586949204524427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 18:58:44] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7604825554229939341.txt' '-o' '/tmp/graph7604825554229939341.bin' '-w' '/tmp/graph7604825554229939341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7604825554229939341.bin' '-l' '-1' '-v' '-w' '/tmp/graph7604825554229939341.weights' '-q' '0' '-e' '0.001'
[2024-05-23 18:58:45] [INFO ] Decomposing Gal with order
[2024-05-23 18:58:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 18:58:45] [INFO ] Removed a total of 2836 redundant transitions.
[2024-05-23 18:58:45] [INFO ] Flatten gal took : 81 ms
[2024-05-23 18:58:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1220 labels/synchronizations in 70 ms.
[2024-05-23 18:58:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality14006055796056601039.gal : 11 ms
[2024-05-23 18:58:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality15214936460491399363.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14006055796056601039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15214936460491399363.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i27.i0.u155.l1515<2)||(i27.i1.u158.p1609<2))")||(G(("(i27.i1.u158.p1609>=2)")&&(F(G("(i27.i0.u155.l1515<2)")))))))))
Formula 0 simplified : G(F(!"(i27.i1.u158.p1609>=2)" | GF!"(i27.i0.u155.l1515<2)") & FG!"((i27.i0.u155.l1515<2)||(i27.i1.u158.p1609<2))")
Compilation finished in 4072 ms.
Running link step : cd /tmp/ltsmin12085586949204524427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 213 ms.
Running LTSmin : cd /tmp/ltsmin12085586949204524427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 19:23:24] [INFO ] Flatten gal took : 121 ms
[2024-05-23 19:23:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality9302936422826198813.gal : 24 ms
[2024-05-23 19:23:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality695691859643606947.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9302936422826198813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality695691859643606947.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((G(F(("((l1515<2)||(p1609<2))")||(G(("(p1609>=2)")&&(F(G("(l1515<2)")))))))))
Formula 0 simplified : G(F(!"(p1609>=2)" | GF!"(l1515<2)") & FG!"((l1515<2)||(p1609<2))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c064, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603100315"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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