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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 795K 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 ASLink-PT-05b-LTLFireability-00
FORMULA_NAME ASLink-PT-05b-LTLFireability-01
FORMULA_NAME ASLink-PT-05b-LTLFireability-02
FORMULA_NAME ASLink-PT-05b-LTLFireability-03
FORMULA_NAME ASLink-PT-05b-LTLFireability-04
FORMULA_NAME ASLink-PT-05b-LTLFireability-05
FORMULA_NAME ASLink-PT-05b-LTLFireability-06
FORMULA_NAME ASLink-PT-05b-LTLFireability-07
FORMULA_NAME ASLink-PT-05b-LTLFireability-08
FORMULA_NAME ASLink-PT-05b-LTLFireability-09
FORMULA_NAME ASLink-PT-05b-LTLFireability-10
FORMULA_NAME ASLink-PT-05b-LTLFireability-11
FORMULA_NAME ASLink-PT-05b-LTLFireability-12
FORMULA_NAME ASLink-PT-05b-LTLFireability-13
FORMULA_NAME ASLink-PT-05b-LTLFireability-14
FORMULA_NAME ASLink-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716282654285

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 09:10:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 09:10:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:10:56] [INFO ] Load time of PNML (sax parser for PT used): 482 ms
[2024-05-21 09:10:56] [INFO ] Transformed 2430 places.
[2024-05-21 09:10:56] [INFO ] Transformed 3040 transitions.
[2024-05-21 09:10:56] [INFO ] Found NUPN structural information;
[2024-05-21 09:10:56] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 811 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-05b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 2430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 2284 transition count 2894
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 2284 transition count 2894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 293 place count 2284 transition count 2893
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 349 place count 2228 transition count 2804
Iterating global reduction 1 with 56 rules applied. Total rules applied 405 place count 2228 transition count 2804
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 422 place count 2228 transition count 2787
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 431 place count 2219 transition count 2778
Iterating global reduction 2 with 9 rules applied. Total rules applied 440 place count 2219 transition count 2778
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 444 place count 2215 transition count 2767
Iterating global reduction 2 with 4 rules applied. Total rules applied 448 place count 2215 transition count 2767
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 451 place count 2212 transition count 2764
Iterating global reduction 2 with 3 rules applied. Total rules applied 454 place count 2212 transition count 2764
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 456 place count 2210 transition count 2762
Iterating global reduction 2 with 2 rules applied. Total rules applied 458 place count 2210 transition count 2762
Applied a total of 458 rules in 1915 ms. Remains 2210 /2430 variables (removed 220) and now considering 2762/3040 (removed 278) transitions.
// Phase 1: matrix 2762 rows 2210 cols
[2024-05-21 09:10:59] [INFO ] Computed 238 invariants in 285 ms
[2024-05-21 09:11:01] [INFO ] Implicit Places using invariants in 2435 ms returned [2044, 2055, 2066, 2074, 2082, 2090, 2098, 2109, 2117, 2125, 2136]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2489 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2199/2430 places, 2762/3040 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2187 transition count 2750
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2187 transition count 2750
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 2177 transition count 2740
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 2177 transition count 2740
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 2169 transition count 2732
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 2169 transition count 2732
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 2166 transition count 2729
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 2166 transition count 2729
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 2164 transition count 2727
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 2164 transition count 2727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 2162 transition count 2725
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 2162 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 2161 transition count 2724
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 2161 transition count 2724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 2160 transition count 2723
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 2160 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 2159 transition count 2722
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 2159 transition count 2722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 2158 transition count 2721
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 2158 transition count 2721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2157 transition count 2720
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2157 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 2156 transition count 2719
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 2156 transition count 2719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 2155 transition count 2718
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 2155 transition count 2718
Applied a total of 88 rules in 2036 ms. Remains 2155 /2199 variables (removed 44) and now considering 2718/2762 (removed 44) transitions.
// Phase 1: matrix 2718 rows 2155 cols
[2024-05-21 09:11:03] [INFO ] Computed 227 invariants in 158 ms
[2024-05-21 09:11:05] [INFO ] Implicit Places using invariants in 1777 ms returned []
[2024-05-21 09:11:05] [INFO ] Invariant cache hit.
[2024-05-21 09:11:13] [INFO ] Implicit Places using invariants and state equation in 7588 ms returned []
Implicit Place search using SMT with State Equation took 9369 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2155/2430 places, 2718/3040 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15849 ms. Remains : 2155/2430 places, 2718/3040 transitions.
Support contains 51 out of 2155 places after structural reductions.
[2024-05-21 09:11:13] [INFO ] Flatten gal took : 379 ms
[2024-05-21 09:11:14] [INFO ] Flatten gal took : 229 ms
[2024-05-21 09:11:14] [INFO ] Input system was already deterministic with 2718 transitions.
Support contains 49 out of 2155 places (down from 51) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (75 resets) in 2809 ms. (14 steps per ms) remains 20/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
[2024-05-21 09:11:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 262/295 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 369/664 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1437/2101 variables, 164/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2101 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 54/2155 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2155 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 2718/4873 variables, 2155/2382 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4873/4873 variables, and 2382 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 170/170 constraints, State Equation: 2155/2155 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 262/295 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 369/664 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1437/2101 variables, 164/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 09:11:23] [INFO ] Deduced a trap composed of 153 places in 1546 ms of which 163 ms to minimize.
[2024-05-21 09:11:25] [INFO ] Deduced a trap composed of 125 places in 1622 ms of which 16 ms to minimize.
[2024-05-21 09:11:27] [INFO ] Deduced a trap composed of 115 places in 1424 ms of which 14 ms to minimize.
SMT process timed out in 11530ms, After SMT, problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 2155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 2155 transition count 2340
Reduce places removed 378 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 383 rules applied. Total rules applied 761 place count 1777 transition count 2335
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 767 place count 1774 transition count 2332
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 770 place count 1771 transition count 2332
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 574 Pre rules applied. Total rules applied 770 place count 1771 transition count 1758
Deduced a syphon composed of 574 places in 6 ms
Ensure Unique test removed 51 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1199 rules applied. Total rules applied 1969 place count 1146 transition count 1758
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2007 place count 1141 transition count 1725
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 2040 place count 1108 transition count 1725
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 2040 place count 1108 transition count 1707
Deduced a syphon composed of 18 places in 16 ms
Ensure Unique test removed 18 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 2094 place count 1072 transition count 1707
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 2094 place count 1072 transition count 1690
Deduced a syphon composed of 17 places in 14 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 2128 place count 1055 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2129 place count 1054 transition count 1689
Iterating global reduction 6 with 1 rules applied. Total rules applied 2130 place count 1054 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2131 place count 1053 transition count 1688
Iterating global reduction 6 with 1 rules applied. Total rules applied 2132 place count 1053 transition count 1688
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 8 ms
Ensure Unique test removed 3 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 6 with 351 rules applied. Total rules applied 2483 place count 876 transition count 1514
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2486 place count 873 transition count 1511
Ensure Unique test removed 1 places
Iterating global reduction 6 with 4 rules applied. Total rules applied 2490 place count 872 transition count 1511
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2491 place count 872 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2492 place count 871 transition count 1510
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2492 place count 871 transition count 1509
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2494 place count 870 transition count 1509
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2495 place count 869 transition count 1508
Iterating global reduction 8 with 1 rules applied. Total rules applied 2496 place count 869 transition count 1508
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2498 place count 869 transition count 1506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2499 place count 868 transition count 1506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2501 place count 867 transition count 1512
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2507 place count 867 transition count 1506
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2513 place count 861 transition count 1506
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 2518 place count 861 transition count 1501
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2523 place count 856 transition count 1501
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2528 place count 856 transition count 1501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2529 place count 855 transition count 1500
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 12 with 13 rules applied. Total rules applied 2542 place count 846 transition count 1496
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 2546 place count 842 transition count 1496
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 13 Pre rules applied. Total rules applied 2546 place count 842 transition count 1483
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 14 with 27 rules applied. Total rules applied 2573 place count 828 transition count 1483
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2579 place count 822 transition count 1483
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2579 place count 822 transition count 1482
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2581 place count 821 transition count 1482
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2603 place count 810 transition count 1471
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2608 place count 805 transition count 1466
Iterating global reduction 15 with 5 rules applied. Total rules applied 2613 place count 805 transition count 1466
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2618 place count 805 transition count 1461
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2623 place count 800 transition count 1461
Applied a total of 2623 rules in 1258 ms. Remains 800 /2155 variables (removed 1355) and now considering 1461/2718 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1258 ms. Remains : 800/2155 places, 1461/2718 transitions.
RANDOM walk for 40000 steps (450 resets) in 510 ms. (78 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (9 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 133785 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 19
Probabilistic random walk after 133785 steps, saw 36495 distinct states, run finished after 3006 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 1461 rows 800 cols
[2024-05-21 09:11:31] [INFO ] Computed 133 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 101/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 31/161 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 4/165 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 428/593 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 48/641 variables, 17/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 132/773 variables, 35/120 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/773 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 4/777 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/777 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 21/798 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/798 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 1460/2258 variables, 798/930 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2258 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 3/2261 variables, 2/932 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2261 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2261 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 0/2261 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2261/2261 variables, and 933 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5961 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 101/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 31/161 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 4/165 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 428/593 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-21 09:11:39] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 48/641 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 132/773 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/773 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 4/777 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/777 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 21/798 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/798 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 18 (OVERLAPS) 1460/2258 variables, 798/931 constraints. Problems are: Problem set: 10 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2258 variables, 9/940 constraints. Problems are: Problem set: 10 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2258 variables, 0/940 constraints. Problems are: Problem set: 10 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 3/2261 variables, 2/942 constraints. Problems are: Problem set: 10 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2261 variables, 1/943 constraints. Problems are: Problem set: 10 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2261 variables, 0/943 constraints. Problems are: Problem set: 10 solved, 9 unsolved
[2024-05-21 09:11:49] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-21 09:11:49] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 2 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/2261 variables, 2/945 constraints. Problems are: Problem set: 10 solved, 9 unsolved
[2024-05-21 09:11:50] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2261 variables, 1/946 constraints. Problems are: Problem set: 10 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2261 variables, 0/946 constraints. Problems are: Problem set: 10 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 0/2261 variables, 0/946 constraints. Problems are: Problem set: 10 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2261/2261 variables, and 946 constraints, problems are : Problem set: 10 solved, 9 unsolved in 15416 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 9/19 constraints, Known Traps: 4/4 constraints]
After SMT, in 21440ms problems are : Problem set: 10 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 33783 ms.
Support contains 13 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 1461/1461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 800 transition count 1459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 798 transition count 1459
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 798 transition count 1454
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 793 transition count 1454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 792 transition count 1446
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 792 transition count 1446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 791 transition count 1438
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 791 transition count 1438
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 790 transition count 1430
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 790 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 789 transition count 1422
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 789 transition count 1422
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 788 transition count 1414
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 788 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 787 transition count 1406
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 787 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 786 transition count 1398
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 786 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 785 transition count 1390
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 785 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 784 transition count 1382
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 784 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 783 transition count 1374
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 783 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 782 transition count 1366
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 782 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 781 transition count 1358
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 781 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 780 transition count 1350
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 780 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 779 transition count 1342
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 779 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 778 transition count 1334
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 778 transition count 1334
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 53 place count 773 transition count 1330
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 53 place count 773 transition count 1328
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 771 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 770 transition count 1327
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 770 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 769 transition count 1325
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 769 transition count 1325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 768 transition count 1324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 767 transition count 1323
Applied a total of 64 rules in 522 ms. Remains 767 /800 variables (removed 33) and now considering 1323/1461 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 767/800 places, 1323/1461 transitions.
RANDOM walk for 40000 steps (473 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (83 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (91 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (85 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (83 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (92 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (86 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (88 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (89 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 168806 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 8
Probabilistic random walk after 168806 steps, saw 35897 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 1323 rows 767 cols
[2024-05-21 09:12:31] [INFO ] Computed 132 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 67/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/86 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 279/365 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 78/443 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 4/447 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 227/674 variables, 38/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 6/680 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/680 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 80/760 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/760 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/761 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/761 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/767 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/767 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 1323/2090 variables, 767/899 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2090 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/2090 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2090/2090 variables, and 899 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 767/767 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 67/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/86 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 279/365 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 78/443 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 4/447 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 227/674 variables, 38/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 6/680 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/680 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 80/760 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/760 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/761 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/761 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 6/767 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/767 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 1323/2090 variables, 767/899 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2090 variables, 8/907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2090 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/2090 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2090/2090 variables, and 907 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 767/767 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 6728ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 17993 ms.
Support contains 12 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 1323/1323 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 767 transition count 1322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 766 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 766 transition count 1321
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 765 transition count 1321
Applied a total of 4 rules in 48 ms. Remains 765 /767 variables (removed 2) and now considering 1321/1323 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 765/767 places, 1321/1323 transitions.
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA ASLink-PT-05b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 86 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G((p1||X(p0)))))'
Support contains 2 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 2143 transition count 2691
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 2143 transition count 2691
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2142 transition count 2690
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2141 transition count 2689
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2141 transition count 2689
Applied a total of 29 rules in 871 ms. Remains 2141 /2155 variables (removed 14) and now considering 2689/2718 (removed 29) transitions.
// Phase 1: matrix 2689 rows 2141 cols
[2024-05-21 09:12:57] [INFO ] Computed 227 invariants in 37 ms
[2024-05-21 09:12:58] [INFO ] Implicit Places using invariants in 1733 ms returned []
[2024-05-21 09:12:58] [INFO ] Invariant cache hit.
[2024-05-21 09:13:06] [INFO ] Implicit Places using invariants and state equation in 7553 ms returned []
Implicit Place search using SMT with State Equation took 9293 ms to find 0 implicit places.
Running 2688 sub problems to find dead transitions.
[2024-05-21 09:13:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2140 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2140/4830 variables, and 133 constraints, problems are : Problem set: 0 solved, 2688 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/53 constraints, Generalized P Invariants (flows): 133/174 constraints, State Equation: 0/2141 constraints, PredecessorRefiner: 2688/2688 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2140 variables, 133/133 constraints. Problems are: Problem set: 0 solved, 2688 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2140/4830 variables, and 133 constraints, problems are : Problem set: 0 solved, 2688 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/53 constraints, Generalized P Invariants (flows): 133/174 constraints, State Equation: 0/2141 constraints, PredecessorRefiner: 0/2688 constraints, Known Traps: 0/0 constraints]
After SMT, in 61693ms problems are : Problem set: 0 solved, 2688 unsolved
Search for dead transitions found 0 dead transitions in 61735ms
Starting structural reductions in LTL mode, iteration 1 : 2141/2155 places, 2689/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71918 ms. Remains : 2141/2155 places, 2689/2718 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-01 finished in 72377 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) U p1))))'
Support contains 3 out of 2155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 2154 transition count 2322
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 400 rules applied. Total rules applied 795 place count 1759 transition count 2317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 798 place count 1756 transition count 2317
Performed 581 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 581 Pre rules applied. Total rules applied 798 place count 1756 transition count 1736
Deduced a syphon composed of 581 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 3 with 1215 rules applied. Total rules applied 2013 place count 1122 transition count 1736
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2052 place count 1117 transition count 1702
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2086 place count 1083 transition count 1702
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2086 place count 1083 transition count 1682
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 2146 place count 1043 transition count 1682
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 2146 place count 1043 transition count 1663
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 2184 place count 1024 transition count 1663
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2188 place count 1020 transition count 1652
Iterating global reduction 5 with 4 rules applied. Total rules applied 2192 place count 1020 transition count 1652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2192 place count 1020 transition count 1651
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2194 place count 1019 transition count 1651
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2197 place count 1016 transition count 1641
Iterating global reduction 5 with 3 rules applied. Total rules applied 2200 place count 1016 transition count 1641
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2202 place count 1014 transition count 1632
Iterating global reduction 5 with 2 rules applied. Total rules applied 2204 place count 1014 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2205 place count 1013 transition count 1624
Iterating global reduction 5 with 1 rules applied. Total rules applied 2206 place count 1013 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2207 place count 1012 transition count 1616
Iterating global reduction 5 with 1 rules applied. Total rules applied 2208 place count 1012 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2209 place count 1011 transition count 1608
Iterating global reduction 5 with 1 rules applied. Total rules applied 2210 place count 1011 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2211 place count 1010 transition count 1600
Iterating global reduction 5 with 1 rules applied. Total rules applied 2212 place count 1010 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2213 place count 1009 transition count 1592
Iterating global reduction 5 with 1 rules applied. Total rules applied 2214 place count 1009 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2215 place count 1008 transition count 1584
Iterating global reduction 5 with 1 rules applied. Total rules applied 2216 place count 1008 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2217 place count 1007 transition count 1576
Iterating global reduction 5 with 1 rules applied. Total rules applied 2218 place count 1007 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2219 place count 1006 transition count 1568
Iterating global reduction 5 with 1 rules applied. Total rules applied 2220 place count 1006 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2221 place count 1005 transition count 1560
Iterating global reduction 5 with 1 rules applied. Total rules applied 2222 place count 1005 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2223 place count 1004 transition count 1552
Iterating global reduction 5 with 1 rules applied. Total rules applied 2224 place count 1004 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2225 place count 1003 transition count 1544
Iterating global reduction 5 with 1 rules applied. Total rules applied 2226 place count 1003 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2227 place count 1002 transition count 1536
Iterating global reduction 5 with 1 rules applied. Total rules applied 2228 place count 1002 transition count 1536
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 5 with 345 rules applied. Total rules applied 2573 place count 828 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2576 place count 825 transition count 1362
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 2580 place count 824 transition count 1362
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2581 place count 824 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2582 place count 823 transition count 1361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2582 place count 823 transition count 1360
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2584 place count 822 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2585 place count 821 transition count 1359
Iterating global reduction 7 with 1 rules applied. Total rules applied 2586 place count 821 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2588 place count 821 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2589 place count 820 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2591 place count 819 transition count 1362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2593 place count 817 transition count 1360
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2608 place count 807 transition count 1355
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2613 place count 802 transition count 1355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2613 place count 802 transition count 1340
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2644 place count 786 transition count 1340
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2655 place count 775 transition count 1340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2655 place count 775 transition count 1339
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2657 place count 774 transition count 1339
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2689 place count 758 transition count 1323
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2699 place count 748 transition count 1313
Iterating global reduction 12 with 10 rules applied. Total rules applied 2709 place count 748 transition count 1313
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2714 place count 743 transition count 1308
Iterating global reduction 12 with 5 rules applied. Total rules applied 2719 place count 743 transition count 1308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2724 place count 743 transition count 1303
Applied a total of 2724 rules in 1154 ms. Remains 743 /2155 variables (removed 1412) and now considering 1303/2718 (removed 1415) transitions.
// Phase 1: matrix 1303 rows 743 cols
[2024-05-21 09:14:09] [INFO ] Computed 123 invariants in 20 ms
[2024-05-21 09:14:10] [INFO ] Implicit Places using invariants in 872 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 346, 381, 382, 394, 395, 397, 414, 432, 452, 503, 504, 516, 517, 519, 536, 554, 574, 625, 626, 629, 640, 641, 642, 660, 681, 682, 683, 684]
[2024-05-21 09:14:10] [INFO ] Actually due to overlaps returned [660, 642, 48, 167, 289, 414, 536, 31, 147, 150, 269, 272, 394, 397, 516, 519, 640, 681, 148, 270, 395, 517, 641, 682, 1, 18, 256, 257, 381, 382, 503, 504, 625, 626, 683, 19, 66, 86, 137, 185, 205, 307, 327, 432, 452, 554, 574, 629, 684]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 900 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 694/2155 places, 1303/2718 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 693 transition count 1216
Reduce places removed 87 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 606 transition count 1215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 605 transition count 1215
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 177 place count 605 transition count 1188
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 232 place count 577 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 244 place count 573 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 252 place count 565 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 255 place count 562 transition count 1177
Iterating global reduction 5 with 3 rules applied. Total rules applied 258 place count 562 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 261 place count 562 transition count 1174
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 343 place count 521 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 347 place count 519 transition count 1134
Applied a total of 347 rules in 86 ms. Remains 519 /694 variables (removed 175) and now considering 1134/1303 (removed 169) transitions.
// Phase 1: matrix 1134 rows 519 cols
[2024-05-21 09:14:10] [INFO ] Computed 68 invariants in 18 ms
[2024-05-21 09:14:11] [INFO ] Implicit Places using invariants in 640 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 275, 352, 358, 363, 440, 446, 451, 516]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 647 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 503/2155 places, 1134/2718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 503 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 502 transition count 1133
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 492 transition count 1123
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 492 transition count 1123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 482 transition count 1113
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 482 transition count 1113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 477 transition count 1108
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 477 transition count 1108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 472 transition count 1103
Applied a total of 62 rules in 120 ms. Remains 472 /503 variables (removed 31) and now considering 1103/1134 (removed 31) transitions.
// Phase 1: matrix 1103 rows 472 cols
[2024-05-21 09:14:11] [INFO ] Computed 52 invariants in 10 ms
[2024-05-21 09:14:12] [INFO ] Implicit Places using invariants in 738 ms returned []
[2024-05-21 09:14:12] [INFO ] Invariant cache hit.
[2024-05-21 09:14:13] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 472/2155 places, 1103/2718 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5273 ms. Remains : 472/2155 places, 1103/2718 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-04
Stuttering criterion allowed to conclude after 187 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-04 finished in 5437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 2140 transition count 2681
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2140 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 2138 transition count 2672
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 2121 transition count 2578
Applied a total of 69 rules in 3312 ms. Remains 2121 /2155 variables (removed 34) and now considering 2578/2718 (removed 140) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:14:17] [INFO ] Computed 227 invariants in 31 ms
[2024-05-21 09:14:18] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2024-05-21 09:14:18] [INFO ] Invariant cache hit.
[2024-05-21 09:14:35] [INFO ] Implicit Places using invariants and state equation in 16195 ms returned []
Implicit Place search using SMT with State Equation took 17860 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-05-21 09:14:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 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 Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61302ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61337ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2155 places, 2578/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82515 ms. Remains : 2121/2155 places, 2578/2718 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-06 finished in 82671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p0)&&X(X((p1||G(p2))))))))'
Support contains 3 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2150 transition count 2706
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2150 transition count 2706
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 2146 transition count 2695
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 2146 transition count 2695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2146 transition count 2694
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 2143 transition count 2691
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 2143 transition count 2691
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 2141 transition count 2682
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 2141 transition count 2682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 2139 transition count 2673
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 2139 transition count 2673
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 2138 transition count 2672
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2664
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2656
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2647
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2639
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2630
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2622
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2613
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2613
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2605
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2596
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2588
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2579
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2579
Applied a total of 67 rules in 3994 ms. Remains 2122 /2155 variables (removed 33) and now considering 2579/2718 (removed 139) transitions.
// Phase 1: matrix 2579 rows 2122 cols
[2024-05-21 09:15:40] [INFO ] Computed 227 invariants in 30 ms
[2024-05-21 09:15:42] [INFO ] Implicit Places using invariants in 1697 ms returned []
[2024-05-21 09:15:42] [INFO ] Invariant cache hit.
[2024-05-21 09:15:50] [INFO ] Implicit Places using invariants and state equation in 8523 ms returned []
Implicit Place search using SMT with State Equation took 10228 ms to find 0 implicit places.
Running 2578 sub problems to find dead transitions.
[2024-05-21 09:15:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 129/173 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2578/2578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 129/173 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2578 constraints, Known Traps: 0/0 constraints]
After SMT, in 61216ms problems are : Problem set: 0 solved, 2578 unsolved
Search for dead transitions found 0 dead transitions in 61250ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2155 places, 2579/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75478 ms. Remains : 2122/2155 places, 2579/2718 transitions.
Stuttering acceptance computed with spot in 565 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-07 finished in 76104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 6 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2150 transition count 2706
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2150 transition count 2706
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 2146 transition count 2695
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 2146 transition count 2695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2146 transition count 2694
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 2143 transition count 2691
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 2143 transition count 2691
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 2141 transition count 2682
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 2141 transition count 2682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 2139 transition count 2673
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 2139 transition count 2673
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 2138 transition count 2672
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 2138 transition count 2672
Applied a total of 35 rules in 1202 ms. Remains 2138 /2155 variables (removed 17) and now considering 2672/2718 (removed 46) transitions.
// Phase 1: matrix 2672 rows 2138 cols
[2024-05-21 09:16:53] [INFO ] Computed 227 invariants in 57 ms
[2024-05-21 09:16:55] [INFO ] Implicit Places using invariants in 1957 ms returned []
[2024-05-21 09:16:55] [INFO ] Invariant cache hit.
[2024-05-21 09:17:02] [INFO ] Implicit Places using invariants and state equation in 7188 ms returned []
Implicit Place search using SMT with State Equation took 9150 ms to find 0 implicit places.
Running 2671 sub problems to find dead transitions.
[2024-05-21 09:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2137 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2137/4810 variables, and 129 constraints, problems are : Problem set: 0 solved, 2671 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/56 constraints, Generalized P Invariants (flows): 129/171 constraints, State Equation: 0/2138 constraints, PredecessorRefiner: 2671/2671 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2137 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2671 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 Int declared 2137/4810 variables, and 129 constraints, problems are : Problem set: 0 solved, 2671 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/56 constraints, Generalized P Invariants (flows): 129/171 constraints, State Equation: 0/2138 constraints, PredecessorRefiner: 0/2671 constraints, Known Traps: 0/0 constraints]
After SMT, in 61511ms problems are : Problem set: 0 solved, 2671 unsolved
Search for dead transitions found 0 dead transitions in 61543ms
Starting structural reductions in LTL mode, iteration 1 : 2138/2155 places, 2672/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71901 ms. Remains : 2138/2155 places, 2672/2718 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 1019 ms.
Product exploration explored 100000 steps with 33333 reset in 745 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05b-LTLFireability-08 finished in 73958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
Support contains 7 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 2140 transition count 2681
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2140 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 2138 transition count 2672
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 2121 transition count 2578
Applied a total of 69 rules in 3215 ms. Remains 2121 /2155 variables (removed 34) and now considering 2578/2718 (removed 140) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:18:09] [INFO ] Computed 227 invariants in 53 ms
[2024-05-21 09:18:11] [INFO ] Implicit Places using invariants in 2186 ms returned []
[2024-05-21 09:18:11] [INFO ] Invariant cache hit.
[2024-05-21 09:18:31] [INFO ] Implicit Places using invariants and state equation in 19430 ms returned []
Implicit Place search using SMT with State Equation took 21627 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-05-21 09:18:31] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 13)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 3)
(s49 1)
(s50 6)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 22)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 6)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 1)
(s115 1)
(s116 1)
(s117 0)
(s118 5)
(s119 1)
(s120 0)
(s121 0)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 1)
(s145 1)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 1)
(s161 1)
(s162 0)
(s163 1)
(s164 1)
(s165 0)
(s166 1)
(s167 1)
(s168 0)
(s169 1)
(s170 1)
(s171 0)
(s172 0)
(s173 2)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 11)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 0)
(s251 1)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 1)
(s272 1)
(s273 0)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 0)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 0)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 0)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 0)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 0)
(s329 1)
(s330 1)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 1)
(s337 1)
(s338 0)
(s339 0)
(s340 1)
(s341 1)
(s342 0)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 0)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 0)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 4)
(s362 0)
(s363 0)
(s364 1)
(s365 1)
(s366 0)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 17)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 17)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 14)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 4)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 81)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 1)
(s495 1)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 1)
(s501 1)
(s502 0)
(s503 1)
(s504 1)
(s505 0)
(s506 1)
(s507 1)
(s508 0)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 23)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 0)
(s571 0)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 4)
(s621 1)
(s622 1)
(s623 0)
(s624 1)
(s625 1)
(s626 0)
(s627 1)
(s628 0)
(s629 0)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 9)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 0)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 0)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 0)
(s668 1)
(s669 1)
(s670 1)
(s671 9)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 0)
(s679 1)
(s680 1)
(s681 1)
(s682 0)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 0)
(s688 1)
(s689 1)
(s690 0)
(s691 0)
(s692 1)
(s693 0)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 0)
(s699 1)
(s700 1)
(s701 0)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 0)
(s712 0)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 4)
(s721 0)
(s722 0)
(s723 1)
(s724 1)
(s725 0)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 13)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 13)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 10)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 107)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30136 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61457ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61490ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2155 places, 2578/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86339 ms. Remains : 2121/2155 places, 2578/2718 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 184 reset in 632 ms.
Product exploration explored 100000 steps with 207 reset in 514 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (81 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 176796 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 176796 steps, saw 33275 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-21 09:19:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 532/581 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1481/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/2121 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 173/173 constraints, State Equation: 2121/2121 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 532/581 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1481/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 09:19:41] [INFO ] Deduced a trap composed of 24 places in 752 ms of which 11 ms to minimize.
[2024-05-21 09:19:41] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 6 ms to minimize.
[2024-05-21 09:19:42] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2062 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/2121 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2121 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4699/4699 variables, and 2351 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4016 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 173/173 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 6098ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2121 transition count 2193
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 388 rules applied. Total rules applied 773 place count 1736 transition count 2190
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 776 place count 1734 transition count 2189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 1733 transition count 2189
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 777 place count 1733 transition count 1617
Deduced a syphon composed of 572 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1974 place count 1108 transition count 1617
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2013 place count 1103 transition count 1583
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2047 place count 1069 transition count 1583
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2047 place count 1069 transition count 1563
Deduced a syphon composed of 20 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2107 place count 1029 transition count 1563
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2107 place count 1029 transition count 1544
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2145 place count 1010 transition count 1544
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 2495 place count 834 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2499 place count 830 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2504 place count 829 transition count 1366
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2505 place count 829 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2506 place count 828 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2506 place count 828 transition count 1364
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2508 place count 827 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2510 place count 825 transition count 1362
Iterating global reduction 8 with 2 rules applied. Total rules applied 2512 place count 825 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2514 place count 825 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2515 place count 824 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2517 place count 823 transition count 1365
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2523 place count 823 transition count 1359
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2529 place count 817 transition count 1359
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2533 place count 817 transition count 1355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2537 place count 813 transition count 1355
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2542 place count 813 transition count 1355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2543 place count 812 transition count 1354
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2558 place count 802 transition count 1349
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2563 place count 797 transition count 1349
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2563 place count 797 transition count 1334
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2594 place count 781 transition count 1334
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2600 place count 775 transition count 1334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2600 place count 775 transition count 1333
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2624 place count 763 transition count 1322
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2629 place count 758 transition count 1317
Iterating global reduction 15 with 5 rules applied. Total rules applied 2634 place count 758 transition count 1317
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2639 place count 758 transition count 1312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2644 place count 753 transition count 1312
Applied a total of 2644 rules in 779 ms. Remains 753 /2121 variables (removed 1368) and now considering 1312/2578 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 780 ms. Remains : 753/2121 places, 1312/2578 transitions.
RANDOM walk for 40000 steps (472 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (90 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 276954 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 276954 steps, saw 58848 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 1312 rows 753 cols
[2024-05-21 09:19:48] [INFO ] Computed 129 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/123 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 198/321 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 80/401 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/405 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 268/673 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/680 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/680 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/749 variables, 19/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/749 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/753 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/753 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1312/2065 variables, 753/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2065 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2065 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2065/2065 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 753/753 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/123 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 198/321 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 80/401 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/405 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 268/673 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/680 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/680 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/749 variables, 19/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/749 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/753 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/753 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1312/2065 variables, 753/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2065 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2065 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2065 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2065/2065 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1897ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 42 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 753/753 places, 1312/1312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 39 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
[2024-05-21 09:19:50] [INFO ] Invariant cache hit.
[2024-05-21 09:19:51] [INFO ] Implicit Places using invariants in 1187 ms returned [1, 18, 19, 31, 49, 67, 136, 140, 149, 150, 152, 169, 187, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 632, 636, 637, 640, 651, 652, 653, 671, 692, 693, 694, 695]
[2024-05-21 09:19:51] [INFO ] Actually due to overlaps returned [671, 653, 49, 169, 293, 416, 539, 31, 152, 276, 399, 522, 149, 273, 396, 519, 651, 692, 150, 274, 397, 520, 652, 693, 1, 18, 261, 262, 384, 385, 507, 508, 636, 637, 67, 187, 311, 434, 557, 694, 19, 640, 695]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1190 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 710/753 places, 1312/1312 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 705 transition count 1220
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 613 transition count 1214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 612 transition count 1214
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 196 place count 612 transition count 1188
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 249 place count 585 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 261 place count 581 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 269 place count 573 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 272 place count 570 transition count 1177
Iterating global reduction 5 with 3 rules applied. Total rules applied 275 place count 570 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 278 place count 570 transition count 1174
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 352 place count 533 transition count 1137
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 357 place count 528 transition count 1132
Iterating global reduction 6 with 5 rules applied. Total rules applied 362 place count 528 transition count 1132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 367 place count 528 transition count 1127
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 371 place count 526 transition count 1128
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 381 place count 526 transition count 1118
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 392 place count 515 transition count 1118
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 407 place count 515 transition count 1118
Applied a total of 407 rules in 146 ms. Remains 515 /710 variables (removed 195) and now considering 1118/1312 (removed 194) transitions.
// Phase 1: matrix 1118 rows 515 cols
[2024-05-21 09:19:51] [INFO ] Computed 75 invariants in 10 ms
[2024-05-21 09:19:52] [INFO ] Implicit Places using invariants in 887 ms returned [74, 90, 96, 99, 101, 102, 105, 106, 160, 176, 182, 185, 187, 192, 193, 246, 262, 268, 271, 273, 278, 279, 332, 348, 354, 357, 359, 364, 365, 418, 434, 440, 443]
[2024-05-21 09:19:52] [INFO ] Actually due to overlaps returned [105, 192, 278, 364, 106, 193, 279, 365, 90, 96, 101, 176, 182, 187, 262, 268, 273, 348, 354, 359, 434, 440, 74, 102, 160, 246, 332, 418, 443]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 891 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 486/753 places, 1118/1312 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 468 transition count 1100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 468 transition count 1100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 463 transition count 1095
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 463 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 66 place count 453 transition count 1085
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 453 transition count 1071
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 94 place count 439 transition count 1071
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 439 transition count 1066
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 104 place count 434 transition count 1066
Applied a total of 104 rules in 131 ms. Remains 434 /486 variables (removed 52) and now considering 1066/1118 (removed 52) transitions.
// Phase 1: matrix 1066 rows 434 cols
[2024-05-21 09:19:52] [INFO ] Computed 46 invariants in 15 ms
[2024-05-21 09:19:53] [INFO ] Implicit Places using invariants in 759 ms returned []
[2024-05-21 09:19:53] [INFO ] Invariant cache hit.
[2024-05-21 09:19:54] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 434/753 places, 1066/1312 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4986 ms. Remains : 434/753 places, 1066/1312 transitions.
RANDOM walk for 40000 steps (722 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (156 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 354723 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 354723 steps, saw 83915 distinct states, run finished after 3004 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-21 09:19:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 218/291 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/317 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 102/419 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/423 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/434 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1066/1500 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1500 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1500 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1500/1500 variables, and 480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 434/434 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 218/291 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/317 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 102/419 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/423 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/434 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1066/1500 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1500 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1500 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1500 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1500/1500 variables, and 481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1604ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1066/1066 transitions.
Applied a total of 0 rules in 24 ms. Remains 434 /434 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 434/434 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1066/1066 transitions.
Applied a total of 0 rules in 24 ms. Remains 434 /434 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-05-21 09:19:59] [INFO ] Invariant cache hit.
[2024-05-21 09:20:00] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-21 09:20:00] [INFO ] Invariant cache hit.
[2024-05-21 09:20:02] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2479 ms to find 0 implicit places.
[2024-05-21 09:20:02] [INFO ] Redundant transitions in 86 ms returned []
Running 1037 sub problems to find dead transitions.
[2024-05-21 09:20:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
[2024-05-21 09:20:32] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
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 433/1500 variables, and 43 constraints, problems are : Problem set: 0 solved, 1037 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/434 constraints, PredecessorRefiner: 1037/1037 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1037 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1500 variables, and 47 constraints, problems are : Problem set: 0 solved, 1037 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/434 constraints, PredecessorRefiner: 0/1037 constraints, Known Traps: 1/1 constraints]
After SMT, in 60738ms problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 60750ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63349 ms. Remains : 434/434 places, 1066/1066 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 25 ms. Remains 434 /434 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 09:21:03] [INFO ] Invariant cache hit.
[2024-05-21 09:21:03] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 09:21:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-21 09:21:03] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 27 ms returned sat
[2024-05-21 09:21:04] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 09:21:04] [INFO ] After 709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 09:21:04] [INFO ] After 997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1193 ms.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 2121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 158 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:21:04] [INFO ] Computed 227 invariants in 34 ms
[2024-05-21 09:21:06] [INFO ] Implicit Places using invariants in 1410 ms returned []
[2024-05-21 09:21:06] [INFO ] Invariant cache hit.
[2024-05-21 09:21:23] [INFO ] Implicit Places using invariants and state equation in 17759 ms returned []
Implicit Place search using SMT with State Equation took 19171 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-05-21 09:21:24] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 13)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 3)
(s49 1)
(s50 6)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 22)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 6)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 1)
(s115 1)
(s116 1)
(s117 0)
(s118 5)
(s119 1)
(s120 0)
(s121 0)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61717ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61752ms
Finished structural reductions in LTL mode , in 1 iterations and 81087 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (83 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 176066 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 176066 steps, saw 33179 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-21 09:22:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 532/581 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1481/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/2121 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 173/173 constraints, State Equation: 2121/2121 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 532/581 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1481/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 09:22:32] [INFO ] Deduced a trap composed of 24 places in 569 ms of which 9 ms to minimize.
[2024-05-21 09:22:32] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 4 ms to minimize.
[2024-05-21 09:22:32] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2062 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/2121 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2121 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4699/4699 variables, and 2351 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3413 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 173/173 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 5478ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2121 transition count 2193
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 388 rules applied. Total rules applied 773 place count 1736 transition count 2190
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 776 place count 1734 transition count 2189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 1733 transition count 2189
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 777 place count 1733 transition count 1617
Deduced a syphon composed of 572 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1974 place count 1108 transition count 1617
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2013 place count 1103 transition count 1583
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2047 place count 1069 transition count 1583
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2047 place count 1069 transition count 1563
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2107 place count 1029 transition count 1563
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2107 place count 1029 transition count 1544
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2145 place count 1010 transition count 1544
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 2495 place count 834 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2499 place count 830 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2504 place count 829 transition count 1366
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2505 place count 829 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2506 place count 828 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2506 place count 828 transition count 1364
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2508 place count 827 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2510 place count 825 transition count 1362
Iterating global reduction 8 with 2 rules applied. Total rules applied 2512 place count 825 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2514 place count 825 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2515 place count 824 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2517 place count 823 transition count 1365
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2523 place count 823 transition count 1359
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2529 place count 817 transition count 1359
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2533 place count 817 transition count 1355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2537 place count 813 transition count 1355
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2542 place count 813 transition count 1355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2543 place count 812 transition count 1354
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2558 place count 802 transition count 1349
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2563 place count 797 transition count 1349
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2563 place count 797 transition count 1334
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2594 place count 781 transition count 1334
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2600 place count 775 transition count 1334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2600 place count 775 transition count 1333
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2624 place count 763 transition count 1322
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2629 place count 758 transition count 1317
Iterating global reduction 15 with 5 rules applied. Total rules applied 2634 place count 758 transition count 1317
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2639 place count 758 transition count 1312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2644 place count 753 transition count 1312
Applied a total of 2644 rules in 737 ms. Remains 753 /2121 variables (removed 1368) and now considering 1312/2578 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 737 ms. Remains : 753/2121 places, 1312/2578 transitions.
RANDOM walk for 40000 steps (480 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (87 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271865 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271865 steps, saw 57856 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
// Phase 1: matrix 1312 rows 753 cols
[2024-05-21 09:22:38] [INFO ] Computed 129 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/123 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 198/321 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 80/401 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/405 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 268/673 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/680 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/680 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/749 variables, 19/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/749 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/753 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/753 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1312/2065 variables, 753/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2065 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2065 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2065/2065 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 753/753 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/123 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 198/321 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 80/401 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/405 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 268/673 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/680 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/680 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/749 variables, 19/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/749 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/753 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/753 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1312/2065 variables, 753/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2065 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2065 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2065 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2065/2065 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1970ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 24 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 753/753 places, 1312/1312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 23 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
[2024-05-21 09:22:40] [INFO ] Invariant cache hit.
[2024-05-21 09:22:42] [INFO ] Implicit Places using invariants in 1180 ms returned [1, 18, 19, 31, 49, 67, 136, 140, 149, 150, 152, 169, 187, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 632, 636, 637, 640, 651, 652, 653, 671, 692, 693, 694, 695]
[2024-05-21 09:22:42] [INFO ] Actually due to overlaps returned [671, 653, 49, 169, 293, 416, 539, 31, 152, 276, 399, 522, 149, 273, 396, 519, 651, 692, 150, 274, 397, 520, 652, 693, 1, 18, 261, 262, 384, 385, 507, 508, 636, 637, 67, 187, 311, 434, 557, 694, 19, 640, 695]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1183 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 710/753 places, 1312/1312 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 705 transition count 1220
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 613 transition count 1214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 612 transition count 1214
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 196 place count 612 transition count 1188
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 249 place count 585 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 261 place count 581 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 269 place count 573 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 272 place count 570 transition count 1177
Iterating global reduction 5 with 3 rules applied. Total rules applied 275 place count 570 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 278 place count 570 transition count 1174
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 352 place count 533 transition count 1137
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 357 place count 528 transition count 1132
Iterating global reduction 6 with 5 rules applied. Total rules applied 362 place count 528 transition count 1132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 367 place count 528 transition count 1127
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 371 place count 526 transition count 1128
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 381 place count 526 transition count 1118
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 392 place count 515 transition count 1118
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 407 place count 515 transition count 1118
Applied a total of 407 rules in 205 ms. Remains 515 /710 variables (removed 195) and now considering 1118/1312 (removed 194) transitions.
// Phase 1: matrix 1118 rows 515 cols
[2024-05-21 09:22:42] [INFO ] Computed 75 invariants in 16 ms
[2024-05-21 09:22:43] [INFO ] Implicit Places using invariants in 1126 ms returned [74, 90, 96, 99, 101, 102, 105, 106, 160, 176, 182, 185, 187, 192, 193, 246, 262, 268, 271, 273, 278, 279, 332, 348, 354, 357, 359, 364, 365, 418, 434, 440, 443]
[2024-05-21 09:22:43] [INFO ] Actually due to overlaps returned [105, 192, 278, 364, 106, 193, 279, 365, 90, 96, 101, 176, 182, 187, 262, 268, 273, 348, 354, 359, 434, 440, 74, 102, 160, 246, 332, 418, 443]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1129 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 486/753 places, 1118/1312 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 468 transition count 1100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 468 transition count 1100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 463 transition count 1095
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 463 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 66 place count 453 transition count 1085
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 453 transition count 1071
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 94 place count 439 transition count 1071
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 439 transition count 1066
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 104 place count 434 transition count 1066
Applied a total of 104 rules in 137 ms. Remains 434 /486 variables (removed 52) and now considering 1066/1118 (removed 52) transitions.
// Phase 1: matrix 1066 rows 434 cols
[2024-05-21 09:22:43] [INFO ] Computed 46 invariants in 15 ms
[2024-05-21 09:22:44] [INFO ] Implicit Places using invariants in 843 ms returned []
[2024-05-21 09:22:44] [INFO ] Invariant cache hit.
[2024-05-21 09:22:45] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 434/753 places, 1066/1312 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5013 ms. Remains : 434/753 places, 1066/1312 transitions.
RANDOM walk for 40000 steps (685 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (142 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 362910 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 362910 steps, saw 85437 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2024-05-21 09:22:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 218/291 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/317 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 102/419 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/423 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/434 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1066/1500 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1500 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1500 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1500/1500 variables, and 480 constraints, problems are : Problem set: 0 solved, 1 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 434/434 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/57 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/73 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 218/291 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/317 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/317 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 102/419 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/423 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/434 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/434 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1066/1500 variables, 434/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1500 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1500 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1500 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1500/1500 variables, and 481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1502ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1066/1066 transitions.
Applied a total of 0 rules in 25 ms. Remains 434 /434 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 434/434 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1066/1066 transitions.
Applied a total of 0 rules in 25 ms. Remains 434 /434 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-05-21 09:22:50] [INFO ] Invariant cache hit.
[2024-05-21 09:22:51] [INFO ] Implicit Places using invariants in 855 ms returned []
[2024-05-21 09:22:51] [INFO ] Invariant cache hit.
[2024-05-21 09:22:53] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
[2024-05-21 09:22:53] [INFO ] Redundant transitions in 33 ms returned []
Running 1037 sub problems to find dead transitions.
[2024-05-21 09:22:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/1500 variables, and 42 constraints, problems are : Problem set: 0 solved, 1037 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/434 constraints, PredecessorRefiner: 1037/1037 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1037 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/433 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
[2024-05-21 09:23:42] [INFO ] Deduced a trap composed of 41 places in 402 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/1500 variables, and 43 constraints, problems are : Problem set: 0 solved, 1037 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/12 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/434 constraints, PredecessorRefiner: 0/1037 constraints, Known Traps: 1/1 constraints]
After SMT, in 61018ms problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 61039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63947 ms. Remains : 434/434 places, 1066/1066 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 26 ms. Remains 434 /434 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 09:23:54] [INFO ] Invariant cache hit.
[2024-05-21 09:23:54] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 09:23:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-21 09:23:54] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2024-05-21 09:23:55] [INFO ] After 545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 09:23:55] [INFO ] After 612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 09:23:55] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1012 ms.
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 187 reset in 456 ms.
Product exploration explored 100000 steps with 196 reset in 496 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Performed 376 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 376 rules applied. Total rules applied 376 place count 2121 transition count 2578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 377 place count 2121 transition count 2577
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 389 Pre rules applied. Total rules applied 377 place count 2121 transition count 2674
Deduced a syphon composed of 765 places in 6 ms
Iterating global reduction 2 with 389 rules applied. Total rules applied 766 place count 2121 transition count 2674
Discarding 207 places :
Symmetric choice reduction at 2 with 207 rule applications. Total rules 973 place count 1914 transition count 2467
Deduced a syphon composed of 558 places in 6 ms
Iterating global reduction 2 with 207 rules applied. Total rules applied 1180 place count 1914 transition count 2467
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1180 place count 1914 transition count 2472
Deduced a syphon composed of 563 places in 5 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1185 place count 1914 transition count 2472
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 926 places in 4 ms
Iterating global reduction 2 with 363 rules applied. Total rules applied 1548 place count 1914 transition count 2473
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 1692 place count 1770 transition count 2327
Deduced a syphon composed of 786 places in 4 ms
Iterating global reduction 2 with 144 rules applied. Total rules applied 1836 place count 1770 transition count 2327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1838 place count 1768 transition count 2324
Deduced a syphon composed of 786 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1840 place count 1768 transition count 2324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1842 place count 1768 transition count 2322
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 817 places in 4 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1873 place count 1768 transition count 2429
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1882 place count 1759 transition count 2409
Deduced a syphon composed of 808 places in 4 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1891 place count 1759 transition count 2409
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 809 places in 5 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1892 place count 1759 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1893 place count 1758 transition count 2409
Deduced a syphon composed of 808 places in 4 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1894 place count 1758 transition count 2409
Deduced a syphon composed of 808 places in 4 ms
Applied a total of 1894 rules in 1427 ms. Remains 1758 /2121 variables (removed 363) and now considering 2409/2578 (removed 169) transitions.
[2024-05-21 09:23:59] [INFO ] Redundant transitions in 71 ms returned []
Running 2408 sub problems to find dead transitions.
// Phase 1: matrix 2409 rows 1758 cols
[2024-05-21 09:23:59] [INFO ] Computed 227 invariants in 43 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1757 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1757/4167 variables, and 158 constraints, problems are : Problem set: 0 solved, 2408 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, Generalized P Invariants (flows): 158/175 constraints, State Equation: 0/1758 constraints, PredecessorRefiner: 2408/2408 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1757 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2408 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 Int declared 1757/4167 variables, and 158 constraints, problems are : Problem set: 0 solved, 2408 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, Generalized P Invariants (flows): 158/175 constraints, State Equation: 0/1758 constraints, PredecessorRefiner: 0/2408 constraints, Known Traps: 0/0 constraints]
After SMT, in 61974ms problems are : Problem set: 0 solved, 2408 unsolved
Search for dead transitions found 0 dead transitions in 62004ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1758/2121 places, 2409/2578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63554 ms. Remains : 1758/2121 places, 2409/2578 transitions.
Built C files in :
/tmp/ltsmin17324052228324305633
[2024-05-21 09:25:01] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17324052228324305633
Running compilation step : cd /tmp/ltsmin17324052228324305633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17324052228324305633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17324052228324305633;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 127 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:25:04] [INFO ] Computed 227 invariants in 32 ms
[2024-05-21 09:25:06] [INFO ] Implicit Places using invariants in 1843 ms returned []
[2024-05-21 09:25:06] [INFO ] Invariant cache hit.
[2024-05-21 09:25:24] [INFO ] Implicit Places using invariants and state equation in 17954 ms returned []
Implicit Place search using SMT with State Equation took 19800 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-05-21 09:25:24] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 13.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 3.0)
(s49 1.0)
(s50 6.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 22.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 6.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 5.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 2.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 11.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 0.0)
(s251 1.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 0.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 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.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 0.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 0.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 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 4.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 0.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 17.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 17.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 14.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 4.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 81.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 0.0)
(s506 1.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.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 23.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 0.0)
(s571 0.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 4.0)
(s621 1.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 9.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 0.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 9.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 0.0)
(s699 1.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 4.0)
(s721 0.0)
(s722 0.0)
(s723 1.0)
(s724 1.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 13.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 13.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 10.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 107.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 0.0)
(s812 1.0)
(s813 5.0)
(s814 0.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 0.0)
(s827 0.0)
(s828 1.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 1.0)
(s834 0.0)
(s835 0.0)
(s836 1.0)
(s837 1.0)
(s838 0.0)
(s839 0.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 0.0)
(s847 1.0)
(s848 1.0)
(s849 0.0)
(s850 1.0)
(s851 1.0)
(s852 0.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 1.0)
(s863 1.0)
(s864 0.0)
(s865 1.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 16.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 0.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 0.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 10.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 0.0)
(s1037 1.0)
(s1038 0.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 7.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 0.0)
(s1071 1.0)
(s1072 1.0)
(s1073 0.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 4.0)
(s1080 1.0)
(s1081 0.0)
(s1082 1.0)
(s1083 1.0)
(s1084 0.0)
(s1085 0.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 9.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 9.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 6.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 4.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 28.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 0.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 0.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 0.0)
(s1189 0.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 0.0)
(s1195 1.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 5.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 0.0)
(s1328 1.0)
(s1329 1.0)
(s1330 0.0)
(s1331 0.0)
(s1332 1.0)
(s1333 1.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 1.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 1.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 0.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 0.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 0.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 0.0)
(s1370 1.0)
(s1371 0.0)
(s1372 0.0)
(s1373 1.0)
(s1374 0.0)
(s1375 1.0)
(s1376 0.0)
(s1377 1.0)
(s1378 1.0)
(s1379 0.0)
(s1380 1.0)
(s1381 0.0)
(s1382 0.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 0.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 0.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 0.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 0.0)
(s1409 1.0)
(s1410 0.0)
(s1411 1.0)
(s1412 0.0)
(s1413 1.0)
(s1414 0.0)
(s1415 0.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 0.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 0.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 0.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 0.0)
(s1441 4.0)
(s1442 0.0)
(s1443 1.0)
(s1444 0.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 23.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 5.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 5.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 2.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 4.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 93.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 0.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 0.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 0.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 0.0)
(s1540 0.0)
(s1541 1.0)
(s1542 1.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 1.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 1.0)
(s1551 0.0)
(s1552 1.0)
(s1553 0.0)
(s1554 1.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 23.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 0.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 0.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 10.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 0.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 0.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 7.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 0.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 0.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 4.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 4.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 81.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 0.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 0.0)
(s1888 1.0)
(s1889 1.0)
(s1890 0.0)
(s1891 1.0)
(s1892 1.0)
(s1893 0.0)
(s1894 0.0)
(s1895 1.0)
(s1896 0.0)
(s1897 0.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 0.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 4.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 7.0)
(s1947 1.0)
(s1948 6.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 13.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61315ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61346ms
Finished structural reductions in LTL mode , in 1 iterations and 81278 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Built C files in :
/tmp/ltsmin3611012347586336096
[2024-05-21 09:26:25] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3611012347586336096
Running compilation step : cd /tmp/ltsmin3611012347586336096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3611012347586336096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3611012347586336096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 09:26:29] [INFO ] Flatten gal took : 189 ms
[2024-05-21 09:26:29] [INFO ] Flatten gal took : 160 ms
[2024-05-21 09:26:29] [INFO ] Time to serialize gal into /tmp/LTL17313270515728023183.gal : 55 ms
[2024-05-21 09:26:29] [INFO ] Time to serialize properties into /tmp/LTL12782475802863524544.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17313270515728023183.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4794269689650836731.hoa' '-atoms' '/tmp/LTL12782475802863524544.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12782475802863524544.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4794269689650836731.hoa
Detected timeout of ITS tools.
[2024-05-21 09:26:44] [INFO ] Flatten gal took : 94 ms
[2024-05-21 09:26:44] [INFO ] Flatten gal took : 89 ms
[2024-05-21 09:26:44] [INFO ] Time to serialize gal into /tmp/LTL7256362094349520742.gal : 33 ms
[2024-05-21 09:26:44] [INFO ] Time to serialize properties into /tmp/LTL12244604959999278454.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7256362094349520742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12244604959999278454.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(("((p1813==0)&&(p2163==0))")&&(G("((((p1954==0)||(p1958==0))||((p1962==0)||(p117==0)))||(p572==0))"))))))
Formula 0 simplified : XX(!"((p1813==0)&&(p2163==0))" | F!"((((p1954==0)||(p1958==0))||((p1962==0)||(p117==0)))||(p572==0))")
Detected timeout of ITS tools.
[2024-05-21 09:26:59] [INFO ] Flatten gal took : 82 ms
[2024-05-21 09:26:59] [INFO ] Applying decomposition
[2024-05-21 09:27:00] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9480763081819278320.txt' '-o' '/tmp/graph9480763081819278320.bin' '-w' '/tmp/graph9480763081819278320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9480763081819278320.bin' '-l' '-1' '-v' '-w' '/tmp/graph9480763081819278320.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:27:00] [INFO ] Decomposing Gal with order
[2024-05-21 09:27:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:27:01] [INFO ] Removed a total of 1923 redundant transitions.
[2024-05-21 09:27:01] [INFO ] Flatten gal took : 322 ms
[2024-05-21 09:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 43 ms.
[2024-05-21 09:27:01] [INFO ] Time to serialize gal into /tmp/LTL5757715317918721989.gal : 36 ms
[2024-05-21 09:27:01] [INFO ] Time to serialize properties into /tmp/LTL9272300421346077233.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5757715317918721989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9272300421346077233.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(("((i24.u624.p1813==0)&&(i27.u745.p2163==0))")&&(G("((((i25.u682.p1954==0)||(i25.u685.p1958==0))||((i25.u687.p1962==0)||(i2.u38...193
Formula 0 simplified : XX(!"((i24.u624.p1813==0)&&(i27.u745.p2163==0))" | F!"((((i25.u682.p1954==0)||(i25.u685.p1958==0))||((i25.u687.p1962==0)||(i2.u38.p1...185
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-09 finished in 549924 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)) U G(p1)))'
Support contains 5 out of 2155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 2154 transition count 2322
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 398 rules applied. Total rules applied 793 place count 1759 transition count 2319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 795 place count 1757 transition count 2319
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 580 Pre rules applied. Total rules applied 795 place count 1757 transition count 1739
Deduced a syphon composed of 580 places in 7 ms
Ensure Unique test removed 53 places
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 3 with 1213 rules applied. Total rules applied 2008 place count 1124 transition count 1739
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 38 rules applied. Total rules applied 2046 place count 1119 transition count 1706
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 2079 place count 1086 transition count 1706
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2079 place count 1086 transition count 1685
Deduced a syphon composed of 21 places in 6 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2142 place count 1044 transition count 1685
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2142 place count 1044 transition count 1665
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2182 place count 1024 transition count 1665
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2185 place count 1021 transition count 1655
Iterating global reduction 5 with 3 rules applied. Total rules applied 2188 place count 1021 transition count 1655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2188 place count 1021 transition count 1654
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2190 place count 1020 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2192 place count 1018 transition count 1645
Iterating global reduction 5 with 2 rules applied. Total rules applied 2194 place count 1018 transition count 1645
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2196 place count 1016 transition count 1636
Iterating global reduction 5 with 2 rules applied. Total rules applied 2198 place count 1016 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2199 place count 1015 transition count 1628
Iterating global reduction 5 with 1 rules applied. Total rules applied 2200 place count 1015 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2201 place count 1014 transition count 1620
Iterating global reduction 5 with 1 rules applied. Total rules applied 2202 place count 1014 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2203 place count 1013 transition count 1612
Iterating global reduction 5 with 1 rules applied. Total rules applied 2204 place count 1013 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2205 place count 1012 transition count 1604
Iterating global reduction 5 with 1 rules applied. Total rules applied 2206 place count 1012 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2207 place count 1011 transition count 1596
Iterating global reduction 5 with 1 rules applied. Total rules applied 2208 place count 1011 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2209 place count 1010 transition count 1588
Iterating global reduction 5 with 1 rules applied. Total rules applied 2210 place count 1010 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2211 place count 1009 transition count 1580
Iterating global reduction 5 with 1 rules applied. Total rules applied 2212 place count 1009 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2213 place count 1008 transition count 1572
Iterating global reduction 5 with 1 rules applied. Total rules applied 2214 place count 1008 transition count 1572
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2215 place count 1007 transition count 1564
Iterating global reduction 5 with 1 rules applied. Total rules applied 2216 place count 1007 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2217 place count 1006 transition count 1556
Iterating global reduction 5 with 1 rules applied. Total rules applied 2218 place count 1006 transition count 1556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2219 place count 1005 transition count 1548
Iterating global reduction 5 with 1 rules applied. Total rules applied 2220 place count 1005 transition count 1548
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2221 place count 1004 transition count 1540
Iterating global reduction 5 with 1 rules applied. Total rules applied 2222 place count 1004 transition count 1540
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 5 with 334 rules applied. Total rules applied 2556 place count 836 transition count 1374
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2560 place count 832 transition count 1370
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2565 place count 831 transition count 1370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2565 place count 831 transition count 1369
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2567 place count 830 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2568 place count 829 transition count 1368
Iterating global reduction 5 with 1 rules applied. Total rules applied 2569 place count 829 transition count 1368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2571 place count 829 transition count 1366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2572 place count 828 transition count 1366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2574 place count 827 transition count 1372
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2576 place count 825 transition count 1370
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 13 rules applied. Total rules applied 2589 place count 816 transition count 1366
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2593 place count 812 transition count 1366
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 2593 place count 812 transition count 1352
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 29 rules applied. Total rules applied 2622 place count 797 transition count 1352
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 9 with 10 rules applied. Total rules applied 2632 place count 787 transition count 1352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2632 place count 787 transition count 1351
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2634 place count 786 transition count 1351
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 2664 place count 771 transition count 1336
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 2673 place count 762 transition count 1327
Iterating global reduction 10 with 9 rules applied. Total rules applied 2682 place count 762 transition count 1327
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2687 place count 757 transition count 1322
Iterating global reduction 10 with 5 rules applied. Total rules applied 2692 place count 757 transition count 1322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2697 place count 757 transition count 1317
Applied a total of 2697 rules in 1167 ms. Remains 757 /2155 variables (removed 1398) and now considering 1317/2718 (removed 1401) transitions.
// Phase 1: matrix 1317 rows 757 cols
[2024-05-21 09:27:17] [INFO ] Computed 125 invariants in 16 ms
[2024-05-21 09:27:18] [INFO ] Implicit Places using invariants in 878 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 273, 290, 308, 328, 381, 394, 395, 397, 414, 432, 453, 511, 512, 524, 525, 526, 527, 529, 546, 564, 584, 635, 636, 639, 650, 651, 652, 670, 692, 693, 694, 695]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 882 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 707/2155 places, 1317/2718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 707 transition count 1229
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 619 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 618 transition count 1228
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 178 place count 618 transition count 1200
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 235 place count 589 transition count 1200
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 247 place count 585 transition count 1192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 255 place count 577 transition count 1192
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 258 place count 574 transition count 1189
Iterating global reduction 5 with 3 rules applied. Total rules applied 261 place count 574 transition count 1189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 264 place count 574 transition count 1186
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 346 place count 533 transition count 1145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 350 place count 531 transition count 1145
Applied a total of 350 rules in 97 ms. Remains 531 /707 variables (removed 176) and now considering 1145/1317 (removed 172) transitions.
// Phase 1: matrix 1145 rows 531 cols
[2024-05-21 09:27:18] [INFO ] Computed 70 invariants in 15 ms
[2024-05-21 09:27:19] [INFO ] Implicit Places using invariants in 623 ms returned [88, 94, 99, 174, 180, 185, 266, 272, 277, 357, 363, 368, 449, 455, 460, 528]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 627 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 515/2155 places, 1145/2718 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 1144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 504 transition count 1134
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 504 transition count 1134
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 494 transition count 1124
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 494 transition count 1124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 489 transition count 1119
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 489 transition count 1119
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 484 transition count 1114
Applied a total of 62 rules in 103 ms. Remains 484 /515 variables (removed 31) and now considering 1114/1145 (removed 31) transitions.
// Phase 1: matrix 1114 rows 484 cols
[2024-05-21 09:27:19] [INFO ] Computed 54 invariants in 15 ms
[2024-05-21 09:27:20] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-21 09:27:20] [INFO ] Invariant cache hit.
[2024-05-21 09:27:21] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 484/2155 places, 1114/2718 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5478 ms. Remains : 484/2155 places, 1114/2718 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-11
Product exploration explored 100000 steps with 1409 reset in 624 ms.
Product exploration explored 100000 steps with 1395 reset in 532 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 162 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), p0, (AND p0 p1)]
RANDOM walk for 13471 steps (147 resets) in 109 ms. (122 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 417 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), p0, (AND p0 p1)]
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 1114/1114 transitions.
Applied a total of 0 rules in 25 ms. Remains 484 /484 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2024-05-21 09:27:24] [INFO ] Invariant cache hit.
[2024-05-21 09:27:25] [INFO ] Implicit Places using invariants in 914 ms returned []
[2024-05-21 09:27:25] [INFO ] Invariant cache hit.
[2024-05-21 09:27:26] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
[2024-05-21 09:27:26] [INFO ] Redundant transitions in 14 ms returned []
Running 1079 sub problems to find dead transitions.
[2024-05-21 09:27:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 3 (OVERLAPS) 3/481 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
SMT process timed out in 31101ms, After SMT, problems are : Problem set: 0 solved, 1079 unsolved
Search for dead transitions found 0 dead transitions in 31114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33575 ms. Remains : 484/484 places, 1114/1114 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 244 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), p0, (AND p0 p1)]
RANDOM walk for 16323 steps (196 resets) in 103 ms. (156 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 395 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 1401 reset in 424 ms.
Product exploration explored 100000 steps with 1414 reset in 337 ms.
Built C files in :
/tmp/ltsmin13201713214802217780
[2024-05-21 09:28:00] [INFO ] Computing symmetric may disable matrix : 1114 transitions.
[2024-05-21 09:28:00] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:28:00] [INFO ] Computing symmetric may enable matrix : 1114 transitions.
[2024-05-21 09:28:00] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:28:00] [INFO ] Computing Do-Not-Accords matrix : 1114 transitions.
[2024-05-21 09:28:00] [INFO ] Computation of Completed DNA matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:28:00] [INFO ] Built C files in 292ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13201713214802217780
Running compilation step : cd /tmp/ltsmin13201713214802217780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13201713214802217780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13201713214802217780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 1114/1114 transitions.
Applied a total of 0 rules in 16 ms. Remains 484 /484 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2024-05-21 09:28:03] [INFO ] Invariant cache hit.
[2024-05-21 09:28:04] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-21 09:28:04] [INFO ] Invariant cache hit.
[2024-05-21 09:28:06] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 2843 ms to find 0 implicit places.
[2024-05-21 09:28:06] [INFO ] Redundant transitions in 24 ms returned []
Running 1079 sub problems to find dead transitions.
[2024-05-21 09:28:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1598 variables, and 33 constraints, problems are : Problem set: 0 solved, 1079 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/11 constraints, Generalized P Invariants (flows): 29/43 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 1079/1079 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1079 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 3 (OVERLAPS) 3/481 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1079 unsolved
[2024-05-21 09:29:01] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/1598 variables, and 44 constraints, problems are : Problem set: 0 solved, 1079 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 32/43 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 0/1079 constraints, Known Traps: 1/1 constraints]
After SMT, in 60921ms problems are : Problem set: 0 solved, 1079 unsolved
Search for dead transitions found 0 dead transitions in 60942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63835 ms. Remains : 484/484 places, 1114/1114 transitions.
Built C files in :
/tmp/ltsmin6485157705710448040
[2024-05-21 09:29:07] [INFO ] Computing symmetric may disable matrix : 1114 transitions.
[2024-05-21 09:29:07] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:29:07] [INFO ] Computing symmetric may enable matrix : 1114 transitions.
[2024-05-21 09:29:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:29:07] [INFO ] Computing Do-Not-Accords matrix : 1114 transitions.
[2024-05-21 09:29:07] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 09:29:07] [INFO ] Built C files in 411ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6485157705710448040
Running compilation step : cd /tmp/ltsmin6485157705710448040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6485157705710448040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6485157705710448040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 09:29:11] [INFO ] Flatten gal took : 42 ms
[2024-05-21 09:29:11] [INFO ] Flatten gal took : 69 ms
[2024-05-21 09:29:11] [INFO ] Time to serialize gal into /tmp/LTL15903355716823604349.gal : 7 ms
[2024-05-21 09:29:11] [INFO ] Time to serialize properties into /tmp/LTL17843995155490267010.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15903355716823604349.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16175834071712211352.hoa' '-atoms' '/tmp/LTL17843995155490267010.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17843995155490267010.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16175834071712211352.hoa
Detected timeout of ITS tools.
[2024-05-21 09:29:26] [INFO ] Flatten gal took : 39 ms
[2024-05-21 09:29:26] [INFO ] Flatten gal took : 39 ms
[2024-05-21 09:29:26] [INFO ] Time to serialize gal into /tmp/LTL1453974033369525535.gal : 7 ms
[2024-05-21 09:29:26] [INFO ] Time to serialize properties into /tmp/LTL11962726092535835857.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1453974033369525535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11962726092535835857.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("(((p1213==1)&&(p1217==1))||((p2124==1)&&(p2345==1)))"))))U(G("(p1575!=1)"))))
Formula 0 simplified : FG"(((p1213==1)&&(p1217==1))||((p2124==1)&&(p2345==1)))" R F!"(p1575!=1)"
Detected timeout of ITS tools.
[2024-05-21 09:29:41] [INFO ] Flatten gal took : 38 ms
[2024-05-21 09:29:41] [INFO ] Applying decomposition
[2024-05-21 09:29:41] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11739325144055588508.txt' '-o' '/tmp/graph11739325144055588508.bin' '-w' '/tmp/graph11739325144055588508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11739325144055588508.bin' '-l' '-1' '-v' '-w' '/tmp/graph11739325144055588508.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:29:41] [INFO ] Decomposing Gal with order
[2024-05-21 09:29:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:29:41] [INFO ] Removed a total of 2181 redundant transitions.
[2024-05-21 09:29:41] [INFO ] Flatten gal took : 74 ms
[2024-05-21 09:29:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 47 ms.
[2024-05-21 09:29:41] [INFO ] Time to serialize gal into /tmp/LTL13800561623468949420.gal : 17 ms
[2024-05-21 09:29:41] [INFO ] Time to serialize properties into /tmp/LTL1876685394184142323.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13800561623468949420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1876685394184142323.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("(((i3.u62.p1213==1)&&(i6.u63.p1217==1))||((i10.u110.p2124==1)&&(i10.u119.p2345==1)))"))))U(G("(i8.u81.p1575!=1)"))))
Formula 0 simplified : FG"(((i3.u62.p1213==1)&&(i6.u63.p1217==1))||((i10.u110.p2124==1)&&(i10.u119.p2345==1)))" R F!"(i8.u81.p1575!=1)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-11 finished in 160249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(((p0 U p1)&&p2))) U p0))'
Support contains 4 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 2140 transition count 2681
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2140 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 2138 transition count 2672
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 2121 transition count 2578
Applied a total of 69 rules in 3023 ms. Remains 2121 /2155 variables (removed 34) and now considering 2578/2718 (removed 140) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:29:59] [INFO ] Computed 227 invariants in 49 ms
[2024-05-21 09:30:01] [INFO ] Implicit Places using invariants in 1655 ms returned []
[2024-05-21 09:30:01] [INFO ] Invariant cache hit.
[2024-05-21 09:30:18] [INFO ] Implicit Places using invariants and state equation in 16772 ms returned []
Implicit Place search using SMT with State Equation took 18432 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-05-21 09:30:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 13.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 3.0)
(s49 1.0)
(s50 6.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 22.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 6.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 timeout
1.0)
(s112 0.0)
(s113 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61184ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61215ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2155 places, 2578/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82676 ms. Remains : 2121/2155 places, 2578/2718 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 25014 reset in 438 ms.
Product exploration explored 100000 steps with 24976 reset in 452 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
RANDOM walk for 40000 steps (76 resets) in 503 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 766 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 655 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 656 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 684 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 424 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 437 ms. (91 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 118244 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 6
Probabilistic random walk after 118244 steps, saw 24133 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-21 09:31:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/154 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 425/579 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1483/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 09:31:27] [INFO ] Deduced a trap composed of 44 places in 1019 ms of which 10 ms to minimize.
[2024-05-21 09:31:28] [INFO ] Deduced a trap composed of 88 places in 981 ms of which 10 ms to minimize.
[2024-05-21 09:31:29] [INFO ] Deduced a trap composed of 69 places in 1177 ms of which 14 ms to minimize.
[2024-05-21 09:31:30] [INFO ] Deduced a trap composed of 43 places in 826 ms of which 12 ms to minimize.
SMT process timed out in 5113ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 782 place count 1731 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 783 place count 1730 transition count 1613
Deduced a syphon composed of 573 places in 3 ms
Ensure Unique test removed 53 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1199 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 6 with 344 rules applied. Total rules applied 2497 place count 833 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2501 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2506 place count 828 transition count 1365
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2507 place count 828 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2508 place count 827 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2508 place count 827 transition count 1363
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2510 place count 826 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2512 place count 824 transition count 1361
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2516 place count 824 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2517 place count 823 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2519 place count 822 transition count 1364
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2525 place count 822 transition count 1358
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2531 place count 816 transition count 1358
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2535 place count 816 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2539 place count 812 transition count 1354
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2544 place count 812 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2545 place count 811 transition count 1353
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2560 place count 801 transition count 1348
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2565 place count 796 transition count 1348
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2565 place count 796 transition count 1333
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2596 place count 780 transition count 1333
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2602 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2604 place count 773 transition count 1332
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2626 place count 762 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2631 place count 757 transition count 1316
Iterating global reduction 15 with 5 rules applied. Total rules applied 2636 place count 757 transition count 1316
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2641 place count 757 transition count 1311
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2646 place count 752 transition count 1311
Applied a total of 2646 rules in 682 ms. Remains 752 /2121 variables (removed 1369) and now considering 1311/2578 (removed 1267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 682 ms. Remains : 752/2121 places, 1311/2578 transitions.
RANDOM walk for 40000 steps (493 resets) in 2736 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 390 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (86 resets) in 332 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (76 resets) in 801 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (86 resets) in 622 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 508 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (88 resets) in 587 ms. (68 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 191891 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 6
Probabilistic random walk after 191891 steps, saw 42657 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1311 rows 752 cols
[2024-05-21 09:31:36] [INFO ] Computed 129 invariants in 25 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 881 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3434 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 6/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 887 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3488 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 6956ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 16505 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 29 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 752/752 places, 1311/1311 transitions.
RANDOM walk for 40000 steps (480 resets) in 2186 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (83 resets) in 416 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (83 resets) in 461 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 314 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (92 resets) in 354 ms. (112 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 130938 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 130938 steps, saw 29255 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-21 09:32:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 881 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:32:07] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 3 ms to minimize.
[2024-05-21 09:32:07] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2063 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3047 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 4920ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10152 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 45 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 752/752 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 37 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2024-05-21 09:32:18] [INFO ] Invariant cache hit.
[2024-05-21 09:32:20] [INFO ] Implicit Places using invariants in 1508 ms returned [1, 18, 19, 32, 68, 137, 141, 150, 151, 153, 170, 188, 224, 227, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693]
[2024-05-21 09:32:20] [INFO ] Actually due to overlaps returned [669, 651, 170, 297, 420, 543, 32, 153, 280, 403, 526, 150, 277, 400, 523, 649, 690, 151, 278, 401, 524, 650, 691, 1, 18, 265, 266, 388, 389, 511, 512, 634, 635, 68, 188, 315, 438, 561, 692, 19, 638, 693]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1512 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 710/752 places, 1311/1311 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 705 transition count 1223
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 617 transition count 1218
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 186 place count 617 transition count 1191
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 241 place count 589 transition count 1191
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 253 place count 585 transition count 1183
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 261 place count 577 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 574 transition count 1180
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 574 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 270 place count 574 transition count 1177
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 338 place count 540 transition count 1143
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 343 place count 535 transition count 1138
Iterating global reduction 5 with 5 rules applied. Total rules applied 348 place count 535 transition count 1138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 353 place count 535 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 533 transition count 1134
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 367 place count 533 transition count 1124
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 378 place count 522 transition count 1124
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 390 place count 522 transition count 1124
Applied a total of 390 rules in 195 ms. Remains 522 /710 variables (removed 188) and now considering 1124/1311 (removed 187) transitions.
// Phase 1: matrix 1124 rows 522 cols
[2024-05-21 09:32:20] [INFO ] Computed 76 invariants in 16 ms
[2024-05-21 09:32:21] [INFO ] Implicit Places using invariants in 927 ms returned [76, 96, 104, 110, 111, 114, 115, 168, 177, 180, 188, 194, 197, 199, 204, 205, 258, 274, 280, 283, 285, 290, 291, 344, 360, 366, 369, 371, 376, 377, 430, 446, 452, 455, 457]
[2024-05-21 09:32:21] [INFO ] Actually due to overlaps returned [114, 204, 290, 376, 115, 205, 291, 377, 188, 194, 199, 274, 280, 285, 360, 366, 371, 446, 452, 457, 76, 96, 104, 110, 111, 168, 177, 258, 344, 430]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 932 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 492/752 places, 1124/1311 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 474 transition count 1106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 474 transition count 1106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 468 transition count 1100
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 468 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 466 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 466 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 465 transition count 1097
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 465 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 464 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 464 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 76 place count 454 transition count 1086
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 91 place count 454 transition count 1071
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 106 place count 439 transition count 1071
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 439 transition count 1066
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 116 place count 434 transition count 1066
Applied a total of 116 rules in 181 ms. Remains 434 /492 variables (removed 58) and now considering 1066/1124 (removed 58) transitions.
// Phase 1: matrix 1066 rows 434 cols
[2024-05-21 09:32:21] [INFO ] Computed 46 invariants in 14 ms
[2024-05-21 09:32:22] [INFO ] Implicit Places using invariants in 665 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 667 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/752 places, 1066/1311 transitions.
Applied a total of 0 rules in 24 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3549 ms. Remains : 433/752 places, 1066/1311 transitions.
RANDOM walk for 40000 steps (724 resets) in 1716 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (155 resets) in 512 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (161 resets) in 543 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (166 resets) in 545 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (169 resets) in 583 ms. (68 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 152602 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 152602 steps, saw 48096 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 1066 rows 433 cols
[2024-05-21 09:32:26] [INFO ] Computed 45 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 220/266 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 46/312 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/433 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1066/1499 variables, 433/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1499/1499 variables, and 478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 220/266 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 46/312 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/433 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1066/1499 variables, 433/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1499 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:32:28] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1499 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1499/1499 variables, and 483 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2796ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4998 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 433/433 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 14 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-05-21 09:32:34] [INFO ] Invariant cache hit.
[2024-05-21 09:32:35] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-21 09:32:35] [INFO ] Invariant cache hit.
[2024-05-21 09:32:36] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 2178 ms to find 0 implicit places.
[2024-05-21 09:32:36] [INFO ] Redundant transitions in 18 ms returned []
Running 1037 sub problems to find dead transitions.
[2024-05-21 09:32:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30706ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30723ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32941 ms. Remains : 433/433 places, 1066/1066 transitions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:33:07] [INFO ] Computed 227 invariants in 30 ms
[2024-05-21 09:33:10] [INFO ] [Real]Absence check using 54 positive place invariants in 68 ms returned sat
[2024-05-21 09:33:11] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 1031 ms returned sat
[2024-05-21 09:33:22] [INFO ] [Real]Absence check using state equation in 11335 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 123 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
[2024-05-21 09:33:23] [INFO ] Invariant cache hit.
[2024-05-21 09:33:24] [INFO ] Implicit Places using invariants in 1668 ms returned []
[2024-05-21 09:33:24] [INFO ] Invariant cache hit.
[2024-05-21 09:33:40] [INFO ] Implicit Places using invariants and state equation in 15532 ms returned []
Implicit Place search using SMT with State Equation took 17203 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-05-21 09:33:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61226ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61260ms
Finished structural reductions in LTL mode , in 1 iterations and 78594 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
RANDOM walk for 40000 steps (78 resets) in 2867 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 349 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 403 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 444 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 379 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 108384 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 6
Probabilistic random walk after 108384 steps, saw 22588 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-21 09:34:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/154 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 425/579 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1483/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 09:34:48] [INFO ] Deduced a trap composed of 44 places in 1193 ms of which 11 ms to minimize.
[2024-05-21 09:34:49] [INFO ] Deduced a trap composed of 88 places in 912 ms of which 10 ms to minimize.
[2024-05-21 09:34:50] [INFO ] Deduced a trap composed of 69 places in 803 ms of which 9 ms to minimize.
[2024-05-21 09:34:51] [INFO ] Deduced a trap composed of 43 places in 627 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2062/4699 variables, and 223 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 165/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/154 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 425/579 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1483/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 09:34:53] [INFO ] Deduced a trap composed of 21 places in 1197 ms of which 13 ms to minimize.
[2024-05-21 09:34:54] [INFO ] Deduced a trap composed of 70 places in 1000 ms of which 12 ms to minimize.
[2024-05-21 09:34:55] [INFO ] Deduced a trap composed of 102 places in 1004 ms of which 11 ms to minimize.
[2024-05-21 09:34:56] [INFO ] Deduced a trap composed of 41 places in 1142 ms of which 10 ms to minimize.
SMT process timed out in 10360ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 782 place count 1731 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 783 place count 1730 transition count 1613
Deduced a syphon composed of 573 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1199 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 6 with 344 rules applied. Total rules applied 2497 place count 833 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2501 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2506 place count 828 transition count 1365
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2507 place count 828 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2508 place count 827 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2508 place count 827 transition count 1363
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2510 place count 826 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2512 place count 824 transition count 1361
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2516 place count 824 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2517 place count 823 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2519 place count 822 transition count 1364
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2525 place count 822 transition count 1358
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2531 place count 816 transition count 1358
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2535 place count 816 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2539 place count 812 transition count 1354
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2544 place count 812 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2545 place count 811 transition count 1353
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2560 place count 801 transition count 1348
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2565 place count 796 transition count 1348
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2565 place count 796 transition count 1333
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2596 place count 780 transition count 1333
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2602 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2604 place count 773 transition count 1332
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2626 place count 762 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2631 place count 757 transition count 1316
Iterating global reduction 15 with 5 rules applied. Total rules applied 2636 place count 757 transition count 1316
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2641 place count 757 transition count 1311
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2646 place count 752 transition count 1311
Applied a total of 2646 rules in 569 ms. Remains 752 /2121 variables (removed 1369) and now considering 1311/2578 (removed 1267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 752/2121 places, 1311/2578 transitions.
RANDOM walk for 40000 steps (488 resets) in 2286 ms. (17 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (86 resets) in 590 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (84 resets) in 600 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 484 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 559 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 516 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 528 ms. (75 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 156638 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 6
Probabilistic random walk after 156638 steps, saw 35137 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
// Phase 1: matrix 1311 rows 752 cols
[2024-05-21 09:35:01] [INFO ] Computed 129 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 881 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2506 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 6/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 887 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3523 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 6054ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 12401 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 38 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 752/752 places, 1311/1311 transitions.
RANDOM walk for 40000 steps (487 resets) in 1741 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (86 resets) in 381 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (88 resets) in 401 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (87 resets) in 506 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (88 resets) in 436 ms. (91 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 145951 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 145951 steps, saw 32966 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-21 09:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/2063 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 881 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 172/229 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 65/294 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/296 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 214/510 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 41/551 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 155/709 variables, 26/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/709 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/713 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/713 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 37/750 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/750 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/752 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/752 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1311/2063 variables, 752/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2063 variables, 4/885 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:35:28] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-21 09:35:28] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2063 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/2063 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 887 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2561 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 752/752 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 4274ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8620 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 23 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 752/752 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 22 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2024-05-21 09:35:37] [INFO ] Invariant cache hit.
[2024-05-21 09:35:38] [INFO ] Implicit Places using invariants in 1100 ms returned [1, 18, 19, 32, 68, 137, 141, 150, 151, 153, 170, 188, 224, 227, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693]
[2024-05-21 09:35:38] [INFO ] Actually due to overlaps returned [669, 651, 170, 297, 420, 543, 32, 153, 280, 403, 526, 150, 277, 400, 523, 649, 690, 151, 278, 401, 524, 650, 691, 1, 18, 265, 266, 388, 389, 511, 512, 634, 635, 68, 188, 315, 438, 561, 692, 19, 638, 693]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1105 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 710/752 places, 1311/1311 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 705 transition count 1223
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 617 transition count 1218
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 186 place count 617 transition count 1191
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 241 place count 589 transition count 1191
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 253 place count 585 transition count 1183
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 261 place count 577 transition count 1183
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 574 transition count 1180
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 574 transition count 1180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 270 place count 574 transition count 1177
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 338 place count 540 transition count 1143
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 343 place count 535 transition count 1138
Iterating global reduction 5 with 5 rules applied. Total rules applied 348 place count 535 transition count 1138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 353 place count 535 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 533 transition count 1134
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 367 place count 533 transition count 1124
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 378 place count 522 transition count 1124
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 390 place count 522 transition count 1124
Applied a total of 390 rules in 203 ms. Remains 522 /710 variables (removed 188) and now considering 1124/1311 (removed 187) transitions.
// Phase 1: matrix 1124 rows 522 cols
[2024-05-21 09:35:38] [INFO ] Computed 76 invariants in 9 ms
[2024-05-21 09:35:39] [INFO ] Implicit Places using invariants in 862 ms returned [76, 96, 104, 110, 111, 114, 115, 168, 177, 180, 188, 194, 197, 199, 204, 205, 258, 274, 280, 283, 285, 290, 291, 344, 360, 366, 369, 371, 376, 377, 430, 446, 452, 455, 457]
[2024-05-21 09:35:39] [INFO ] Actually due to overlaps returned [114, 204, 290, 376, 115, 205, 291, 377, 188, 194, 199, 274, 280, 285, 360, 366, 371, 446, 452, 457, 76, 96, 104, 110, 111, 168, 177, 258, 344, 430]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 875 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 492/752 places, 1124/1311 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 474 transition count 1106
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 474 transition count 1106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 468 transition count 1100
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 468 transition count 1100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 466 transition count 1098
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 466 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 465 transition count 1097
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 465 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 464 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 464 transition count 1096
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 76 place count 454 transition count 1086
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 91 place count 454 transition count 1071
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 106 place count 439 transition count 1071
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 439 transition count 1066
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 116 place count 434 transition count 1066
Applied a total of 116 rules in 198 ms. Remains 434 /492 variables (removed 58) and now considering 1066/1124 (removed 58) transitions.
// Phase 1: matrix 1066 rows 434 cols
[2024-05-21 09:35:39] [INFO ] Computed 46 invariants in 9 ms
[2024-05-21 09:35:40] [INFO ] Implicit Places using invariants in 613 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 615 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/752 places, 1066/1311 transitions.
Applied a total of 0 rules in 24 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3045 ms. Remains : 433/752 places, 1066/1311 transitions.
RANDOM walk for 40000 steps (727 resets) in 2152 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (162 resets) in 401 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (171 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (169 resets) in 402 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (168 resets) in 456 ms. (87 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 167906 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 4
Probabilistic random walk after 167906 steps, saw 51556 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 1066 rows 433 cols
[2024-05-21 09:35:44] [INFO ] Computed 45 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 220/266 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 46/312 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/433 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1066/1499 variables, 433/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1499 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1499/1499 variables, and 478 constraints, problems are : Problem set: 0 solved, 4 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 220/266 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 46/312 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 121/433 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1066/1499 variables, 433/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1499 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 09:35:46] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1499 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1499 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1499/1499 variables, and 483 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2374ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4720 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 433/433 places, 1066/1066 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1066/1066 transitions.
Applied a total of 0 rules in 16 ms. Remains 433 /433 variables (removed 0) and now considering 1066/1066 (removed 0) transitions.
[2024-05-21 09:35:51] [INFO ] Invariant cache hit.
[2024-05-21 09:35:52] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-21 09:35:52] [INFO ] Invariant cache hit.
[2024-05-21 09:35:53] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
[2024-05-21 09:35:53] [INFO ] Redundant transitions in 12 ms returned []
Running 1037 sub problems to find dead transitions.
[2024-05-21 09:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/431 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/431 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/431 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
At refinement iteration 3 (OVERLAPS) 2/433 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1037 unsolved
SMT process timed out in 30695ms, After SMT, problems are : Problem set: 0 solved, 1037 unsolved
Search for dead transitions found 0 dead transitions in 30708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32719 ms. Remains : 433/433 places, 1066/1066 transitions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:36:25] [INFO ] Computed 227 invariants in 30 ms
[2024-05-21 09:36:27] [INFO ] [Real]Absence check using 54 positive place invariants in 66 ms returned sat
[2024-05-21 09:36:29] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 1298 ms returned sat
[2024-05-21 09:36:40] [INFO ] [Real]Absence check using state equation in 11016 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Product exploration explored 100000 steps with 25014 reset in 401 ms.
Product exploration explored 100000 steps with 25000 reset in 401 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 2121 transition count 2578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 380 place count 2121 transition count 2577
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 387 Pre rules applied. Total rules applied 380 place count 2121 transition count 2674
Deduced a syphon composed of 766 places in 6 ms
Iterating global reduction 2 with 387 rules applied. Total rules applied 767 place count 2121 transition count 2674
Discarding 209 places :
Symmetric choice reduction at 2 with 209 rule applications. Total rules 976 place count 1912 transition count 2465
Deduced a syphon composed of 557 places in 6 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1185 place count 1912 transition count 2465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1185 place count 1912 transition count 2470
Deduced a syphon composed of 562 places in 5 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1190 place count 1912 transition count 2470
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 925 places in 6 ms
Iterating global reduction 2 with 363 rules applied. Total rules applied 1553 place count 1912 transition count 2471
Discarding 146 places :
Symmetric choice reduction at 2 with 146 rule applications. Total rules 1699 place count 1766 transition count 2323
Deduced a syphon composed of 783 places in 6 ms
Iterating global reduction 2 with 146 rules applied. Total rules applied 1845 place count 1766 transition count 2323
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1847 place count 1764 transition count 2320
Deduced a syphon composed of 783 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1849 place count 1764 transition count 2320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1851 place count 1764 transition count 2318
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 814 places in 6 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1882 place count 1764 transition count 2425
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1891 place count 1755 transition count 2405
Deduced a syphon composed of 805 places in 6 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1900 place count 1755 transition count 2405
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 806 places in 6 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1901 place count 1755 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1902 place count 1754 transition count 2405
Deduced a syphon composed of 805 places in 7 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1903 place count 1754 transition count 2405
Deduced a syphon composed of 805 places in 6 ms
Applied a total of 1903 rules in 1164 ms. Remains 1754 /2121 variables (removed 367) and now considering 2405/2578 (removed 173) transitions.
[2024-05-21 09:36:42] [INFO ] Redundant transitions in 85 ms returned []
Running 2404 sub problems to find dead transitions.
// Phase 1: matrix 2405 rows 1754 cols
[2024-05-21 09:36:42] [INFO ] Computed 227 invariants in 40 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1753 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 2404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1753/4159 variables, and 159 constraints, problems are : Problem set: 0 solved, 2404 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/51 constraints, Generalized P Invariants (flows): 159/176 constraints, State Equation: 0/1754 constraints, PredecessorRefiner: 2404/2404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1753 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 2404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1753/4159 variables, and 159 constraints, problems are : Problem set: 0 solved, 2404 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/51 constraints, Generalized P Invariants (flows): 159/176 constraints, State Equation: 0/1754 constraints, PredecessorRefiner: 0/2404 constraints, Known Traps: 0/0 constraints]
After SMT, in 61723ms problems are : Problem set: 0 solved, 2404 unsolved
Search for dead transitions found 0 dead transitions in 61752ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1754/2121 places, 2405/2578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63013 ms. Remains : 1754/2121 places, 2405/2578 transitions.
Built C files in :
/tmp/ltsmin10116333095162073139
[2024-05-21 09:37:44] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10116333095162073139
Running compilation step : cd /tmp/ltsmin10116333095162073139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10116333095162073139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10116333095162073139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 128 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-21 09:37:47] [INFO ] Computed 227 invariants in 30 ms
[2024-05-21 09:37:49] [INFO ] Implicit Places using invariants in 1542 ms returned []
[2024-05-21 09:37:49] [INFO ] Invariant cache hit.
[2024-05-21 09:38:04] [INFO ] Implicit Places using invariants and state equation in 15422 ms returned []
Implicit Place search using SMT with State Equation took 16966 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-05-21 09:38:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 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 Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61168ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61198ms
Finished structural reductions in LTL mode , in 1 iterations and 78297 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Built C files in :
/tmp/ltsmin18100459541544408409
[2024-05-21 09:39:05] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18100459541544408409
Running compilation step : cd /tmp/ltsmin18100459541544408409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18100459541544408409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18100459541544408409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 09:39:08] [INFO ] Flatten gal took : 65 ms
[2024-05-21 09:39:09] [INFO ] Flatten gal took : 69 ms
[2024-05-21 09:39:09] [INFO ] Time to serialize gal into /tmp/LTL11698818609729631906.gal : 18 ms
[2024-05-21 09:39:09] [INFO ] Time to serialize properties into /tmp/LTL4853799436145055957.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11698818609729631906.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1588124982981404778.hoa' '-atoms' '/tmp/LTL4853799436145055957.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4853799436145055957.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1588124982981404778.hoa
Detected timeout of ITS tools.
[2024-05-21 09:39:24] [INFO ] Flatten gal took : 66 ms
[2024-05-21 09:39:24] [INFO ] Flatten gal took : 68 ms
[2024-05-21 09:39:24] [INFO ] Time to serialize gal into /tmp/LTL5377998741701596629.gal : 11 ms
[2024-05-21 09:39:24] [INFO ] Time to serialize properties into /tmp/LTL4400329421445720011.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5377998741701596629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4400329421445720011.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((!(X(X((("(p658==1)")U("((p130==1)&&(p287==1))"))&&("(((p2206==1)&&(p658==1))||(p658!=1))")))))U("(p658==1)")))
Formula 0 simplified : !"(p658==1)" & X(!"(p658==1)" W X("(((p2206==1)&&(p658==1))||(p658!=1))" & ("(p658==1)" U "((p130==1)&&(p287==1))")))
Detected timeout of ITS tools.
[2024-05-21 09:39:39] [INFO ] Flatten gal took : 64 ms
[2024-05-21 09:39:39] [INFO ] Applying decomposition
[2024-05-21 09:39:39] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12971283827495232810.txt' '-o' '/tmp/graph12971283827495232810.bin' '-w' '/tmp/graph12971283827495232810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12971283827495232810.bin' '-l' '-1' '-v' '-w' '/tmp/graph12971283827495232810.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:39:39] [INFO ] Decomposing Gal with order
[2024-05-21 09:39:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:39:40] [INFO ] Removed a total of 1913 redundant transitions.
[2024-05-21 09:39:40] [INFO ] Flatten gal took : 124 ms
[2024-05-21 09:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 17 ms.
[2024-05-21 09:39:40] [INFO ] Time to serialize gal into /tmp/LTL9458106076877796675.gal : 27 ms
[2024-05-21 09:39:40] [INFO ] Time to serialize properties into /tmp/LTL1051900121372226999.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9458106076877796675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1051900121372226999.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((!(X(X((("(i6.i2.i1.u223.p658==1)")U("((i4.i0.i0.u50.p130==1)&&(i4.i0.i0.u94.p287==1))"))&&("(((i27.u758.p2206==1)&&(i6.i2.i1.u223....226
Formula 0 simplified : !"(i6.i2.i1.u223.p658==1)" & X(!"(i6.i2.i1.u223.p658==1)" W X("(((i27.u758.p2206==1)&&(i6.i2.i1.u223.p658==1))||(i6.i2.i1.u223.p658!...245
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05b-LTLFireability-15 finished in 598522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
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)) U 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(X(((p0 U p1)&&p2))) U p0))'
[2024-05-21 09:39:55] [INFO ] Flatten gal took : 64 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4289577612367494925
[2024-05-21 09:39:55] [INFO ] Too many transitions (2718) to apply POR reductions. Disabling POR matrices.
[2024-05-21 09:39:55] [INFO ] Applying decomposition
[2024-05-21 09:39:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4289577612367494925
Running compilation step : cd /tmp/ltsmin4289577612367494925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 09:39:55] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4518405847624399714.txt' '-o' '/tmp/graph4518405847624399714.bin' '-w' '/tmp/graph4518405847624399714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4518405847624399714.bin' '-l' '-1' '-v' '-w' '/tmp/graph4518405847624399714.weights' '-q' '0' '-e' '0.001'
[2024-05-21 09:39:56] [INFO ] Decomposing Gal with order
[2024-05-21 09:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 09:39:56] [INFO ] Removed a total of 2159 redundant transitions.
[2024-05-21 09:39:56] [INFO ] Flatten gal took : 121 ms
[2024-05-21 09:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 26 ms.
[2024-05-21 09:39:56] [INFO ] Time to serialize gal into /tmp/LTLFireability10794204203080394628.gal : 27 ms
[2024-05-21 09:39:56] [INFO ] Time to serialize properties into /tmp/LTLFireability5789777690550638600.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10794204203080394628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5789777690550638600.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(X(("((i24.u631.p1813==0)&&(i27.u760.p2163==0))")&&(G("((((i21.i4.i0.u689.p1954==0)||(i21.i4.i1.u692.p1958==0))||((i21.i4.i2.u693....211
Formula 0 simplified : XX(!"((i24.u631.p1813==0)&&(i27.u760.p2163==0))" | F!"((((i21.i4.i0.u689.p1954==0)||(i21.i4.i1.u692.p1958==0))||((i21.i4.i2.u693.p19...203
Compilation finished in 13503 ms.
Running link step : cd /tmp/ltsmin4289577612367494925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin4289577612367494925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin4289577612367494925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4289577612367494925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>(!(LTLAPp2==true))) U []((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin4289577612367494925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>(!(LTLAPp2==true))) U []((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4289577612367494925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!X(X((((LTLAPp4==true) U (LTLAPp5==true))&&(LTLAPp6==true)))) U (LTLAPp4==true))' '--buchi-type=spotba'
LTSmin run took 4513 ms.
FORMULA ASLink-PT-05b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin4289577612367494925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 10:09:36] [INFO ] Applying decomposition
[2024-05-21 10:09:36] [INFO ] Flatten gal took : 215 ms
[2024-05-21 10:09:37] [INFO ] Decomposing Gal with order
[2024-05-21 10:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 10:09:37] [INFO ] Removed a total of 1989 redundant transitions.
[2024-05-21 10:09:37] [INFO ] Flatten gal took : 376 ms
[2024-05-21 10:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2948 labels/synchronizations in 289 ms.
[2024-05-21 10:09:38] [INFO ] Time to serialize gal into /tmp/LTLFireability17721928062342150768.gal : 34 ms
[2024-05-21 10:09:38] [INFO ] Time to serialize properties into /tmp/LTLFireability7575204119162280310.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17721928062342150768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7575204119162280310.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(("((i0.i1.i0.i0.i0.i0.i0.i1.u211.p1813==0)&&(i1.i0.u253.p2163==0))")&&(G("((((i0.i1.i0.i0.i0.i0.i0.i1.i7.i0.u232.p1954==0)||(i0...355
Formula 0 simplified : XX(!"((i0.i1.i0.i0.i0.i0.i0.i1.u211.p1813==0)&&(i1.i0.u253.p2163==0))" | F!"((((i0.i1.i0.i0.i0.i0.i0.i1.i7.i0.u232.p1954==0)||(i0.i1...347

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620117800084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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