Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717190665160

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:24:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:24:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:24:26] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2024-05-31 21:24:26] [INFO ] Transformed 2826 places.
[2024-05-31 21:24:26] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:24:26] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 537 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 44 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 309 place count 1319 transition count 3750
Iterating global reduction 1 with 293 rules applied. Total rules applied 602 place count 1319 transition count 3750
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 998 place count 1319 transition count 3354
Discarding 149 places :
Symmetric choice reduction at 2 with 149 rule applications. Total rules 1147 place count 1170 transition count 3056
Iterating global reduction 2 with 149 rules applied. Total rules applied 1296 place count 1170 transition count 3056
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1380 place count 1170 transition count 2972
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1393 place count 1157 transition count 2946
Iterating global reduction 3 with 13 rules applied. Total rules applied 1406 place count 1157 transition count 2946
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1418 place count 1145 transition count 2922
Iterating global reduction 3 with 12 rules applied. Total rules applied 1430 place count 1145 transition count 2922
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1442 place count 1133 transition count 2898
Iterating global reduction 3 with 12 rules applied. Total rules applied 1454 place count 1133 transition count 2898
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1466 place count 1121 transition count 2874
Iterating global reduction 3 with 12 rules applied. Total rules applied 1478 place count 1121 transition count 2874
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1490 place count 1109 transition count 2850
Iterating global reduction 3 with 12 rules applied. Total rules applied 1502 place count 1109 transition count 2850
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1512 place count 1099 transition count 2830
Iterating global reduction 3 with 10 rules applied. Total rules applied 1522 place count 1099 transition count 2830
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1531 place count 1090 transition count 2812
Iterating global reduction 3 with 9 rules applied. Total rules applied 1540 place count 1090 transition count 2812
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1570 place count 1060 transition count 2702
Iterating global reduction 3 with 30 rules applied. Total rules applied 1600 place count 1060 transition count 2702
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1642 place count 1018 transition count 2534
Iterating global reduction 3 with 42 rules applied. Total rules applied 1684 place count 1018 transition count 2534
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1726 place count 976 transition count 2416
Iterating global reduction 3 with 42 rules applied. Total rules applied 1768 place count 976 transition count 2416
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1809 place count 935 transition count 2334
Iterating global reduction 3 with 41 rules applied. Total rules applied 1850 place count 935 transition count 2334
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1891 place count 894 transition count 2252
Iterating global reduction 3 with 41 rules applied. Total rules applied 1932 place count 894 transition count 2252
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1973 place count 853 transition count 2170
Iterating global reduction 3 with 41 rules applied. Total rules applied 2014 place count 853 transition count 2170
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2054 place count 813 transition count 2090
Iterating global reduction 3 with 40 rules applied. Total rules applied 2094 place count 813 transition count 2090
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2111 place count 796 transition count 2056
Iterating global reduction 3 with 17 rules applied. Total rules applied 2128 place count 796 transition count 2056
Applied a total of 2128 rules in 1339 ms. Remains 796 /1628 variables (removed 832) and now considering 2056/5962 (removed 3906) transitions.
[2024-05-31 21:24:28] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
// Phase 1: matrix 1386 rows 796 cols
[2024-05-31 21:24:28] [INFO ] Computed 2 invariants in 55 ms
[2024-05-31 21:24:29] [INFO ] Implicit Places using invariants in 921 ms returned []
[2024-05-31 21:24:29] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-31 21:24:29] [INFO ] Invariant cache hit.
[2024-05-31 21:24:29] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-31 21:24:31] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned []
Implicit Place search using SMT with State Equation took 3532 ms to find 0 implicit places.
Running 2054 sub problems to find dead transitions.
[2024-05-31 21:24:32] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-31 21:24:32] [INFO ] Invariant cache hit.
[2024-05-31 21:24:32] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/795 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 795/2182 variables, and 2 constraints, problems are : Problem set: 0 solved, 2054 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/796 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 2054/2054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/795 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/795 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
At refinement iteration 3 (OVERLAPS) 1386/2181 variables, 795/797 constraints. Problems are: Problem set: 0 solved, 2054 unsolved
SMT process timed out in 70492ms, After SMT, problems are : Problem set: 0 solved, 2054 unsolved
Search for dead transitions found 0 dead transitions in 70525ms
Starting structural reductions in LTL mode, iteration 1 : 796/1628 places, 2056/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75430 ms. Remains : 796/1628 places, 2056/5962 transitions.
Support contains 27 out of 796 places after structural reductions.
[2024-05-31 21:25:42] [INFO ] Flatten gal took : 189 ms
[2024-05-31 21:25:43] [INFO ] Flatten gal took : 99 ms
[2024-05-31 21:25:43] [INFO ] Input system was already deterministic with 2056 transitions.
RANDOM walk for 40003 steps (8 resets) in 2691 ms. (14 steps per ms) remains 12/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
[2024-05-31 21:25:44] [INFO ] Flow matrix only has 1386 transitions (discarded 670 similar events)
[2024-05-31 21:25:44] [INFO ] Invariant cache hit.
[2024-05-31 21:25:44] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 381/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/437 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 768/1205 variables, 437/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1205 variables, 25/464 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1205 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 8 (OVERLAPS) 379/1584 variables, 56/520 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1584 variables, 242/762 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1584 variables, 0/762 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 487/2071 variables, 214/976 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2071 variables, 66/1042 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2071 variables, 0/1042 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 87/2158 variables, 77/1119 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2158 variables, 0/1119 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 20/2178 variables, 8/1127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2178 variables, 0/1127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/2182 variables, 4/1131 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2182 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2182 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2182/2182 variables, and 1131 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 796/796 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 381/386 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 645/1031 variables, 386/387 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1031 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 360/1391 variables, 8/395 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1391 variables, 240/635 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1391 variables, 4/639 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1391 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 592/1983 variables, 265/904 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1983 variables, 1/905 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1983 variables, 93/998 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 21:25:46] [INFO ] Deduced a trap composed of 135 places in 210 ms of which 32 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1983 variables, 1/999 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1983 variables, 0/999 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 161/2144 variables, 118/1117 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2144 variables, 0/1117 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 22/2166 variables, 10/1127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2166 variables, 0/1127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 16/2182 variables, 9/1136 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2182 variables, 0/1136 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2182 variables, 0/1136 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2182/2182 variables, and 1136 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 796/796 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 3514ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 432 ms.
Support contains 4 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 3358 edges and 796 vertex of which 603 are kept as prefixes of interest. Removing 193 places using SCC suffix rule.6 ms
Discarding 193 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 603 transition count 1672
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 400 place count 588 transition count 1638
Iterating global reduction 1 with 15 rules applied. Total rules applied 415 place count 588 transition count 1638
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 421 place count 588 transition count 1632
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 435 place count 574 transition count 1594
Iterating global reduction 2 with 14 rules applied. Total rules applied 449 place count 574 transition count 1594
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 463 place count 560 transition count 1554
Iterating global reduction 2 with 14 rules applied. Total rules applied 477 place count 560 transition count 1554
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 496 place count 541 transition count 1494
Iterating global reduction 2 with 19 rules applied. Total rules applied 515 place count 541 transition count 1494
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 533 place count 523 transition count 1442
Iterating global reduction 2 with 18 rules applied. Total rules applied 551 place count 523 transition count 1442
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 569 place count 505 transition count 1406
Iterating global reduction 2 with 18 rules applied. Total rules applied 587 place count 505 transition count 1406
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 606 place count 486 transition count 1364
Iterating global reduction 2 with 19 rules applied. Total rules applied 625 place count 486 transition count 1364
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 642 place count 469 transition count 1326
Iterating global reduction 2 with 17 rules applied. Total rules applied 659 place count 469 transition count 1326
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 673 place count 455 transition count 1298
Iterating global reduction 2 with 14 rules applied. Total rules applied 687 place count 455 transition count 1298
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 698 place count 444 transition count 1276
Iterating global reduction 2 with 11 rules applied. Total rules applied 709 place count 444 transition count 1276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 712 place count 441 transition count 1268
Iterating global reduction 2 with 3 rules applied. Total rules applied 715 place count 441 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 718 place count 438 transition count 1260
Iterating global reduction 2 with 3 rules applied. Total rules applied 721 place count 438 transition count 1260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 724 place count 435 transition count 1254
Iterating global reduction 2 with 3 rules applied. Total rules applied 727 place count 435 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 728 place count 434 transition count 1252
Iterating global reduction 2 with 1 rules applied. Total rules applied 729 place count 434 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 730 place count 433 transition count 1250
Iterating global reduction 2 with 1 rules applied. Total rules applied 731 place count 433 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 732 place count 432 transition count 1248
Iterating global reduction 2 with 1 rules applied. Total rules applied 733 place count 432 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 734 place count 431 transition count 1246
Iterating global reduction 2 with 1 rules applied. Total rules applied 735 place count 431 transition count 1246
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 741 place count 431 transition count 1240
Applied a total of 741 rules in 380 ms. Remains 431 /796 variables (removed 365) and now considering 1240/2056 (removed 816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 431/796 places, 1240/2056 transitions.
RANDOM walk for 40001 steps (8 resets) in 205 ms. (194 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
[2024-05-31 21:25:48] [INFO ] Flow matrix only has 703 transitions (discarded 537 similar events)
// Phase 1: matrix 703 rows 431 cols
[2024-05-31 21:25:48] [INFO ] Computed 3 invariants in 5 ms
[2024-05-31 21:25:48] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 645/1031 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1031 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/1068 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 72/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/1078 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1078 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1078 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 39/1117 variables, 25/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1117 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1117 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/1129 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1129 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/1133 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1133 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1134 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1134 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1134 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1134/1134 variables, and 512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 431/431 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 645/1031 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1031 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/1068 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 72/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1068 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/1078 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1078 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1078 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 39/1117 variables, 25/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1117 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1117 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/1129 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1129 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/1133 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1133 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1134 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1134 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1134 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 514 constraints, problems are : Problem set: 0 solved, 2 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 431/431 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1117ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 3 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1240/1240 transitions.
Applied a total of 0 rules in 44 ms. Remains 431 /431 variables (removed 0) and now considering 1240/1240 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 431/431 places, 1240/1240 transitions.
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/2 properties
BEST_FIRST walk for 33149 steps (7 resets) in 39 ms. (828 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-c004-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c004-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-c004-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 52 place count 764 transition count 1976
Iterating global reduction 2 with 15 rules applied. Total rules applied 67 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 82 place count 749 transition count 1930
Iterating global reduction 2 with 15 rules applied. Total rules applied 97 place count 749 transition count 1930
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 116 place count 730 transition count 1870
Iterating global reduction 2 with 19 rules applied. Total rules applied 135 place count 730 transition count 1870
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 153 place count 712 transition count 1822
Iterating global reduction 2 with 18 rules applied. Total rules applied 171 place count 712 transition count 1822
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 694 transition count 1786
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 694 transition count 1786
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 226 place count 675 transition count 1744
Iterating global reduction 2 with 19 rules applied. Total rules applied 245 place count 675 transition count 1744
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 262 place count 658 transition count 1706
Iterating global reduction 2 with 17 rules applied. Total rules applied 279 place count 658 transition count 1706
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 293 place count 644 transition count 1678
Iterating global reduction 2 with 14 rules applied. Total rules applied 307 place count 644 transition count 1678
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 316 place count 635 transition count 1660
Iterating global reduction 2 with 9 rules applied. Total rules applied 325 place count 635 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 329 place count 631 transition count 1648
Iterating global reduction 2 with 4 rules applied. Total rules applied 333 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 337 place count 627 transition count 1636
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 345 place count 623 transition count 1628
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 621 transition count 1624
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 619 transition count 1620
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 359 place count 617 transition count 1616
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 363 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 365 place count 615 transition count 1612
Applied a total of 365 rules in 248 ms. Remains 615 /796 variables (removed 181) and now considering 1612/2056 (removed 444) transitions.
[2024-05-31 21:25:50] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
// Phase 1: matrix 1075 rows 615 cols
[2024-05-31 21:25:50] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 21:25:51] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-31 21:25:51] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-31 21:25:51] [INFO ] Invariant cache hit.
[2024-05-31 21:25:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 21:25:52] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2024-05-31 21:25:52] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2024-05-31 21:25:52] [INFO ] Invariant cache hit.
[2024-05-31 21:25:52] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1690 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1690 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1690/1690 variables, and 2492 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31090 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 68254ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 68272ms
Starting structural reductions in LTL mode, iteration 1 : 615/796 places, 1612/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70739 ms. Remains : 615/796 places, 1612/2056 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 657 ms.
Product exploration explored 100000 steps with 50000 reset in 553 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c004-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-00 finished in 72259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 780 transition count 2024
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 780 transition count 2024
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 780 transition count 2018
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 51 place count 766 transition count 1984
Iterating global reduction 2 with 14 rules applied. Total rules applied 65 place count 766 transition count 1984
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 752 transition count 1942
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 752 transition count 1942
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 2 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 2 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 2 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 259 place count 660 transition count 1708
Iterating global reduction 2 with 18 rules applied. Total rules applied 277 place count 660 transition count 1708
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 293 place count 644 transition count 1676
Iterating global reduction 2 with 16 rules applied. Total rules applied 309 place count 644 transition count 1676
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 320 place count 633 transition count 1654
Iterating global reduction 2 with 11 rules applied. Total rules applied 331 place count 633 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 334 place count 630 transition count 1646
Iterating global reduction 2 with 3 rules applied. Total rules applied 337 place count 630 transition count 1646
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 340 place count 627 transition count 1638
Iterating global reduction 2 with 3 rules applied. Total rules applied 343 place count 627 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 346 place count 624 transition count 1632
Iterating global reduction 2 with 3 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 354 place count 621 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 355 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 356 place count 620 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 357 place count 620 transition count 1624
Applied a total of 357 rules in 246 ms. Remains 620 /796 variables (removed 176) and now considering 1624/2056 (removed 432) transitions.
[2024-05-31 21:27:02] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 620 cols
[2024-05-31 21:27:02] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 21:27:03] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-31 21:27:03] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:27:03] [INFO ] Invariant cache hit.
[2024-05-31 21:27:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:27:05] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2380 ms to find 0 implicit places.
Running 1622 sub problems to find dead transitions.
[2024-05-31 21:27:05] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-31 21:27:05] [INFO ] Invariant cache hit.
[2024-05-31 21:27:05] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 7.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1705 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/620 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1705 variables, 620/622 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1705 variables, 268/890 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1705/1705 variables, and 2512 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 620/620 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 68508ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 68524ms
Starting structural reductions in LTL mode, iteration 1 : 620/796 places, 1624/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71161 ms. Remains : 620/796 places, 1624/2056 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 466 ms.
Product exploration explored 100000 steps with 33333 reset in 479 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 78 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c004-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c004-LTLCardinality-01 finished in 72342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 782 transition count 2026
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 782 transition count 2026
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 34 place count 782 transition count 2020
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 47 place count 769 transition count 1986
Iterating global reduction 1 with 13 rules applied. Total rules applied 60 place count 769 transition count 1986
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 756 transition count 1946
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 756 transition count 1946
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 104 place count 738 transition count 1886
Iterating global reduction 1 with 18 rules applied. Total rules applied 122 place count 738 transition count 1886
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 139 place count 721 transition count 1836
Iterating global reduction 1 with 17 rules applied. Total rules applied 156 place count 721 transition count 1836
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 173 place count 704 transition count 1802
Iterating global reduction 1 with 17 rules applied. Total rules applied 190 place count 704 transition count 1802
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 208 place count 686 transition count 1762
Iterating global reduction 1 with 18 rules applied. Total rules applied 226 place count 686 transition count 1762
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 243 place count 669 transition count 1724
Iterating global reduction 1 with 17 rules applied. Total rules applied 260 place count 669 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 274 place count 655 transition count 1696
Iterating global reduction 1 with 14 rules applied. Total rules applied 288 place count 655 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 298 place count 645 transition count 1676
Iterating global reduction 1 with 10 rules applied. Total rules applied 308 place count 645 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 310 place count 643 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 312 place count 643 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 314 place count 641 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 316 place count 641 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 318 place count 639 transition count 1664
Iterating global reduction 1 with 2 rules applied. Total rules applied 320 place count 639 transition count 1664
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 326 place count 639 transition count 1658
Applied a total of 326 rules in 518 ms. Remains 639 /796 variables (removed 157) and now considering 1658/2056 (removed 398) transitions.
[2024-05-31 21:28:15] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-31 21:28:15] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 21:28:16] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-31 21:28:16] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:28:16] [INFO ] Invariant cache hit.
[2024-05-31 21:28:16] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-31 21:28:17] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2392 ms to find 0 implicit places.
[2024-05-31 21:28:18] [INFO ] Redundant transitions in 81 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-31 21:28:18] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:28:18] [INFO ] Invariant cache hit.
[2024-05-31 21:28:18] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 11.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s575 0.0)
(s576 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1656/1656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1747 variables, 638/640 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1747 variables, 273/913 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1747/1748 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 638/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 256/1656 constraints, Known Traps: 0/0 constraints]
After SMT, in 67808ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 67826ms
Starting structural reductions in SI_LTL mode, iteration 1 : 639/796 places, 1658/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70830 ms. Remains : 639/796 places, 1658/2056 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 468 ms.
Product exploration explored 100000 steps with 0 reset in 487 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (8 resets) in 282 ms. (141 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/2 properties
[2024-05-31 21:29:27] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:29:27] [INFO ] Invariant cache hit.
[2024-05-31 21:29:27] [INFO ] State equation strengthened by 273 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/1294 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 371/1665 variables, 162/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1665 variables, 72/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 77/1742 variables, 73/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1742 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/1747 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1747 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1748 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 914 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1283 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1294 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 371/1665 variables, 162/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 72/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1665 variables, 0/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 77/1742 variables, 73/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1742 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1747 variables, 3/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1747 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1748 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1748 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1748 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 915 constraints, problems are : Problem set: 0 solved, 1 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1076ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 447 transition count 1274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 447 transition count 1272
Applied a total of 387 rules in 99 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 447/639 places, 1272/1658 transitions.
RANDOM walk for 40005 steps (8 resets) in 170 ms. (233 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 633905 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 633905 steps, saw 388699 distinct states, run finished after 3004 ms. (steps per millisecond=211 ) properties seen :0
[2024-05-31 21:29:31] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-31 21:29:31] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 21:29:31] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1103 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/1154 variables, 34/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1154 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/1167 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1172 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1172 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1173 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/1154 variables, 34/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/1167 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1172 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1172 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1173 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 46 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-31 21:29:32] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-31 21:29:32] [INFO ] Invariant cache hit.
[2024-05-31 21:29:32] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-31 21:29:32] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-31 21:29:32] [INFO ] Invariant cache hit.
[2024-05-31 21:29:32] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:29:34] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
[2024-05-31 21:29:34] [INFO ] Redundant transitions in 54 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-31 21:29:34] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-31 21:29:34] [INFO ] Invariant cache hit.
[2024-05-31 21:29:34] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-05-31 21:29:48] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1173 variables, and 4 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/447 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 1270/1270 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 3 (OVERLAPS) 726/1172 variables, 446/450 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 83/533 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1172 variables, 256/789 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1172/1173 variables, and 789 constraints, problems are : Problem set: 0 solved, 1270 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 446/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 256/1270 constraints, Known Traps: 1/1 constraints]
After SMT, in 64330ms problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 64346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66132 ms. Remains : 447/447 places, 1272/1272 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 68 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2024-05-31 21:30:38] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:30:38] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:30:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:30:38] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:30:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:30:38] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:30:38] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:30:38] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 163 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 103 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-31 21:30:39] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-31 21:30:39] [INFO ] Computed 2 invariants in 15 ms
[2024-05-31 21:30:39] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-31 21:30:39] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:30:39] [INFO ] Invariant cache hit.
[2024-05-31 21:30:39] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-31 21:30:41] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
[2024-05-31 21:30:41] [INFO ] Redundant transitions in 41 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-31 21:30:41] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:30:41] [INFO ] Invariant cache hit.
[2024-05-31 21:30:41] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1656/1656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1747 variables, 638/640 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1747 variables, 273/913 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1747/1748 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 638/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 256/1656 constraints, Known Traps: 0/0 constraints]
After SMT, in 67723ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 67737ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70284 ms. Remains : 639/639 places, 1658/1658 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3686 edges and 639 vertex of which 638 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
[2024-05-31 21:31:49] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:31:49] [INFO ] Invariant cache hit.
[2024-05-31 21:31:49] [INFO ] State equation strengthened by 273 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/1294 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 371/1665 variables, 162/765 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1665 variables, 72/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 77/1742 variables, 73/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1742 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1747 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1747 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1748 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1748 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1748/1748 variables, and 914 constraints, problems are : Problem set: 0 solved, 2 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 248/1283 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 201/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1283 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/1294 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1294 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 371/1665 variables, 162/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 72/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1665 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 77/1742 variables, 73/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1742 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/1747 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1747 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/1748 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1748 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1748 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 916 constraints, problems are : Problem set: 0 solved, 2 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1411ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Graph (complete) has 2770 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 447 transition count 1274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 447 transition count 1272
Applied a total of 387 rules in 106 ms. Remains 447 /639 variables (removed 192) and now considering 1272/1658 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 447/639 places, 1272/1658 transitions.
RANDOM walk for 40007 steps (8 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/2 properties
[2024-05-31 21:31:51] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
// Phase 1: matrix 726 rows 447 cols
[2024-05-31 21:31:51] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 21:31:51] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1103 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/1154 variables, 34/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1154 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/1167 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1172 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1172 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1173 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/1154 variables, 34/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/1167 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1172 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1172 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1173 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 48 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 447/447 places, 1272/1272 transitions.
RANDOM walk for 40001 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 619619 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 619619 steps, saw 379937 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-31 21:31:55] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-31 21:31:55] [INFO ] Invariant cache hit.
[2024-05-31 21:31:55] [INFO ] State equation strengthened by 83 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1103 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 51/1154 variables, 34/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1154 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/1167 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1167 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/1172 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1172 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1173 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1173 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 648/1035 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/1092 variables, 12/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1092 variables, 75/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/1103 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1103 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/1154 variables, 34/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1154 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1154 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/1167 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1167 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/1172 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1172 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1173 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1173 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 447/447 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 49 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 447/447 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1272/1272 transitions.
Applied a total of 0 rules in 47 ms. Remains 447 /447 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-31 21:31:56] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-31 21:31:56] [INFO ] Invariant cache hit.
[2024-05-31 21:31:56] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-31 21:31:56] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-31 21:31:56] [INFO ] Invariant cache hit.
[2024-05-31 21:31:56] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-31 21:31:57] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
[2024-05-31 21:31:57] [INFO ] Redundant transitions in 23 ms returned []
Running 1270 sub problems to find dead transitions.
[2024-05-31 21:31:57] [INFO ] Flow matrix only has 726 transitions (discarded 546 similar events)
[2024-05-31 21:31:57] [INFO ] Invariant cache hit.
[2024-05-31 21:31:57] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
[2024-05-31 21:32:11] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
At refinement iteration 3 (OVERLAPS) 726/1172 variables, 446/450 constraints. Problems are: Problem set: 0 solved, 1270 unsolved
SMT process timed out in 34121ms, After SMT, problems are : Problem set: 0 solved, 1270 unsolved
Search for dead transitions found 0 dead transitions in 34132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35846 ms. Remains : 447/447 places, 1272/1272 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 447 transition count 710
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 578 place count 431 transition count 710
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 578 place count 431 transition count 631
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 736 place count 352 transition count 631
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 990 place count 225 transition count 504
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1053 place count 162 transition count 378
Iterating global reduction 2 with 63 rules applied. Total rules applied 1116 place count 162 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1118 place count 162 transition count 376
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1180 place count 100 transition count 252
Iterating global reduction 3 with 62 rules applied. Total rules applied 1242 place count 100 transition count 252
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1304 place count 38 transition count 128
Iterating global reduction 3 with 62 rules applied. Total rules applied 1366 place count 38 transition count 128
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1428 place count 38 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1430 place count 37 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1436 place count 34 transition count 66
Applied a total of 1436 rules in 23 ms. Remains 34 /447 variables (removed 413) and now considering 66/1272 (removed 1206) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 34 cols
[2024-05-31 21:32:31] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 21:32:31] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:32:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:32:31] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:32:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:32:31] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:32:32] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:32:32] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 94 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 481 ms.
Product exploration explored 100000 steps with 0 reset in 477 ms.
Support contains 4 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1658/1658 transitions.
Applied a total of 0 rules in 85 ms. Remains 639 /639 variables (removed 0) and now considering 1658/1658 (removed 0) transitions.
[2024-05-31 21:32:33] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
// Phase 1: matrix 1109 rows 639 cols
[2024-05-31 21:32:33] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 21:32:33] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-31 21:32:33] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:32:33] [INFO ] Invariant cache hit.
[2024-05-31 21:32:34] [INFO ] State equation strengthened by 273 read => feed constraints.
[2024-05-31 21:32:35] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2434 ms to find 0 implicit places.
[2024-05-31 21:32:35] [INFO ] Redundant transitions in 34 ms returned []
Running 1656 sub problems to find dead transitions.
[2024-05-31 21:32:35] [INFO ] Flow matrix only has 1109 transitions (discarded 549 similar events)
[2024-05-31 21:32:35] [INFO ] Invariant cache hit.
[2024-05-31 21:32:35] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1656/1656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/638 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/638 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/638 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 3 (OVERLAPS) 1109/1747 variables, 638/640 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1747 variables, 273/913 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1747/1748 variables, and 1169 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 638/639 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 256/1656 constraints, Known Traps: 0/0 constraints]
After SMT, in 67590ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 67604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70170 ms. Remains : 639/639 places, 1658/1658 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-04 finished in 328702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 781 transition count 2024
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 781 transition count 2024
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 33 place count 781 transition count 2020
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 768 transition count 1984
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 768 transition count 1984
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 72 place count 755 transition count 1942
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 755 transition count 1942
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 738 transition count 1886
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 738 transition count 1886
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 136 place count 721 transition count 1840
Iterating global reduction 1 with 17 rules applied. Total rules applied 153 place count 721 transition count 1840
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 170 place count 704 transition count 1806
Iterating global reduction 1 with 17 rules applied. Total rules applied 187 place count 704 transition count 1806
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 1 with 17 rules applied. Total rules applied 221 place count 687 transition count 1772
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 236 place count 672 transition count 1742
Iterating global reduction 1 with 15 rules applied. Total rules applied 251 place count 672 transition count 1742
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 263 place count 660 transition count 1718
Iterating global reduction 1 with 12 rules applied. Total rules applied 275 place count 660 transition count 1718
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 282 place count 653 transition count 1704
Iterating global reduction 1 with 7 rules applied. Total rules applied 289 place count 653 transition count 1704
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 291 place count 651 transition count 1696
Iterating global reduction 1 with 2 rules applied. Total rules applied 293 place count 651 transition count 1696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 295 place count 649 transition count 1688
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 649 transition count 1688
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 299 place count 647 transition count 1684
Iterating global reduction 1 with 2 rules applied. Total rules applied 301 place count 647 transition count 1684
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 303 place count 645 transition count 1680
Iterating global reduction 1 with 2 rules applied. Total rules applied 305 place count 645 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 307 place count 643 transition count 1676
Iterating global reduction 1 with 2 rules applied. Total rules applied 309 place count 643 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 311 place count 641 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 313 place count 641 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 315 place count 639 transition count 1668
Iterating global reduction 1 with 2 rules applied. Total rules applied 317 place count 639 transition count 1668
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 325 place count 639 transition count 1660
Applied a total of 325 rules in 473 ms. Remains 639 /796 variables (removed 157) and now considering 1660/2056 (removed 396) transitions.
[2024-05-31 21:33:44] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
// Phase 1: matrix 1111 rows 639 cols
[2024-05-31 21:33:44] [INFO ] Computed 2 invariants in 12 ms
[2024-05-31 21:33:44] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-31 21:33:44] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:33:44] [INFO ] Invariant cache hit.
[2024-05-31 21:33:44] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-31 21:33:46] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2268 ms to find 0 implicit places.
[2024-05-31 21:33:46] [INFO ] Redundant transitions in 27 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-31 21:33:46] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:33:46] [INFO ] Invariant cache hit.
[2024-05-31 21:33:46] [INFO ] State equation strengthened by 275 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/1750 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1111/1750 variables, 639/641 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1750 variables, 275/916 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 2574 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 31340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 69682ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 69696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 639/796 places, 1660/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72473 ms. Remains : 639/796 places, 1660/2056 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 424 ms.
Product exploration explored 100000 steps with 0 reset in 518 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 103 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40008 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/5 properties
BEST_FIRST walk for 31123 steps (6 resets) in 52 ms. (587 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 253 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 82 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-31 21:34:58] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:34:58] [INFO ] Invariant cache hit.
[2024-05-31 21:34:58] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-31 21:34:58] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:34:58] [INFO ] Invariant cache hit.
[2024-05-31 21:34:59] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-31 21:35:00] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2024-05-31 21:35:00] [INFO ] Redundant transitions in 32 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-31 21:35:00] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:35:00] [INFO ] Invariant cache hit.
[2024-05-31 21:35:00] [INFO ] State equation strengthened by 275 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/1750 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1111/1750 variables, 639/641 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1750 variables, 275/916 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 2574 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 31569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 68907ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 68921ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71412 ms. Remains : 639/639 places, 1660/1660 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2024-05-31 21:36:09] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:36:09] [INFO ] Invariant cache hit.
[2024-05-31 21:36:09] [INFO ] State equation strengthened by 275 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/48 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 557/605 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 942/1547 variables, 473/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 267/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 62/1609 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1609 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 135/1744 variables, 132/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1744 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/1749 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1749 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/1750 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1750 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1750 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1750/1750 variables, and 916 constraints, problems are : Problem set: 0 solved, 2 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/48 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 557/605 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 942/1547 variables, 473/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1547 variables, 267/781 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1547 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 62/1609 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1609 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 135/1744 variables, 132/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1744 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/1749 variables, 3/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1749 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/1750 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1750 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1750 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 918 constraints, problems are : Problem set: 0 solved, 2 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 150 ms.
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Graph (complete) has 2769 edges and 639 vertex of which 447 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 447 transition count 1276
Applied a total of 385 rules in 50 ms. Remains 447 /639 variables (removed 192) and now considering 1276/1660 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 447/639 places, 1276/1660 transitions.
RANDOM walk for 40000 steps (8 resets) in 346 ms. (115 steps per ms) remains 1/2 properties
BEST_FIRST walk for 35516 steps (7 resets) in 32 ms. (1076 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 305 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 458 ms.
Product exploration explored 100000 steps with 0 reset in 508 ms.
Support contains 3 out of 639 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 639/639 places, 1660/1660 transitions.
Applied a total of 0 rules in 83 ms. Remains 639 /639 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2024-05-31 21:36:13] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:36:13] [INFO ] Invariant cache hit.
[2024-05-31 21:36:13] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-31 21:36:13] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:36:13] [INFO ] Invariant cache hit.
[2024-05-31 21:36:14] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-05-31 21:36:15] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2024-05-31 21:36:15] [INFO ] Redundant transitions in 34 ms returned []
Running 1658 sub problems to find dead transitions.
[2024-05-31 21:36:15] [INFO ] Flow matrix only has 1111 transitions (discarded 549 similar events)
[2024-05-31 21:36:15] [INFO ] Invariant cache hit.
[2024-05-31 21:36:15] [INFO ] State equation strengthened by 275 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/1750 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/639 constraints, ReadFeed: 0/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/639 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1111/1750 variables, 639/641 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1750 variables, 275/916 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1750 variables, and 2574 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 31589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 639/639 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 69832ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 69846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72260 ms. Remains : 639/639 places, 1660/1660 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-05 finished in 221922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 795 transition count 2056
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 51 place count 766 transition count 1980
Iterating global reduction 2 with 14 rules applied. Total rules applied 65 place count 766 transition count 1980
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 79 place count 752 transition count 1940
Iterating global reduction 2 with 14 rules applied. Total rules applied 93 place count 752 transition count 1940
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 2 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 2 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 2 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 258 place count 661 transition count 1710
Iterating global reduction 2 with 17 rules applied. Total rules applied 275 place count 661 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 290 place count 646 transition count 1680
Iterating global reduction 2 with 15 rules applied. Total rules applied 305 place count 646 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 316 place count 635 transition count 1658
Iterating global reduction 2 with 11 rules applied. Total rules applied 327 place count 635 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 330 place count 632 transition count 1650
Iterating global reduction 2 with 3 rules applied. Total rules applied 333 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 336 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 339 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 342 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 345 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 625 transition count 1634
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Applied a total of 353 rules in 285 ms. Remains 622 /796 variables (removed 174) and now considering 1628/2056 (removed 428) transitions.
[2024-05-31 21:37:25] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-31 21:37:25] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 21:37:26] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-31 21:37:26] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:37:26] [INFO ] Invariant cache hit.
[2024-05-31 21:37:26] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:37:28] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2302 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-31 21:37:28] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:37:28] [INFO ] Invariant cache hit.
[2024-05-31 21:37:28] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31400 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 69192ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 69210ms
Starting structural reductions in LTL mode, iteration 1 : 622/796 places, 1628/2056 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71803 ms. Remains : 622/796 places, 1628/2056 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 415 ms.
Product exploration explored 100000 steps with 0 reset in 453 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 30466 steps (6 resets) in 113 ms. (267 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 14 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-31 21:38:38] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:38:38] [INFO ] Invariant cache hit.
[2024-05-31 21:38:39] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-31 21:38:39] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:38:39] [INFO ] Invariant cache hit.
[2024-05-31 21:38:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:38:41] [INFO ] Implicit Places using invariants and state equation in 1789 ms returned []
Implicit Place search using SMT with State Equation took 2213 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-31 21:38:41] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:38:41] [INFO ] Invariant cache hit.
[2024-05-31 21:38:41] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 68515ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 68531ms
Finished structural reductions in LTL mode , in 1 iterations and 70764 ms. Remains : 622/622 places, 1628/1628 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37533 steps (8 resets) in 30 ms. (1210 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 440 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 13 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-31 21:39:51] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:39:51] [INFO ] Invariant cache hit.
[2024-05-31 21:39:51] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-31 21:39:51] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:39:51] [INFO ] Invariant cache hit.
[2024-05-31 21:39:51] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:39:53] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2233 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-31 21:39:53] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:39:53] [INFO ] Invariant cache hit.
[2024-05-31 21:39:53] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 69075ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 69093ms
Finished structural reductions in LTL mode , in 1 iterations and 71344 ms. Remains : 622/622 places, 1628/1628 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 216928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 778 transition count 2018
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 778 transition count 2018
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 778 transition count 2012
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 762 transition count 1970
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 762 transition count 1970
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 89 place count 746 transition count 1922
Iterating global reduction 1 with 16 rules applied. Total rules applied 105 place count 746 transition count 1922
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 126 place count 725 transition count 1854
Iterating global reduction 1 with 21 rules applied. Total rules applied 147 place count 725 transition count 1854
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 167 place count 705 transition count 1798
Iterating global reduction 1 with 20 rules applied. Total rules applied 187 place count 705 transition count 1798
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 207 place count 685 transition count 1758
Iterating global reduction 1 with 20 rules applied. Total rules applied 227 place count 685 transition count 1758
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 248 place count 664 transition count 1712
Iterating global reduction 1 with 21 rules applied. Total rules applied 269 place count 664 transition count 1712
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 288 place count 645 transition count 1670
Iterating global reduction 1 with 19 rules applied. Total rules applied 307 place count 645 transition count 1670
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 323 place count 629 transition count 1638
Iterating global reduction 1 with 16 rules applied. Total rules applied 339 place count 629 transition count 1638
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 350 place count 618 transition count 1616
Iterating global reduction 1 with 11 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 364 place count 615 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 367 place count 615 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 370 place count 612 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 373 place count 612 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 376 place count 609 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 379 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 380 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 381 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 382 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 383 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 384 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 385 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 389 place count 605 transition count 1584
Applied a total of 389 rules in 519 ms. Remains 605 /796 variables (removed 191) and now considering 1584/2056 (removed 472) transitions.
[2024-05-31 21:41:03] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-31 21:41:03] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:41:03] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-31 21:41:03] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:41:03] [INFO ] Invariant cache hit.
[2024-05-31 21:41:03] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-31 21:41:05] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
[2024-05-31 21:41:05] [INFO ] Redundant transitions in 24 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-31 21:41:05] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-31 21:41:05] [INFO ] Invariant cache hit.
[2024-05-31 21:41:05] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30026 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 31146 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 68555ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/796 places, 1584/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71326 ms. Remains : 605/796 places, 1584/2056 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 376 ms.
Stack based approach found an accepted trace after 2174 steps with 0 reset with depth 2175 and stack size 2175 in 11 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-07 finished in 71777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 37 place count 779 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 764 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 749 transition count 1930
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 749 transition count 1930
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 116 place count 730 transition count 1870
Iterating global reduction 1 with 19 rules applied. Total rules applied 135 place count 730 transition count 1870
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 153 place count 712 transition count 1822
Iterating global reduction 1 with 18 rules applied. Total rules applied 171 place count 712 transition count 1822
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 189 place count 694 transition count 1786
Iterating global reduction 1 with 18 rules applied. Total rules applied 207 place count 694 transition count 1786
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 226 place count 675 transition count 1744
Iterating global reduction 1 with 19 rules applied. Total rules applied 245 place count 675 transition count 1744
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 262 place count 658 transition count 1706
Iterating global reduction 1 with 17 rules applied. Total rules applied 279 place count 658 transition count 1706
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 293 place count 644 transition count 1678
Iterating global reduction 1 with 14 rules applied. Total rules applied 307 place count 644 transition count 1678
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 316 place count 635 transition count 1660
Iterating global reduction 1 with 9 rules applied. Total rules applied 325 place count 635 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 329 place count 631 transition count 1648
Iterating global reduction 1 with 4 rules applied. Total rules applied 333 place count 631 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 337 place count 627 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 341 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 345 place count 623 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 349 place count 623 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 351 place count 621 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 353 place count 621 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 355 place count 619 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 357 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 359 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 361 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 363 place count 615 transition count 1612
Iterating global reduction 1 with 2 rules applied. Total rules applied 365 place count 615 transition count 1612
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 369 place count 615 transition count 1608
Applied a total of 369 rules in 449 ms. Remains 615 /796 variables (removed 181) and now considering 1608/2056 (removed 448) transitions.
[2024-05-31 21:42:14] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2024-05-31 21:42:14] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 21:42:15] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-31 21:42:15] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:42:15] [INFO ] Invariant cache hit.
[2024-05-31 21:42:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 21:42:19] [INFO ] Implicit Places using invariants and state equation in 3714 ms returned []
Implicit Place search using SMT with State Equation took 4150 ms to find 0 implicit places.
[2024-05-31 21:42:19] [INFO ] Redundant transitions in 30 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-31 21:42:19] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:42:19] [INFO ] Invariant cache hit.
[2024-05-31 21:42:19] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69050ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/796 places, 1608/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73700 ms. Remains : 615/796 places, 1608/2056 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-08
Product exploration explored 100000 steps with 1 reset in 433 ms.
Product exploration explored 100000 steps with 1 reset in 451 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20698 steps (5 resets) in 62 ms. (328 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 82 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-31 21:43:29] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:43:29] [INFO ] Invariant cache hit.
[2024-05-31 21:43:30] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-31 21:43:30] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:43:30] [INFO ] Invariant cache hit.
[2024-05-31 21:43:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 21:43:33] [INFO ] Implicit Places using invariants and state equation in 3761 ms returned []
Implicit Place search using SMT with State Equation took 4238 ms to find 0 implicit places.
[2024-05-31 21:43:33] [INFO ] Redundant transitions in 30 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-31 21:43:33] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:43:33] [INFO ] Invariant cache hit.
[2024-05-31 21:43:33] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31513 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69046ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69060ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73418 ms. Remains : 615/615 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30154 steps (6 resets) in 123 ms. (243 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 151 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 401 ms.
Product exploration explored 100000 steps with 0 reset in 400 ms.
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 72 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2024-05-31 21:44:44] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:44:44] [INFO ] Invariant cache hit.
[2024-05-31 21:44:44] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-31 21:44:44] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:44:44] [INFO ] Invariant cache hit.
[2024-05-31 21:44:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-31 21:44:48] [INFO ] Implicit Places using invariants and state equation in 3821 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
[2024-05-31 21:44:48] [INFO ] Redundant transitions in 28 ms returned []
Running 1606 sub problems to find dead transitions.
[2024-05-31 21:44:48] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-31 21:44:48] [INFO ] Invariant cache hit.
[2024-05-31 21:44:48] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1688 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1688 variables, 265/882 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 31504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints]
After SMT, in 69283ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 69297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73662 ms. Remains : 615/615 places, 1608/1608 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-08 finished in 223691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 52 place count 765 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 67 place count 765 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 750 transition count 1932
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 750 transition count 1932
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 117 place count 730 transition count 1868
Iterating global reduction 1 with 20 rules applied. Total rules applied 137 place count 730 transition count 1868
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 156 place count 711 transition count 1814
Iterating global reduction 1 with 19 rules applied. Total rules applied 175 place count 711 transition count 1814
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 194 place count 692 transition count 1776
Iterating global reduction 1 with 19 rules applied. Total rules applied 213 place count 692 transition count 1776
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 233 place count 672 transition count 1732
Iterating global reduction 1 with 20 rules applied. Total rules applied 253 place count 672 transition count 1732
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 271 place count 654 transition count 1692
Iterating global reduction 1 with 18 rules applied. Total rules applied 289 place count 654 transition count 1692
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 304 place count 639 transition count 1662
Iterating global reduction 1 with 15 rules applied. Total rules applied 319 place count 639 transition count 1662
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 330 place count 628 transition count 1640
Iterating global reduction 1 with 11 rules applied. Total rules applied 341 place count 628 transition count 1640
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 344 place count 625 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 347 place count 625 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 350 place count 622 transition count 1624
Iterating global reduction 1 with 3 rules applied. Total rules applied 353 place count 622 transition count 1624
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 356 place count 619 transition count 1618
Iterating global reduction 1 with 3 rules applied. Total rules applied 359 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 360 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 364 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 365 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 366 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 367 place count 615 transition count 1610
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 371 place count 615 transition count 1606
Applied a total of 371 rules in 487 ms. Remains 615 /796 variables (removed 181) and now considering 1606/2056 (removed 450) transitions.
[2024-05-31 21:45:58] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 615 cols
[2024-05-31 21:45:58] [INFO ] Computed 2 invariants in 16 ms
[2024-05-31 21:45:58] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-31 21:45:59] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-31 21:45:59] [INFO ] Invariant cache hit.
[2024-05-31 21:45:59] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-31 21:46:00] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
[2024-05-31 21:46:00] [INFO ] Redundant transitions in 27 ms returned []
Running 1604 sub problems to find dead transitions.
[2024-05-31 21:46:00] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-31 21:46:00] [INFO ] Invariant cache hit.
[2024-05-31 21:46:00] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)timeout

(s139 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1689 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1689 variables, 267/884 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1689/1689 variables, and 2488 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 615/615 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68645ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68659ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/796 places, 1606/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71501 ms. Remains : 615/796 places, 1606/2056 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 394 ms.
Stack based approach found an accepted trace after 365 steps with 0 reset with depth 366 and stack size 366 in 2 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-09 finished in 71960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 796 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 779 transition count 2020
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 779 transition count 2020
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 39 place count 779 transition count 2014
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 54 place count 764 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 764 transition count 1976
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 84 place count 749 transition count 1932
Iterating global reduction 1 with 15 rules applied. Total rules applied 99 place count 749 transition count 1932
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 119 place count 729 transition count 1866
Iterating global reduction 1 with 20 rules applied. Total rules applied 139 place count 729 transition count 1866
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 158 place count 710 transition count 1812
Iterating global reduction 1 with 19 rules applied. Total rules applied 177 place count 710 transition count 1812
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 195 place count 692 transition count 1776
Iterating global reduction 1 with 18 rules applied. Total rules applied 213 place count 692 transition count 1776
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 232 place count 673 transition count 1734
Iterating global reduction 1 with 19 rules applied. Total rules applied 251 place count 673 transition count 1734
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 268 place count 656 transition count 1696
Iterating global reduction 1 with 17 rules applied. Total rules applied 285 place count 656 transition count 1696
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 300 place count 641 transition count 1666
Iterating global reduction 1 with 15 rules applied. Total rules applied 315 place count 641 transition count 1666
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 326 place count 630 transition count 1644
Iterating global reduction 1 with 11 rules applied. Total rules applied 337 place count 630 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 340 place count 627 transition count 1636
Iterating global reduction 1 with 3 rules applied. Total rules applied 343 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 346 place count 624 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 349 place count 624 transition count 1628
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 352 place count 621 transition count 1622
Iterating global reduction 1 with 3 rules applied. Total rules applied 355 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 356 place count 620 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 357 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 358 place count 619 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 359 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 360 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 361 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 362 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 363 place count 617 transition count 1614
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 367 place count 617 transition count 1610
Applied a total of 367 rules in 464 ms. Remains 617 /796 variables (removed 179) and now considering 1610/2056 (removed 446) transitions.
[2024-05-31 21:47:10] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
// Phase 1: matrix 1077 rows 617 cols
[2024-05-31 21:47:10] [INFO ] Computed 2 invariants in 10 ms
[2024-05-31 21:47:10] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-31 21:47:10] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-31 21:47:10] [INFO ] Invariant cache hit.
[2024-05-31 21:47:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:47:12] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
[2024-05-31 21:47:12] [INFO ] Redundant transitions in 32 ms returned []
Running 1608 sub problems to find dead transitions.
[2024-05-31 21:47:12] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2024-05-31 21:47:12] [INFO ] Invariant cache hit.
[2024-05-31 21:47:12] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 3 (OVERLAPS) 1077/1694 variables, 617/619 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 268/887 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2495 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 31211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints]
After SMT, in 69006ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 69020ms
Starting structural reductions in SI_LTL mode, iteration 1 : 617/796 places, 1610/2056 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71768 ms. Remains : 617/796 places, 1610/2056 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 376 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-10 finished in 72211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||(p1&&X((F(p0)||G(p1))))))) U G(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLCardinality-06
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 796 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 796/796 places, 2056/2056 transitions.
Graph (complete) has 4512 edges and 796 vertex of which 795 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 780 transition count 2022
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 780 transition count 2022
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 37 place count 780 transition count 2016
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 766 transition count 1980
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 766 transition count 1980
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 79 place count 752 transition count 1940
Iterating global reduction 1 with 14 rules applied. Total rules applied 93 place count 752 transition count 1940
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 112 place count 733 transition count 1878
Iterating global reduction 1 with 19 rules applied. Total rules applied 131 place count 733 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 149 place count 715 transition count 1826
Iterating global reduction 1 with 18 rules applied. Total rules applied 167 place count 715 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 185 place count 697 transition count 1790
Iterating global reduction 1 with 18 rules applied. Total rules applied 203 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 222 place count 678 transition count 1748
Iterating global reduction 1 with 19 rules applied. Total rules applied 241 place count 678 transition count 1748
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 258 place count 661 transition count 1710
Iterating global reduction 1 with 17 rules applied. Total rules applied 275 place count 661 transition count 1710
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 290 place count 646 transition count 1680
Iterating global reduction 1 with 15 rules applied. Total rules applied 305 place count 646 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 316 place count 635 transition count 1658
Iterating global reduction 1 with 11 rules applied. Total rules applied 327 place count 635 transition count 1658
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 330 place count 632 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 333 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 336 place count 629 transition count 1642
Iterating global reduction 1 with 3 rules applied. Total rules applied 339 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 342 place count 626 transition count 1636
Iterating global reduction 1 with 3 rules applied. Total rules applied 345 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 346 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 347 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 348 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 349 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 350 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 351 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 352 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 353 place count 622 transition count 1628
Applied a total of 353 rules in 330 ms. Remains 622 /796 variables (removed 174) and now considering 1628/2056 (removed 428) transitions.
[2024-05-31 21:48:22] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2024-05-31 21:48:22] [INFO ] Computed 2 invariants in 11 ms
[2024-05-31 21:48:23] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-31 21:48:23] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:48:23] [INFO ] Invariant cache hit.
[2024-05-31 21:48:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:48:25] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-31 21:48:25] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:48:25] [INFO ] Invariant cache hit.
[2024-05-31 21:48:25] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 68643ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 68658ms
Starting structural reductions in LI_LTL mode, iteration 1 : 622/796 places, 1628/2056 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 71150 ms. Remains : 622/796 places, 1628/2056 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 370 ms.
Product exploration explored 100000 steps with 0 reset in 407 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 40013 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39401 steps (8 resets) in 44 ms. (875 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 18 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-31 21:49:35] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:49:35] [INFO ] Invariant cache hit.
[2024-05-31 21:49:35] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-31 21:49:35] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:49:35] [INFO ] Invariant cache hit.
[2024-05-31 21:49:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:49:37] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-31 21:49:37] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:49:37] [INFO ] Invariant cache hit.
[2024-05-31 21:49:37] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31323 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 69197ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 69213ms
Finished structural reductions in LTL mode , in 1 iterations and 71433 ms. Remains : 622/622 places, 1628/1628 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 40005 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 541861 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 541861 steps, saw 351702 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-31 21:50:49] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:50:49] [INFO ] Invariant cache hit.
[2024-05-31 21:50:49] [INFO ] State equation strengthened by 268 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 557/578 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/585 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 934/1519 variables, 473/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1519 variables, 267/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1519 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1581 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1581 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 128/1709 variables, 130/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1709/1709 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/21 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 557/578 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/585 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 934/1519 variables, 473/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1519 variables, 267/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1519 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1581 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1581 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 128/1709 variables, 130/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1709 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1709 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 893 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 831ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 430 transition count 1244
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 391 place count 430 transition count 1238
Applied a total of 391 rules in 95 ms. Remains 430 /622 variables (removed 192) and now considering 1238/1628 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 430/622 places, 1238/1628 transitions.
RANDOM walk for 30154 steps (6 resets) in 86 ms. (346 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 371 ms.
Product exploration explored 100000 steps with 0 reset in 433 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1628/1628 transitions.
Applied a total of 0 rules in 21 ms. Remains 622 /622 variables (removed 0) and now considering 1628/1628 (removed 0) transitions.
[2024-05-31 21:50:51] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:50:51] [INFO ] Invariant cache hit.
[2024-05-31 21:50:52] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-31 21:50:52] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:50:52] [INFO ] Invariant cache hit.
[2024-05-31 21:50:52] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-31 21:50:54] [INFO ] Implicit Places using invariants and state equation in 1792 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2024-05-31 21:50:54] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2024-05-31 21:50:54] [INFO ] Invariant cache hit.
[2024-05-31 21:50:54] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 3 (OVERLAPS) 1087/1709 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1709 variables, 268/892 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1709/1709 variables, and 2518 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 31076 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints]
After SMT, in 68826ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 68842ms
Finished structural reductions in LTL mode , in 1 iterations and 71087 ms. Remains : 622/622 places, 1628/1628 transitions.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-06 finished in 220595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-31 21:52:03] [INFO ] Flatten gal took : 67 ms
[2024-05-31 21:52:03] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 21:52:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 796 places, 2056 transitions and 8350 arcs took 18 ms.
Total runtime 1656943 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-c004-LTLCardinality-04
Could not compute solution for formula : FunctionPointer-PT-c004-LTLCardinality-05
Could not compute solution for formula : FunctionPointer-PT-c004-LTLCardinality-06
Could not compute solution for formula : FunctionPointer-PT-c004-LTLCardinality-08

BK_STOP 1717192598001

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-c004-LTLCardinality-04
ltl formula formula --ltl=/tmp/1713/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 796 places, 2056 transitions and 8350 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.060 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1713/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1713/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1713/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1713/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 796 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 797, there are 2062 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2258 levels ~10000 states ~42904 transitions
pnml2lts-mc( 2/ 4): ~4508 levels ~20000 states ~85932 transitions
pnml2lts-mc( 2/ 4): ~9008 levels ~40000 states ~171932 transitions
pnml2lts-mc( 2/ 4): ~18008 levels ~80000 states ~343932 transitions
pnml2lts-mc( 2/ 4): ~36008 levels ~160000 states ~687932 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~1279936 transitions
pnml2lts-mc( 1/ 4): ~160000 levels ~640000 states ~2559924 transitions
pnml2lts-mc( 1/ 4): ~320000 levels ~1280000 states ~5119928 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1402122
pnml2lts-mc( 0/ 4): unique transitions count: 6702013
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 535920
pnml2lts-mc( 0/ 4): - claim success count: 1402127
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1356188
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1402127 states 6702030 transitions, fanout: 4.780
pnml2lts-mc( 0/ 4): Total exploration time 84.170 sec (84.140 sec minimum, 84.155 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16658, Transitions per second: 79625
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.7MB, 20.6 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2113 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.7MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-c004-LTLCardinality-05
ltl formula formula --ltl=/tmp/1713/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 796 places, 2056 transitions and 8350 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.060 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1713/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1713/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1713/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1713/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 796 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 797, there are 2068 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~26484 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~52192 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~103624 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~206476 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~412208 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~823628 transitions
pnml2lts-mc( 1/ 4): ~160000 levels ~640000 states ~1646484 transitions
pnml2lts-mc( 1/ 4): ~320000 levels ~1280000 states ~3292192 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1447793
pnml2lts-mc( 0/ 4): unique transitions count: 5978340
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 383971
pnml2lts-mc( 0/ 4): - claim success count: 1447798
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1447798
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1447798 states 5978357 transitions, fanout: 4.129
pnml2lts-mc( 0/ 4): Total exploration time 71.090 sec (71.080 sec minimum, 71.083 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20366, Transitions per second: 84096
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.5MB, 20.6 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2113 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.5MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-c004-LTLCardinality-06
ltl formula formula --ltl=/tmp/1713/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 796 places, 2056 transitions and 8350 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.060 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1713/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1713/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1713/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1713/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 797 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 797, there are 2061 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~31984 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~63792 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~127432 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~254708 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~509248 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~1018340 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~2036512 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1170136
pnml2lts-mc( 0/ 4): unique transitions count: 4571442
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1170144
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1170144
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1170144 states 4571465 transitions, fanout: 3.907
pnml2lts-mc( 0/ 4): Total exploration time 57.440 sec (57.410 sec minimum, 57.423 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20372, Transitions per second: 79587
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 98.7MB, 22.8 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2113 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 98.7MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-c004-LTLCardinality-08
ltl formula formula --ltl=/tmp/1713/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 796 places, 2056 transitions and 8350 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.050 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1713/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1713/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1713/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1713/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 797 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 797, there are 2059 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~30100 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~60100 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~120100 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~240100 transitions
pnml2lts-mc( 1/ 4): ~40000 levels ~160000 states ~480100 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~960128 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~1920128 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1188682
pnml2lts-mc( 0/ 4): unique transitions count: 4280614
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1188688
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1188688
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1188688 states 4280630 transitions, fanout: 3.601
pnml2lts-mc( 0/ 4): Total exploration time 58.270 sec (58.200 sec minimum, 58.238 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20400, Transitions per second: 73462
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 96.7MB, 23.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 2113 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 96.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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