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-171620117700068.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-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 669K 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-04b-LTLFireability-00
FORMULA_NAME ASLink-PT-04b-LTLFireability-01
FORMULA_NAME ASLink-PT-04b-LTLFireability-02
FORMULA_NAME ASLink-PT-04b-LTLFireability-03
FORMULA_NAME ASLink-PT-04b-LTLFireability-04
FORMULA_NAME ASLink-PT-04b-LTLFireability-05
FORMULA_NAME ASLink-PT-04b-LTLFireability-06
FORMULA_NAME ASLink-PT-04b-LTLFireability-07
FORMULA_NAME ASLink-PT-04b-LTLFireability-08
FORMULA_NAME ASLink-PT-04b-LTLFireability-09
FORMULA_NAME ASLink-PT-04b-LTLFireability-10
FORMULA_NAME ASLink-PT-04b-LTLFireability-11
FORMULA_NAME ASLink-PT-04b-LTLFireability-12
FORMULA_NAME ASLink-PT-04b-LTLFireability-13
FORMULA_NAME ASLink-PT-04b-LTLFireability-14
FORMULA_NAME ASLink-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716260763061

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 03:06:05] [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 03:06:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:06:06] [INFO ] Load time of PNML (sax parser for PT used): 508 ms
[2024-05-21 03:06:06] [INFO ] Transformed 2034 places.
[2024-05-21 03:06:06] [INFO ] Transformed 2567 transitions.
[2024-05-21 03:06:06] [INFO ] Found NUPN structural information;
[2024-05-21 03:06:06] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 781 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-04b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 2034 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 1910 transition count 2443
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 1910 transition count 2443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 249 place count 1910 transition count 2442
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 293 place count 1866 transition count 2375
Iterating global reduction 1 with 44 rules applied. Total rules applied 337 place count 1866 transition count 2375
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 351 place count 1866 transition count 2361
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 358 place count 1859 transition count 2354
Iterating global reduction 2 with 7 rules applied. Total rules applied 365 place count 1859 transition count 2354
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 369 place count 1855 transition count 2343
Iterating global reduction 2 with 4 rules applied. Total rules applied 373 place count 1855 transition count 2343
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 376 place count 1852 transition count 2340
Iterating global reduction 2 with 3 rules applied. Total rules applied 379 place count 1852 transition count 2340
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 382 place count 1849 transition count 2330
Iterating global reduction 2 with 3 rules applied. Total rules applied 385 place count 1849 transition count 2330
Applied a total of 385 rules in 1972 ms. Remains 1849 /2034 variables (removed 185) and now considering 2330/2567 (removed 237) transitions.
// Phase 1: matrix 2330 rows 1849 cols
[2024-05-21 03:06:08] [INFO ] Computed 199 invariants in 166 ms
[2024-05-21 03:06:11] [INFO ] Implicit Places using invariants in 2661 ms returned [1683, 1694, 1705, 1713, 1721, 1729, 1737, 1748, 1756, 1764, 1775]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2713 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1838/2034 places, 2330/2567 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1826 transition count 2318
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1826 transition count 2318
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1816 transition count 2308
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1816 transition count 2308
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 1808 transition count 2300
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 1808 transition count 2300
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1804 transition count 2296
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1804 transition count 2296
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1802 transition count 2294
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1802 transition count 2294
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 1800 transition count 2292
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 1800 transition count 2292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 1798 transition count 2290
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1798 transition count 2290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 1796 transition count 2288
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 1796 transition count 2288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1795 transition count 2287
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1795 transition count 2287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1794 transition count 2286
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1794 transition count 2286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 1793 transition count 2285
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 1793 transition count 2285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1792 transition count 2284
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1792 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1791 transition count 2283
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1791 transition count 2283
Applied a total of 94 rules in 1701 ms. Remains 1791 /1838 variables (removed 47) and now considering 2283/2330 (removed 47) transitions.
// Phase 1: matrix 2283 rows 1791 cols
[2024-05-21 03:06:13] [INFO ] Computed 188 invariants in 78 ms
[2024-05-21 03:06:14] [INFO ] Implicit Places using invariants in 1864 ms returned []
[2024-05-21 03:06:15] [INFO ] Invariant cache hit.
[2024-05-21 03:06:23] [INFO ] Implicit Places using invariants and state equation in 8700 ms returned []
Implicit Place search using SMT with State Equation took 10592 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1791/2034 places, 2283/2567 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17010 ms. Remains : 1791/2034 places, 2283/2567 transitions.
Support contains 37 out of 1791 places after structural reductions.
[2024-05-21 03:06:24] [INFO ] Flatten gal took : 390 ms
[2024-05-21 03:06:24] [INFO ] Flatten gal took : 190 ms
[2024-05-21 03:06:25] [INFO ] Input system was already deterministic with 2283 transitions.
Support contains 36 out of 1791 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (86 resets) in 3767 ms. (10 steps per ms) remains 15/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
[2024-05-21 03:06:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 710/732 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/732 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 393/1125 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 634/1759 variables, 119/186 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 03:06:30] [INFO ] Deduced a trap composed of 23 places in 879 ms of which 78 ms to minimize.
[2024-05-21 03:06:30] [INFO ] Deduced a trap composed of 43 places in 568 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1759 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1759/4074 variables, and 188 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 140/142 constraints, State Equation: 0/1791 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 710/732 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/732 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 393/1125 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 03:06:32] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:06:33] [INFO ] Deduced a trap composed of 114 places in 299 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1125 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 634/1759 variables, 119/189 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1759 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1759/4074 variables, and 190 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5041 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 140/142 constraints, State Equation: 0/1791 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 4/4 constraints]
After SMT, in 10157ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 1791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 1791 transition count 1970
Reduce places removed 313 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 318 rules applied. Total rules applied 631 place count 1478 transition count 1965
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 635 place count 1475 transition count 1964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 1474 transition count 1964
Performed 481 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 481 Pre rules applied. Total rules applied 636 place count 1474 transition count 1483
Deduced a syphon composed of 481 places in 4 ms
Ensure Unique test removed 44 places
Reduce places removed 525 places and 0 transitions.
Iterating global reduction 4 with 1006 rules applied. Total rules applied 1642 place count 949 transition count 1483
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1674 place count 945 transition count 1455
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1702 place count 917 transition count 1455
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 1702 place count 917 transition count 1438
Deduced a syphon composed of 17 places in 5 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 1753 place count 883 transition count 1438
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1753 place count 883 transition count 1422
Deduced a syphon composed of 16 places in 7 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1785 place count 867 transition count 1422
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1787 place count 865 transition count 1415
Iterating global reduction 6 with 2 rules applied. Total rules applied 1789 place count 865 transition count 1415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1789 place count 865 transition count 1414
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1791 place count 864 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1792 place count 863 transition count 1413
Iterating global reduction 6 with 1 rules applied. Total rules applied 1793 place count 863 transition count 1413
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 10 ms
Ensure Unique test removed 2 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 6 with 290 rules applied. Total rules applied 2083 place count 717 transition count 1269
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2087 place count 713 transition count 1265
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2092 place count 712 transition count 1265
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 2093 place count 712 transition count 1264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2094 place count 711 transition count 1264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2094 place count 711 transition count 1263
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2096 place count 710 transition count 1263
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2098 place count 708 transition count 1261
Iterating global reduction 8 with 2 rules applied. Total rules applied 2100 place count 708 transition count 1261
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 2102 place count 708 transition count 1259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2103 place count 707 transition count 1259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 2105 place count 706 transition count 1264
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2111 place count 706 transition count 1258
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2117 place count 700 transition count 1258
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2120 place count 700 transition count 1255
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2123 place count 697 transition count 1255
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 2126 place count 697 transition count 1255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2127 place count 696 transition count 1254
Reduce places removed 8 places and 0 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 12 with 11 rules applied. Total rules applied 2138 place count 688 transition count 1251
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2141 place count 685 transition count 1251
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 12 Pre rules applied. Total rules applied 2141 place count 685 transition count 1239
Deduced a syphon composed of 12 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 25 rules applied. Total rules applied 2166 place count 672 transition count 1239
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2172 place count 666 transition count 1239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2172 place count 666 transition count 1238
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 2174 place count 665 transition count 1238
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 15 with 18 rules applied. Total rules applied 2192 place count 656 transition count 1229
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 2196 place count 652 transition count 1225
Iterating global reduction 15 with 4 rules applied. Total rules applied 2200 place count 652 transition count 1225
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 2204 place count 652 transition count 1221
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 2208 place count 648 transition count 1221
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2209 place count 648 transition count 1221
Applied a total of 2209 rules in 1225 ms. Remains 648 /1791 variables (removed 1143) and now considering 1221/2283 (removed 1062) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1226 ms. Remains : 648/1791 places, 1221/2283 transitions.
RANDOM walk for 40000 steps (506 resets) in 516 ms. (77 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 203364 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 15
Probabilistic random walk after 203364 steps, saw 44143 distinct states, run finished after 3019 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1221 rows 648 cols
[2024-05-21 03:06:41] [INFO ] Computed 105 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 51/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 6/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 271/350 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 78/428 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 2/430 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 186/616 variables, 38/88 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 03:06:42] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 6/622 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 25/647 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 1/648 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/648 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 1221/1869 variables, 648/754 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1869 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 0/1869 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 754 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6377 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 51/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 6/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 271/350 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 78/428 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 03:06:48] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:06:48] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-21 03:06:48] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-21 03:06:48] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 2/430 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 186/616 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 6/622 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/622 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 25/647 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/647 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 1/648 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/648 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 21 (OVERLAPS) 1221/1869 variables, 648/758 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1869 variables, 4/762 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1869 variables, 0/762 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1869 variables, 0/762 constraints. Problems are: Problem set: 11 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 762 constraints, problems are : Problem set: 11 solved, 4 unsolved in 10134 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 4/15 constraints, Known Traps: 5/5 constraints]
After SMT, in 16577ms problems are : Problem set: 11 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 6625 ms.
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 648/648 places, 1221/1221 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 648 transition count 1215
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 642 transition count 1215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 641 transition count 1214
Applied a total of 14 rules in 55 ms. Remains 641 /648 variables (removed 7) and now considering 1214/1221 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 641/648 places, 1214/1221 transitions.
RANDOM walk for 40000 steps (530 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (121 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (110 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (112 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 257039 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 3
Probabilistic random walk after 257039 steps, saw 54422 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 1214 rows 641 cols
[2024-05-21 03:07:07] [INFO ] Computed 105 invariants in 17 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 228/290 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 74/364 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/368 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 222/590 variables, 41/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 7/597 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 41/638 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/639 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/639 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/641 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1214/1855 variables, 641/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1855 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1855 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1855/1855 variables, and 746 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/62 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 228/290 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 74/364 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/368 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 222/590 variables, 41/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 7/597 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 41/638 variables, 11/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/639 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:07:10] [INFO ] Deduced a trap composed of 53 places in 344 ms of which 5 ms to minimize.
[2024-05-21 03:07:10] [INFO ] Deduced a trap composed of 51 places in 401 ms of which 5 ms to minimize.
[2024-05-21 03:07:11] [INFO ] Deduced a trap composed of 25 places in 383 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/639 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/639 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/641 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/641 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1214/1855 variables, 641/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1855 variables, 3/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1855 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/1855 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1855/1855 variables, and 752 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3642 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 4964ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 799 ms.
Support contains 5 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1214/1214 transitions.
Applied a total of 0 rules in 45 ms. Remains 641 /641 variables (removed 0) and now considering 1214/1214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 641/641 places, 1214/1214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 1214/1214 transitions.
Applied a total of 0 rules in 32 ms. Remains 641 /641 variables (removed 0) and now considering 1214/1214 (removed 0) transitions.
[2024-05-21 03:07:13] [INFO ] Invariant cache hit.
[2024-05-21 03:07:14] [INFO ] Implicit Places using invariants in 1049 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 418, 436, 505, 509, 510, 513, 524, 525, 526, 559, 580, 581, 582, 583]
[2024-05-21 03:07:14] [INFO ] Actually due to overlaps returned [559, 526, 48, 169, 294, 418, 31, 152, 277, 400, 149, 274, 397, 524, 580, 150, 275, 398, 525, 581, 1, 18, 262, 263, 385, 386, 509, 510, 66, 187, 312, 436, 582, 19, 513, 583]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1058 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 605/641 places, 1214/1214 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 602 transition count 1139
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 157 place count 527 transition count 1135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 526 transition count 1135
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 158 place count 526 transition count 1112
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 205 place count 502 transition count 1112
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 217 place count 498 transition count 1104
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 225 place count 490 transition count 1104
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 228 place count 487 transition count 1101
Iterating global reduction 5 with 3 rules applied. Total rules applied 231 place count 487 transition count 1101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 234 place count 487 transition count 1098
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 294 place count 457 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 296 place count 455 transition count 1066
Iterating global reduction 6 with 2 rules applied. Total rules applied 298 place count 455 transition count 1066
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 300 place count 455 transition count 1064
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 7 with 4 rules applied. Total rules applied 304 place count 453 transition count 1065
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 305 place count 453 transition count 1064
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 315 place count 453 transition count 1054
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 326 place count 442 transition count 1054
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 338 place count 442 transition count 1054
Applied a total of 338 rules in 345 ms. Remains 442 /605 variables (removed 163) and now considering 1054/1214 (removed 160) transitions.
// Phase 1: matrix 1054 rows 442 cols
[2024-05-21 03:07:15] [INFO ] Computed 60 invariants in 17 ms
[2024-05-21 03:07:15] [INFO ] Implicit Places using invariants in 872 ms returned [90, 96, 99, 101, 103, 106, 107, 178, 184, 187, 189, 195, 196, 249, 265, 271, 274, 276, 281, 282, 336, 352, 358, 361, 363]
[2024-05-21 03:07:15] [INFO ] Actually due to overlaps returned [106, 195, 281, 107, 196, 282, 90, 96, 101, 178, 184, 189, 265, 271, 276, 352, 358, 363, 103, 249, 336]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 876 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 421/641 places, 1054/1214 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 405 transition count 1038
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 405 transition count 1038
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 401 transition count 1034
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 401 transition count 1034
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 395 transition count 1028
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 395 transition count 1016
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 383 transition count 1016
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 383 transition count 1014
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 381 transition count 1014
Applied a total of 80 rules in 160 ms. Remains 381 /421 variables (removed 40) and now considering 1014/1054 (removed 40) transitions.
// Phase 1: matrix 1014 rows 381 cols
[2024-05-21 03:07:16] [INFO ] Computed 39 invariants in 15 ms
[2024-05-21 03:07:16] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-21 03:07:16] [INFO ] Invariant cache hit.
[2024-05-21 03:07:18] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1928 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 381/641 places, 1014/1214 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4401 ms. Remains : 381/641 places, 1014/1214 transitions.
RANDOM walk for 40000 steps (806 resets) in 354 ms. (112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (210 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (213 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (210 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 444168 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :2 out of 3
Probabilistic random walk after 444168 steps, saw 116966 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :2
[2024-05-21 03:07:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/194 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/207 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/210 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 162/372 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/381 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/381 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1014/1395 variables, 381/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1395 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1395 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1395/1395 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 381/381 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/162 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/194 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/207 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/210 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 03:07:22] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 162/372 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/381 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/381 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1014/1395 variables, 381/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1395 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1395 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1395 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1395/1395 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 1014/1014 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 381 transition count 1012
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 379 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 378 transition count 1011
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 378 transition count 1011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 378 transition count 1010
Applied a total of 7 rules in 51 ms. Remains 378 /381 variables (removed 3) and now considering 1010/1014 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 378/381 places, 1010/1014 transitions.
RANDOM walk for 40000 steps (753 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (205 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384040 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 384040 steps, saw 103572 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
// Phase 1: matrix 1010 rows 378 cols
[2024-05-21 03:07:26] [INFO ] Computed 39 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/164 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/205 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/208 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/369 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/378 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1010/1388 variables, 378/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1388 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1388 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1388/1388 variables, and 417 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 378/378 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/164 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/205 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/208 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/369 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/378 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1010/1388 variables, 378/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1388 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1388 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1388 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1388/1388 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 1010/1010 transitions.
Applied a total of 0 rules in 14 ms. Remains 378 /378 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 378/378 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 1010/1010 transitions.
Applied a total of 0 rules in 14 ms. Remains 378 /378 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2024-05-21 03:07:28] [INFO ] Invariant cache hit.
[2024-05-21 03:07:28] [INFO ] Implicit Places using invariants in 588 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 590 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 1010/1010 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 376 transition count 1009
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 376 transition count 1008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 375 transition count 1008
Applied a total of 4 rules in 59 ms. Remains 375 /377 variables (removed 2) and now considering 1008/1010 (removed 2) transitions.
// Phase 1: matrix 1008 rows 375 cols
[2024-05-21 03:07:29] [INFO ] Computed 38 invariants in 15 ms
[2024-05-21 03:07:29] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-21 03:07:29] [INFO ] Invariant cache hit.
[2024-05-21 03:07:31] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 375/378 places, 1008/1010 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2941 ms. Remains : 375/378 places, 1008/1010 transitions.
RANDOM walk for 40000 steps (814 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (217 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 440587 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 440587 steps, saw 119359 distinct states, run finished after 3004 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-21 03:07:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 83/218 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/220 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 155/375 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1008/1383 variables, 375/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1383 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1383 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1383/1383 variables, and 413 constraints, problems are : Problem set: 0 solved, 1 unsolved in 614 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 375/375 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/218 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/220 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 155/375 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1008/1383 variables, 375/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1383 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1383 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1383 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1383/1383 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1871 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2501ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 1008/1008 transitions.
Applied a total of 0 rules in 16 ms. Remains 375 /375 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 375/375 places, 1008/1008 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 1008/1008 transitions.
Applied a total of 0 rules in 16 ms. Remains 375 /375 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
[2024-05-21 03:07:36] [INFO ] Invariant cache hit.
[2024-05-21 03:07:37] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-21 03:07:37] [INFO ] Invariant cache hit.
[2024-05-21 03:07:38] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2024-05-21 03:07:39] [INFO ] Redundant transitions in 68 ms returned []
Running 983 sub problems to find dead transitions.
[2024-05-21 03:07:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/1383 variables, and 35 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 27/35 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 1/375 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 983 unsolved
[2024-05-21 03:08:32] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 6 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 Int declared 375/1383 variables, and 39 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 0/983 constraints, Known Traps: 1/1 constraints]
After SMT, in 61022ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 61040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63142 ms. Remains : 375/375 places, 1008/1008 transitions.
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA ASLink-PT-04b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 71 stabilizing places and 71 stable transitions
FORMULA ASLink-PT-04b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 1791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1785 transition count 2265
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1785 transition count 2265
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1781 transition count 2261
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1781 transition count 2261
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 1781 transition count 2260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1779 transition count 2251
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1779 transition count 2251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1778 transition count 2243
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1778 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1777 transition count 2242
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1777 transition count 2242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1776 transition count 2234
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1776 transition count 2234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1775 transition count 2226
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1775 transition count 2226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1774 transition count 2225
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1774 transition count 2225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1773 transition count 2217
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1773 transition count 2217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1772 transition count 2209
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1772 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1771 transition count 2208
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1771 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1770 transition count 2200
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1770 transition count 2200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1769 transition count 2192
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1769 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1768 transition count 2191
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1768 transition count 2191
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1767 transition count 2183
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1767 transition count 2183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1766 transition count 2175
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1766 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1765 transition count 2174
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1765 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1764 transition count 2166
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1764 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1763 transition count 2158
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1763 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1762 transition count 2157
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1762 transition count 2157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1761 transition count 2149
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1761 transition count 2149
Applied a total of 61 rules in 2788 ms. Remains 1761 /1791 variables (removed 30) and now considering 2149/2283 (removed 134) transitions.
// Phase 1: matrix 2149 rows 1761 cols
[2024-05-21 03:08:43] [INFO ] Computed 188 invariants in 42 ms
[2024-05-21 03:08:44] [INFO ] Implicit Places using invariants in 1391 ms returned []
[2024-05-21 03:08:44] [INFO ] Invariant cache hit.
[2024-05-21 03:08:51] [INFO ] Implicit Places using invariants and state equation in 6740 ms returned []
Implicit Place search using SMT with State Equation took 8134 ms to find 0 implicit places.
Running 2148 sub problems to find dead transitions.
[2024-05-21 03:08:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 2148/2148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1760 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 2148 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 1760/3910 variables, and 105 constraints, problems are : Problem set: 0 solved, 2148 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 105/142 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 0/2148 constraints, Known Traps: 0/0 constraints]
After SMT, in 61032ms problems are : Problem set: 0 solved, 2148 unsolved
Search for dead transitions found 0 dead transitions in 61067ms
Starting structural reductions in LTL mode, iteration 1 : 1761/1791 places, 2149/2283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72001 ms. Remains : 1761/1791 places, 2149/2283 transitions.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-00
Product exploration explored 100000 steps with 1284 reset in 814 ms.
Product exploration explored 100000 steps with 1273 reset in 464 ms.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Detected a total of 71/1761 stabilizing places and 71/2149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (95 resets) in 250 ms. (159 steps per ms) remains 1/6 properties
BEST_FIRST walk for 39181 steps (12 resets) in 252 ms. (154 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 03:09:55] [INFO ] Invariant cache hit.
[2024-05-21 03:09:58] [INFO ] [Real]Absence check using 46 positive place invariants in 60 ms returned sat
[2024-05-21 03:09:59] [INFO ] [Real]Absence check using 46 positive and 142 generalized place invariants in 1108 ms returned sat
[2024-05-21 03:10:10] [INFO ] [Real]Absence check using state equation in 11525 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1761 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1761/1761 places, 2149/2149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 1760 transition count 1827
Reduce places removed 321 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 324 rules applied. Total rules applied 645 place count 1439 transition count 1824
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 647 place count 1437 transition count 1824
Performed 475 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 475 Pre rules applied. Total rules applied 647 place count 1437 transition count 1349
Deduced a syphon composed of 475 places in 8 ms
Ensure Unique test removed 44 places
Reduce places removed 519 places and 0 transitions.
Iterating global reduction 3 with 994 rules applied. Total rules applied 1641 place count 918 transition count 1349
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1673 place count 914 transition count 1321
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1701 place count 886 transition count 1321
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1701 place count 886 transition count 1304
Deduced a syphon composed of 17 places in 5 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1752 place count 852 transition count 1304
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1752 place count 852 transition count 1288
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1784 place count 836 transition count 1288
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 5 with 282 rules applied. Total rules applied 2066 place count 694 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2070 place count 690 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2075 place count 689 transition count 1144
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 2076 place count 689 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2077 place count 688 transition count 1143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2077 place count 688 transition count 1142
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 2079 place count 687 transition count 1142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2081 place count 685 transition count 1140
Iterating global reduction 7 with 2 rules applied. Total rules applied 2083 place count 685 transition count 1140
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 2085 place count 685 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2086 place count 684 transition count 1138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2088 place count 683 transition count 1143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2090 place count 681 transition count 1141
Reduce places removed 8 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 9 with 12 rules applied. Total rules applied 2102 place count 673 transition count 1137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2106 place count 669 transition count 1137
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2106 place count 669 transition count 1125
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2131 place count 656 transition count 1125
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 11 with 9 rules applied. Total rules applied 2140 place count 647 transition count 1125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2140 place count 647 transition count 1124
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2142 place count 646 transition count 1124
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 2168 place count 633 transition count 1111
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 2176 place count 625 transition count 1103
Iterating global reduction 12 with 8 rules applied. Total rules applied 2184 place count 625 transition count 1103
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 2188 place count 621 transition count 1099
Iterating global reduction 12 with 4 rules applied. Total rules applied 2192 place count 621 transition count 1099
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2196 place count 621 transition count 1095
Applied a total of 2196 rules in 697 ms. Remains 621 /1761 variables (removed 1140) and now considering 1095/2149 (removed 1054) transitions.
// Phase 1: matrix 1095 rows 621 cols
[2024-05-21 03:10:11] [INFO ] Computed 102 invariants in 23 ms
[2024-05-21 03:10:12] [INFO ] Implicit Places using invariants in 970 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 396, 431, 451, 502, 503, 506, 518, 519, 520, 538, 559, 560, 561, 562]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 973 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/1761 places, 1095/2149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 581 transition count 1026
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 512 transition count 1026
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 138 place count 512 transition count 1003
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 185 place count 488 transition count 1003
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 197 place count 484 transition count 995
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 205 place count 476 transition count 995
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 208 place count 473 transition count 992
Iterating global reduction 4 with 3 rules applied. Total rules applied 211 place count 473 transition count 992
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 473 transition count 989
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 276 place count 442 transition count 958
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 5 with 4 rules applied. Total rules applied 280 place count 440 transition count 959
Applied a total of 280 rules in 86 ms. Remains 440 /581 variables (removed 141) and now considering 959/1095 (removed 136) transitions.
// Phase 1: matrix 959 rows 440 cols
[2024-05-21 03:10:12] [INFO ] Computed 57 invariants in 15 ms
[2024-05-21 03:10:13] [INFO ] Implicit Places using invariants in 764 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 357, 365, 371, 437]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 766 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 427/1761 places, 959/2149 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 427 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 426 transition count 958
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 418 transition count 950
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 418 transition count 950
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 410 transition count 942
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 410 transition count 942
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 405 transition count 937
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 405 transition count 937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 404 transition count 936
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 404 transition count 936
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 403 transition count 935
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 403 transition count 935
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 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 399 transition count 931
Applied a total of 56 rules in 89 ms. Remains 399 /427 variables (removed 28) and now considering 931/959 (removed 28) transitions.
// Phase 1: matrix 931 rows 399 cols
[2024-05-21 03:10:13] [INFO ] Computed 44 invariants in 13 ms
[2024-05-21 03:10:14] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-21 03:10:14] [INFO ] Invariant cache hit.
[2024-05-21 03:10:15] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 399/1761 places, 931/2149 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4766 ms. Remains : 399/1761 places, 931/2149 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/399 stabilizing places and 2/931 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 660 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 32351 steps (517 resets) in 171 ms. (188 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 960 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 03:10:18] [INFO ] Invariant cache hit.
[2024-05-21 03:10:18] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-21 03:10:18] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 39 ms returned sat
[2024-05-21 03:10:20] [INFO ] [Real]Absence check using state equation in 1575 ms returned sat
[2024-05-21 03:10:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 03:10:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-21 03:10:21] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 43 ms returned sat
[2024-05-21 03:10:22] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2024-05-21 03:10:22] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-05-21 03:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-05-21 03:10:22] [INFO ] Computed and/alt/rep : 261/1280/261 causal constraints (skipped 636 transitions) in 99 ms.
[2024-05-21 03:10:24] [INFO ] Added : 121 causal constraints over 25 iterations in 2349 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12499 reset in 542 ms.
Product exploration explored 100000 steps with 12396 reset in 683 ms.
Built C files in :
/tmp/ltsmin17294794485755643234
[2024-05-21 03:10:26] [INFO ] Computing symmetric may disable matrix : 931 transitions.
[2024-05-21 03:10:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:10:26] [INFO ] Computing symmetric may enable matrix : 931 transitions.
[2024-05-21 03:10:26] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:10:26] [INFO ] Computing Do-Not-Accords matrix : 931 transitions.
[2024-05-21 03:10:26] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:10:26] [INFO ] Built C files in 406ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17294794485755643234
Running compilation step : cd /tmp/ltsmin17294794485755643234;'/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/ltsmin17294794485755643234;'/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/ltsmin17294794485755643234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 399 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 399/399 places, 931/931 transitions.
Applied a total of 0 rules in 18 ms. Remains 399 /399 variables (removed 0) and now considering 931/931 (removed 0) transitions.
[2024-05-21 03:10:29] [INFO ] Invariant cache hit.
[2024-05-21 03:10:30] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-21 03:10:30] [INFO ] Invariant cache hit.
[2024-05-21 03:10:32] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
[2024-05-21 03:10:32] [INFO ] Redundant transitions in 111 ms returned []
Running 897 sub problems to find dead transitions.
[2024-05-21 03:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 3 (OVERLAPS) 3/396 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 897 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1330 variables, and 34 constraints, problems are : Problem set: 0 solved, 897 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 23/33 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 897/897 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 897 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 3 (OVERLAPS) 3/396 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 6 (OVERLAPS) 3/399 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-05-21 03:11:32] [INFO ] Deduced a trap composed of 55 places in 416 ms of which 4 ms to minimize.
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 399/1330 variables, and 45 constraints, problems are : Problem set: 0 solved, 897 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 0/897 constraints, Known Traps: 1/1 constraints]
After SMT, in 60692ms problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 60705ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63000 ms. Remains : 399/399 places, 931/931 transitions.
Built C files in :
/tmp/ltsmin11602815777827729287
[2024-05-21 03:11:32] [INFO ] Computing symmetric may disable matrix : 931 transitions.
[2024-05-21 03:11:32] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:11:32] [INFO ] Computing symmetric may enable matrix : 931 transitions.
[2024-05-21 03:11:32] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:11:33] [INFO ] Computing Do-Not-Accords matrix : 931 transitions.
[2024-05-21 03:11:33] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:11:33] [INFO ] Built C files in 285ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11602815777827729287
Running compilation step : cd /tmp/ltsmin11602815777827729287;'/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/ltsmin11602815777827729287;'/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/ltsmin11602815777827729287;'/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 03:11:36] [INFO ] Flatten gal took : 54 ms
[2024-05-21 03:11:36] [INFO ] Flatten gal took : 48 ms
[2024-05-21 03:11:36] [INFO ] Time to serialize gal into /tmp/LTL12376866601193640270.gal : 20 ms
[2024-05-21 03:11:36] [INFO ] Time to serialize properties into /tmp/LTL2396553279729849767.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/LTL12376866601193640270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut663656641512036775.hoa' '-atoms' '/tmp/LTL2396553279729849767.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...317
Loading property file /tmp/LTL2396553279729849767.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut663656641512036775.hoa
Detected timeout of ITS tools.
[2024-05-21 03:11:51] [INFO ] Flatten gal took : 41 ms
[2024-05-21 03:11:51] [INFO ] Flatten gal took : 44 ms
[2024-05-21 03:11:51] [INFO ] Time to serialize gal into /tmp/LTL17705033395059844218.gal : 13 ms
[2024-05-21 03:11:51] [INFO ] Time to serialize properties into /tmp/LTL7700056936362986467.ltl : 7 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/LTL17705033395059844218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7700056936362986467.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("(p1273==1)")||(X("(p1620==1)")))))
Formula 0 simplified : G(!"(p1273==1)" & X!"(p1620==1)")
Detected timeout of ITS tools.
[2024-05-21 03:12:06] [INFO ] Flatten gal took : 39 ms
[2024-05-21 03:12:06] [INFO ] Applying decomposition
[2024-05-21 03:12:06] [INFO ] Flatten gal took : 38 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/graph277741926301798090.txt' '-o' '/tmp/graph277741926301798090.bin' '-w' '/tmp/graph277741926301798090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph277741926301798090.bin' '-l' '-1' '-v' '-w' '/tmp/graph277741926301798090.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:12:07] [INFO ] Decomposing Gal with order
[2024-05-21 03:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:12:07] [INFO ] Removed a total of 1735 redundant transitions.
[2024-05-21 03:12:07] [INFO ] Flatten gal took : 257 ms
[2024-05-21 03:12:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 49 ms.
[2024-05-21 03:12:07] [INFO ] Time to serialize gal into /tmp/LTL6382667110703310522.gal : 22 ms
[2024-05-21 03:12:07] [INFO ] Time to serialize properties into /tmp/LTL2258242583499927888.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/LTL6382667110703310522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2258242583499927888.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 : !((F(("(i6.u69.p1273==1)")||(X("(i8.u80.p1620==1)")))))
Formula 0 simplified : G(!"(i6.u69.p1273==1)" & X!"(i8.u80.p1620==1)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04b-LTLFireability-00 finished in 222427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 1790 transition count 1963
Reduce places removed 319 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 324 rules applied. Total rules applied 643 place count 1471 transition count 1958
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 647 place count 1468 transition count 1957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 1467 transition count 1957
Performed 487 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 487 Pre rules applied. Total rules applied 648 place count 1467 transition count 1470
Deduced a syphon composed of 487 places in 3 ms
Ensure Unique test removed 44 places
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 4 with 1018 rules applied. Total rules applied 1666 place count 936 transition count 1470
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1698 place count 932 transition count 1442
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 1726 place count 904 transition count 1442
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 1726 place count 904 transition count 1425
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 1777 place count 870 transition count 1425
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1777 place count 870 transition count 1409
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1809 place count 854 transition count 1409
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1813 place count 850 transition count 1393
Iterating global reduction 6 with 4 rules applied. Total rules applied 1817 place count 850 transition count 1393
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1817 place count 850 transition count 1392
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1819 place count 849 transition count 1392
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1821 place count 847 transition count 1383
Iterating global reduction 6 with 2 rules applied. Total rules applied 1823 place count 847 transition count 1383
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1824 place count 846 transition count 1375
Iterating global reduction 6 with 1 rules applied. Total rules applied 1825 place count 846 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1826 place count 845 transition count 1367
Iterating global reduction 6 with 1 rules applied. Total rules applied 1827 place count 845 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1828 place count 844 transition count 1359
Iterating global reduction 6 with 1 rules applied. Total rules applied 1829 place count 844 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1830 place count 843 transition count 1351
Iterating global reduction 6 with 1 rules applied. Total rules applied 1831 place count 843 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1832 place count 842 transition count 1343
Iterating global reduction 6 with 1 rules applied. Total rules applied 1833 place count 842 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1834 place count 841 transition count 1335
Iterating global reduction 6 with 1 rules applied. Total rules applied 1835 place count 841 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1836 place count 840 transition count 1327
Iterating global reduction 6 with 1 rules applied. Total rules applied 1837 place count 840 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1838 place count 839 transition count 1319
Iterating global reduction 6 with 1 rules applied. Total rules applied 1839 place count 839 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1840 place count 838 transition count 1311
Iterating global reduction 6 with 1 rules applied. Total rules applied 1841 place count 838 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1842 place count 837 transition count 1303
Iterating global reduction 6 with 1 rules applied. Total rules applied 1843 place count 837 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1844 place count 836 transition count 1295
Iterating global reduction 6 with 1 rules applied. Total rules applied 1845 place count 836 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1846 place count 835 transition count 1287
Iterating global reduction 6 with 1 rules applied. Total rules applied 1847 place count 835 transition count 1287
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 6 with 284 rules applied. Total rules applied 2131 place count 692 transition count 1146
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2135 place count 688 transition count 1142
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2140 place count 687 transition count 1142
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 2141 place count 687 transition count 1141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2142 place count 686 transition count 1141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2142 place count 686 transition count 1140
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 2144 place count 685 transition count 1140
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2146 place count 683 transition count 1138
Iterating global reduction 8 with 2 rules applied. Total rules applied 2148 place count 683 transition count 1138
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 2150 place count 683 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2151 place count 682 transition count 1136
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 2153 place count 681 transition count 1141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2155 place count 679 transition count 1139
Reduce places removed 8 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 10 with 12 rules applied. Total rules applied 2167 place count 671 transition count 1135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2171 place count 667 transition count 1135
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 12 Pre rules applied. Total rules applied 2171 place count 667 transition count 1123
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 25 rules applied. Total rules applied 2196 place count 654 transition count 1123
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 12 with 8 rules applied. Total rules applied 2204 place count 646 transition count 1123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2204 place count 646 transition count 1122
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2206 place count 645 transition count 1122
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 2230 place count 633 transition count 1110
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 2237 place count 626 transition count 1103
Iterating global reduction 13 with 7 rules applied. Total rules applied 2244 place count 626 transition count 1103
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 2247 place count 623 transition count 1100
Iterating global reduction 13 with 3 rules applied. Total rules applied 2250 place count 623 transition count 1100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2253 place count 623 transition count 1097
Applied a total of 2253 rules in 874 ms. Remains 623 /1791 variables (removed 1168) and now considering 1097/2283 (removed 1186) transitions.
// Phase 1: matrix 1097 rows 623 cols
[2024-05-21 03:12:23] [INFO ] Computed 103 invariants in 11 ms
[2024-05-21 03:12:24] [INFO ] Implicit Places using invariants in 1091 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 256, 260, 261, 273, 274, 276, 293, 311, 331, 383, 384, 396, 397, 399, 416, 434, 454, 505, 506, 509, 520, 521, 522, 540, 561, 562, 563, 564]
[2024-05-21 03:12:24] [INFO ] Actually due to overlaps returned [540, 522, 48, 167, 293, 416, 150, 31, 147, 273, 276, 396, 399, 520, 561, 148, 274, 397, 521, 562, 1, 18, 260, 261, 383, 384, 505, 506, 185, 563, 19, 66, 86, 137, 311, 331, 434, 454, 509, 564]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/1791 places, 1097/2283 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 582 transition count 1022
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 507 transition count 1022
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 151 place count 507 transition count 999
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 483 transition count 999
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 210 place count 479 transition count 991
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 218 place count 471 transition count 991
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 221 place count 468 transition count 988
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 468 transition count 988
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 227 place count 468 transition count 985
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 293 place count 435 transition count 952
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 294 place count 434 transition count 951
Iterating global reduction 5 with 1 rules applied. Total rules applied 295 place count 434 transition count 951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 434 transition count 950
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 300 place count 432 transition count 951
Applied a total of 300 rules in 126 ms. Remains 432 /583 variables (removed 151) and now considering 951/1097 (removed 146) transitions.
// Phase 1: matrix 951 rows 432 cols
[2024-05-21 03:12:24] [INFO ] Computed 57 invariants in 9 ms
[2024-05-21 03:12:25] [INFO ] Implicit Places using invariants in 775 ms returned [88, 94, 99, 159, 176, 182, 187, 264, 271, 276, 353, 359, 364, 429]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 777 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 418/1791 places, 951/2283 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 418 transition count 950
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 417 transition count 950
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 409 transition count 942
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 409 transition count 942
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 402 transition count 935
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 402 transition count 935
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 399 transition count 932
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 399 transition count 932
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 394 transition count 927
Applied a total of 48 rules in 89 ms. Remains 394 /418 variables (removed 24) and now considering 927/951 (removed 24) transitions.
// Phase 1: matrix 927 rows 394 cols
[2024-05-21 03:12:25] [INFO ] Computed 43 invariants in 12 ms
[2024-05-21 03:12:26] [INFO ] Implicit Places using invariants in 826 ms returned []
[2024-05-21 03:12:26] [INFO ] Invariant cache hit.
[2024-05-21 03:12:28] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2677 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 394/1791 places, 927/2283 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5645 ms. Remains : 394/1791 places, 927/2283 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-01
Product exploration explored 100000 steps with 1521 reset in 433 ms.
Product exploration explored 100000 steps with 1622 reset in 688 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28387 steps (439 resets) in 119 ms. (236 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 927/927 transitions.
Applied a total of 0 rules in 22 ms. Remains 394 /394 variables (removed 0) and now considering 927/927 (removed 0) transitions.
[2024-05-21 03:12:30] [INFO ] Invariant cache hit.
[2024-05-21 03:12:31] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-21 03:12:31] [INFO ] Invariant cache hit.
[2024-05-21 03:12:32] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
[2024-05-21 03:12:33] [INFO ] Redundant transitions in 16 ms returned []
Running 894 sub problems to find dead transitions.
[2024-05-21 03:12:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 2/391 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 894 unsolved
SMT process timed out in 30879ms, After SMT, problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 30900ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33711 ms. Remains : 394/394 places, 927/927 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 25273 steps (412 resets) in 141 ms. (177 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1604 reset in 334 ms.
Product exploration explored 100000 steps with 1559 reset in 373 ms.
Built C files in :
/tmp/ltsmin16479730483065001704
[2024-05-21 03:13:05] [INFO ] Computing symmetric may disable matrix : 927 transitions.
[2024-05-21 03:13:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:13:05] [INFO ] Computing symmetric may enable matrix : 927 transitions.
[2024-05-21 03:13:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:13:05] [INFO ] Computing Do-Not-Accords matrix : 927 transitions.
[2024-05-21 03:13:05] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:13:05] [INFO ] Built C files in 260ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16479730483065001704
Running compilation step : cd /tmp/ltsmin16479730483065001704;'/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/ltsmin16479730483065001704;'/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/ltsmin16479730483065001704;'/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 1 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 927/927 transitions.
Applied a total of 0 rules in 23 ms. Remains 394 /394 variables (removed 0) and now considering 927/927 (removed 0) transitions.
[2024-05-21 03:13:08] [INFO ] Invariant cache hit.
[2024-05-21 03:13:09] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-05-21 03:13:09] [INFO ] Invariant cache hit.
[2024-05-21 03:13:11] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2310 ms to find 0 implicit places.
[2024-05-21 03:13:11] [INFO ] Redundant transitions in 16 ms returned []
Running 894 sub problems to find dead transitions.
[2024-05-21 03:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 2/391 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 894 unsolved
SMT process timed out in 30799ms, After SMT, problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 30820ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33182 ms. Remains : 394/394 places, 927/927 transitions.
Built C files in :
/tmp/ltsmin15243223863229580660
[2024-05-21 03:13:41] [INFO ] Computing symmetric may disable matrix : 927 transitions.
[2024-05-21 03:13:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:13:41] [INFO ] Computing symmetric may enable matrix : 927 transitions.
[2024-05-21 03:13:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:13:42] [INFO ] Computing Do-Not-Accords matrix : 927 transitions.
[2024-05-21 03:13:42] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 03:13:42] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15243223863229580660
Running compilation step : cd /tmp/ltsmin15243223863229580660;'/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/ltsmin15243223863229580660;'/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/ltsmin15243223863229580660;'/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 03:13:45] [INFO ] Flatten gal took : 65 ms
[2024-05-21 03:13:45] [INFO ] Flatten gal took : 64 ms
[2024-05-21 03:13:45] [INFO ] Time to serialize gal into /tmp/LTL16491470197372453450.gal : 10 ms
[2024-05-21 03:13:45] [INFO ] Time to serialize properties into /tmp/LTL11170113412657093885.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/LTL16491470197372453450.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2383103598150859278.hoa' '-atoms' '/tmp/LTL11170113412657093885.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/LTL11170113412657093885.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2383103598150859278.hoa
Detected timeout of ITS tools.
[2024-05-21 03:14:00] [INFO ] Flatten gal took : 58 ms
[2024-05-21 03:14:00] [INFO ] Flatten gal took : 56 ms
[2024-05-21 03:14:00] [INFO ] Time to serialize gal into /tmp/LTL436805070717812307.gal : 10 ms
[2024-05-21 03:14:00] [INFO ] Time to serialize properties into /tmp/LTL18092055264501089072.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/LTL436805070717812307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18092055264501089072.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1110==0)"))))
Formula 0 simplified : FG!"(p1110==0)"
Detected timeout of ITS tools.
[2024-05-21 03:14:15] [INFO ] Flatten gal took : 39 ms
[2024-05-21 03:14:15] [INFO ] Applying decomposition
[2024-05-21 03:14:15] [INFO ] Flatten gal took : 35 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/graph17101065288991968784.txt' '-o' '/tmp/graph17101065288991968784.bin' '-w' '/tmp/graph17101065288991968784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17101065288991968784.bin' '-l' '-1' '-v' '-w' '/tmp/graph17101065288991968784.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:14:15] [INFO ] Decomposing Gal with order
[2024-05-21 03:14:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:14:16] [INFO ] Removed a total of 1843 redundant transitions.
[2024-05-21 03:14:16] [INFO ] Flatten gal took : 69 ms
[2024-05-21 03:14:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 28 ms.
[2024-05-21 03:14:16] [INFO ] Time to serialize gal into /tmp/LTL7250500204819361656.gal : 12 ms
[2024-05-21 03:14:16] [INFO ] Time to serialize properties into /tmp/LTL1584234753159643554.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/LTL7250500204819361656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1584234753159643554.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 : !((G(F("(i6.u59.p1110==0)"))))
Formula 0 simplified : FG!"(i6.u59.p1110==0)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04b-LTLFireability-01 finished in 128316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1786 transition count 2266
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1786 transition count 2266
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 1783 transition count 2263
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 1783 transition count 2263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1783 transition count 2262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1782 transition count 2254
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1782 transition count 2254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1781 transition count 2246
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1781 transition count 2246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1780 transition count 2245
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1780 transition count 2245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1779 transition count 2237
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1779 transition count 2237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1778 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1778 transition count 2229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1777 transition count 2228
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1777 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1776 transition count 2220
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1776 transition count 2220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1775 transition count 2212
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1775 transition count 2212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1774 transition count 2211
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1774 transition count 2211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1773 transition count 2203
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1773 transition count 2203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1772 transition count 2195
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1772 transition count 2195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1771 transition count 2194
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1771 transition count 2194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1770 transition count 2186
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1770 transition count 2186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1769 transition count 2178
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1769 transition count 2178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1768 transition count 2177
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1768 transition count 2177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1767 transition count 2169
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1767 transition count 2169
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1766 transition count 2161
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1766 transition count 2161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1765 transition count 2160
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1765 transition count 2160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1764 transition count 2152
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1764 transition count 2152
Applied a total of 55 rules in 2294 ms. Remains 1764 /1791 variables (removed 27) and now considering 2152/2283 (removed 131) transitions.
// Phase 1: matrix 2152 rows 1764 cols
[2024-05-21 03:14:33] [INFO ] Computed 188 invariants in 38 ms
[2024-05-21 03:14:35] [INFO ] Implicit Places using invariants in 1916 ms returned []
[2024-05-21 03:14:35] [INFO ] Invariant cache hit.
[2024-05-21 03:14:45] [INFO ] Implicit Places using invariants and state equation in 9976 ms returned []
Implicit Place search using SMT with State Equation took 11901 ms to find 0 implicit places.
Running 2151 sub problems to find dead transitions.
[2024-05-21 03:14:45] [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 13.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 6.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 3.0)
(s47 1.0)
(s48 1.0)
(s49 6.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 18.0)
(s59 1.0)
(s60 1.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 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.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 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 4.0)
(s361 0.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.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 23.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 13.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 13.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 10.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 4.0)
(s413 1.0)
(s414 93.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1763 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1763/3916 variables, and 103 constraints, problems are : Problem set: 0 solved, 2151 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1764 constraints, PredecessorRefiner: 2151/2151 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1763 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 2151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1763/3916 variables, and 103 constraints, problems are : Problem set: 0 solved, 2151 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 103/142 constraints, State Equation: 0/1764 constraints, PredecessorRefiner: 0/2151 constraints, Known Traps: 0/0 constraints]
After SMT, in 61065ms problems are : Problem set: 0 solved, 2151 unsolved
Search for dead transitions found 0 dead transitions in 61092ms
Starting structural reductions in LTL mode, iteration 1 : 1764/1791 places, 2152/2283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75293 ms. Remains : 1764/1791 places, 2152/2283 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 933 ms.
Product exploration explored 100000 steps with 50000 reset in 582 ms.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-04b-LTLFireability-03 finished in 76987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(!p1 U (p2||G(!p1)))))'
Support contains 4 out of 1791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 1790 transition count 1966
Reduce places removed 316 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 319 rules applied. Total rules applied 635 place count 1474 transition count 1963
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 637 place count 1472 transition count 1963
Performed 485 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 485 Pre rules applied. Total rules applied 637 place count 1472 transition count 1478
Deduced a syphon composed of 485 places in 5 ms
Ensure Unique test removed 42 places
Reduce places removed 527 places and 0 transitions.
Iterating global reduction 3 with 1012 rules applied. Total rules applied 1649 place count 945 transition count 1478
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 3 with 31 rules applied. Total rules applied 1680 place count 941 transition count 1451
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 1707 place count 914 transition count 1451
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1707 place count 914 transition count 1435
Deduced a syphon composed of 16 places in 4 ms
Ensure Unique test removed 16 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1755 place count 882 transition count 1435
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 1755 place count 882 transition count 1420
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 1785 place count 867 transition count 1420
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1789 place count 863 transition count 1404
Iterating global reduction 5 with 4 rules applied. Total rules applied 1793 place count 863 transition count 1404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1793 place count 863 transition count 1403
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 1795 place count 862 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1797 place count 860 transition count 1394
Iterating global reduction 5 with 2 rules applied. Total rules applied 1799 place count 860 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1800 place count 859 transition count 1386
Iterating global reduction 5 with 1 rules applied. Total rules applied 1801 place count 859 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1802 place count 858 transition count 1378
Iterating global reduction 5 with 1 rules applied. Total rules applied 1803 place count 858 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1804 place count 857 transition count 1370
Iterating global reduction 5 with 1 rules applied. Total rules applied 1805 place count 857 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1806 place count 856 transition count 1362
Iterating global reduction 5 with 1 rules applied. Total rules applied 1807 place count 856 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1808 place count 855 transition count 1354
Iterating global reduction 5 with 1 rules applied. Total rules applied 1809 place count 855 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1810 place count 854 transition count 1346
Iterating global reduction 5 with 1 rules applied. Total rules applied 1811 place count 854 transition count 1346
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1812 place count 853 transition count 1338
Iterating global reduction 5 with 1 rules applied. Total rules applied 1813 place count 853 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1814 place count 852 transition count 1330
Iterating global reduction 5 with 1 rules applied. Total rules applied 1815 place count 852 transition count 1330
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1816 place count 851 transition count 1322
Iterating global reduction 5 with 1 rules applied. Total rules applied 1817 place count 851 transition count 1322
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1818 place count 850 transition count 1314
Iterating global reduction 5 with 1 rules applied. Total rules applied 1819 place count 850 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1820 place count 849 transition count 1306
Iterating global reduction 5 with 1 rules applied. Total rules applied 1821 place count 849 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1822 place count 848 transition count 1298
Iterating global reduction 5 with 1 rules applied. Total rules applied 1823 place count 848 transition count 1298
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 5 with 293 rules applied. Total rules applied 2116 place count 700 transition count 1153
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2120 place count 696 transition count 1149
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2125 place count 695 transition count 1149
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 2126 place count 695 transition count 1148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2127 place count 694 transition count 1148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2127 place count 694 transition count 1147
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 2129 place count 693 transition count 1147
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2131 place count 691 transition count 1145
Iterating global reduction 7 with 2 rules applied. Total rules applied 2133 place count 691 transition count 1145
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 2135 place count 691 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2136 place count 690 transition count 1143
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 2138 place count 689 transition count 1148
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2140 place count 687 transition count 1146
Reduce places removed 7 places and 0 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 9 with 10 rules applied. Total rules applied 2150 place count 680 transition count 1143
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2153 place count 677 transition count 1143
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 11 Pre rules applied. Total rules applied 2153 place count 677 transition count 1132
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 23 rules applied. Total rules applied 2176 place count 665 transition count 1132
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 11 with 7 rules applied. Total rules applied 2183 place count 658 transition count 1132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2183 place count 658 transition count 1131
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 2185 place count 657 transition count 1131
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 12 with 22 rules applied. Total rules applied 2207 place count 646 transition count 1120
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 2213 place count 640 transition count 1114
Iterating global reduction 12 with 6 rules applied. Total rules applied 2219 place count 640 transition count 1114
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2222 place count 637 transition count 1111
Iterating global reduction 12 with 3 rules applied. Total rules applied 2225 place count 637 transition count 1111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2228 place count 637 transition count 1108
Applied a total of 2228 rules in 865 ms. Remains 637 /1791 variables (removed 1154) and now considering 1108/2283 (removed 1175) transitions.
// Phase 1: matrix 1108 rows 637 cols
[2024-05-21 03:15:49] [INFO ] Computed 107 invariants in 13 ms
[2024-05-21 03:15:50] [INFO ] Implicit Places using invariants in 1079 ms returned [1, 18, 19, 31, 48, 66, 87, 145, 155, 156, 157, 158, 160, 177, 195, 258, 269, 273, 274, 286, 287, 289, 306, 324, 344, 395, 396, 408, 409, 411, 428, 446, 466, 517, 518, 521, 533, 534, 535, 553, 575, 576, 577, 578]
[2024-05-21 03:15:50] [INFO ] Actually due to overlaps returned [553, 535, 48, 177, 306, 428, 31, 160, 157, 286, 289, 408, 411, 533, 575, 158, 287, 409, 534, 576, 1, 18, 155, 273, 274, 395, 396, 517, 518, 195, 577, 19, 66, 87, 145, 156, 324, 344, 446, 466, 521, 578]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1081 ms to find 42 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 595/1791 places, 1108/2283 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 593 transition count 1032
Reduce places removed 76 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 517 transition count 1031
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 516 transition count 1031
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 156 place count 516 transition count 1007
Deduced a syphon composed of 24 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 205 place count 491 transition count 1007
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 217 place count 487 transition count 999
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 225 place count 479 transition count 999
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 228 place count 476 transition count 996
Iterating global reduction 5 with 3 rules applied. Total rules applied 231 place count 476 transition count 996
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 234 place count 476 transition count 993
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 6 with 68 rules applied. Total rules applied 302 place count 442 transition count 959
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 303 place count 441 transition count 958
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 441 transition count 958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 305 place count 441 transition count 957
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 7 with 4 rules applied. Total rules applied 309 place count 439 transition count 958
Applied a total of 309 rules in 120 ms. Remains 439 /595 variables (removed 156) and now considering 958/1108 (removed 150) transitions.
// Phase 1: matrix 958 rows 439 cols
[2024-05-21 03:15:50] [INFO ] Computed 58 invariants in 13 ms
[2024-05-21 03:15:51] [INFO ] Implicit Places using invariants in 913 ms returned [88, 94, 99, 163, 180, 193, 270, 276, 281, 358, 364, 369, 436]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 915 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 426/1791 places, 958/2283 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 426 transition count 957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 425 transition count 957
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 418 transition count 950
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 418 transition count 950
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 23 place count 411 transition count 943
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 411 transition count 943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 408 transition count 940
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 408 transition count 940
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 46 place count 403 transition count 935
Applied a total of 46 rules in 134 ms. Remains 403 /426 variables (removed 23) and now considering 935/958 (removed 23) transitions.
// Phase 1: matrix 935 rows 403 cols
[2024-05-21 03:15:51] [INFO ] Computed 45 invariants in 15 ms
[2024-05-21 03:15:52] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-05-21 03:15:52] [INFO ] Invariant cache hit.
[2024-05-21 03:15:53] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2582 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 403/1791 places, 935/2283 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5698 ms. Remains : 403/1791 places, 935/2283 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-08
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLFireability-08 finished in 5929 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(p0))))'
Support contains 1 out of 1791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1786 transition count 2266
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1786 transition count 2266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 1782 transition count 2262
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 1782 transition count 2262
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 1782 transition count 2261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1780 transition count 2252
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1780 transition count 2252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1779 transition count 2244
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1779 transition count 2244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1778 transition count 2243
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1778 transition count 2243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1777 transition count 2235
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1777 transition count 2235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1776 transition count 2227
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1776 transition count 2227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1775 transition count 2226
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1775 transition count 2226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1774 transition count 2218
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1774 transition count 2218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1773 transition count 2210
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1773 transition count 2210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1772 transition count 2209
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1772 transition count 2209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1771 transition count 2201
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1771 transition count 2201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1770 transition count 2193
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1770 transition count 2193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1769 transition count 2192
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1769 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1768 transition count 2184
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1768 transition count 2184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1767 transition count 2176
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1767 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1766 transition count 2175
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1766 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1765 transition count 2167
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1765 transition count 2167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1764 transition count 2159
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1764 transition count 2159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1763 transition count 2158
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1763 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1762 transition count 2150
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1762 transition count 2150
Applied a total of 59 rules in 2820 ms. Remains 1762 /1791 variables (removed 29) and now considering 2150/2283 (removed 133) transitions.
// Phase 1: matrix 2150 rows 1762 cols
[2024-05-21 03:15:56] [INFO ] Computed 188 invariants in 23 ms
[2024-05-21 03:15:58] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2024-05-21 03:15:58] [INFO ] Invariant cache hit.
[2024-05-21 03:16:07] [INFO ] Implicit Places using invariants and state equation in 8622 ms returned []
Implicit Place search using SMT with State Equation took 10282 ms to find 0 implicit places.
Running 2149 sub problems to find dead transitions.
[2024-05-21 03:16:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
(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 13.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 3.0)
(s48 6.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 18.0)
(s59 1.0)
(s60 1.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 0.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 5.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 6.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 3.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 1.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 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1761/3912 variables, and 110 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 110/142 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1761 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1761/3912 variables, and 110 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 110/142 constraints, State Equation: 0/1762 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 0/0 constraints]
After SMT, in 61061ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 61119ms
Starting structural reductions in LTL mode, iteration 1 : 1762/1791 places, 2150/2283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74229 ms. Remains : 1762/1791 places, 2150/2283 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLFireability-10 finished in 74452 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 3 out of 1791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1786 transition count 2271
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1786 transition count 2271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 1783 transition count 2268
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 1783 transition count 2268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1783 transition count 2267
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 1781 transition count 2258
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 1781 transition count 2258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1780 transition count 2250
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1780 transition count 2250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1779 transition count 2249
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1779 transition count 2249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1778 transition count 2241
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1778 transition count 2241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1777 transition count 2233
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1777 transition count 2233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1776 transition count 2232
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1776 transition count 2232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1775 transition count 2224
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1775 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1774 transition count 2216
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1774 transition count 2216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1773 transition count 2215
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1773 transition count 2215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1772 transition count 2207
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1772 transition count 2207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1771 transition count 2199
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1771 transition count 2199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1770 transition count 2198
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1770 transition count 2198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1769 transition count 2190
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1769 transition count 2190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1768 transition count 2182
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1768 transition count 2182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1767 transition count 2181
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1767 transition count 2181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1766 transition count 2173
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1766 transition count 2173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1765 transition count 2165
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1765 transition count 2165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1764 transition count 2164
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1764 transition count 2164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1763 transition count 2156
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1763 transition count 2156
Applied a total of 57 rules in 2672 ms. Remains 1763 /1791 variables (removed 28) and now considering 2156/2283 (removed 127) transitions.
// Phase 1: matrix 2156 rows 1763 cols
[2024-05-21 03:17:11] [INFO ] Computed 188 invariants in 37 ms
[2024-05-21 03:17:13] [INFO ] Implicit Places using invariants in 1910 ms returned []
[2024-05-21 03:17:13] [INFO ] Invariant cache hit.
[2024-05-21 03:17:22] [INFO ] Implicit Places using invariants and state equation in 9026 ms returned []
Implicit Place search using SMT with State Equation took 10952 ms to find 0 implicit places.
Running 2155 sub problems to find dead transitions.
[2024-05-21 03:17:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 2155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1762/3919 variables, and 106 constraints, problems are : Problem set: 0 solved, 2155 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 106/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 2155/2155 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1762 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 2155 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 1762/3919 variables, and 106 constraints, problems are : Problem set: 0 solved, 2155 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, Generalized P Invariants (flows): 106/142 constraints, State Equation: 0/1763 constraints, PredecessorRefiner: 0/2155 constraints, Known Traps: 0/0 constraints]
After SMT, in 61338ms problems are : Problem set: 0 solved, 2155 unsolved
Search for dead transitions found 0 dead transitions in 61364ms
Starting structural reductions in LTL mode, iteration 1 : 1763/1791 places, 2156/2283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74993 ms. Remains : 1763/1791 places, 2156/2283 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 4204 steps with 11 reset in 21 ms.
FORMULA ASLink-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLFireability-12 finished in 75181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 1790 transition count 1963
Reduce places removed 319 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 324 rules applied. Total rules applied 643 place count 1471 transition count 1958
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 646 place count 1468 transition count 1958
Performed 487 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 487 Pre rules applied. Total rules applied 646 place count 1468 transition count 1471
Deduced a syphon composed of 487 places in 5 ms
Ensure Unique test removed 44 places
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 1664 place count 937 transition count 1471
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1696 place count 933 transition count 1443
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1724 place count 905 transition count 1443
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1724 place count 905 transition count 1426
Deduced a syphon composed of 17 places in 5 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1775 place count 871 transition count 1426
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1775 place count 871 transition count 1410
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1807 place count 855 transition count 1410
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1811 place count 851 transition count 1394
Iterating global reduction 5 with 4 rules applied. Total rules applied 1815 place count 851 transition count 1394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1815 place count 851 transition count 1393
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 1817 place count 850 transition count 1393
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1819 place count 848 transition count 1384
Iterating global reduction 5 with 2 rules applied. Total rules applied 1821 place count 848 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1822 place count 847 transition count 1376
Iterating global reduction 5 with 1 rules applied. Total rules applied 1823 place count 847 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1824 place count 846 transition count 1368
Iterating global reduction 5 with 1 rules applied. Total rules applied 1825 place count 846 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1826 place count 845 transition count 1360
Iterating global reduction 5 with 1 rules applied. Total rules applied 1827 place count 845 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1828 place count 844 transition count 1352
Iterating global reduction 5 with 1 rules applied. Total rules applied 1829 place count 844 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1830 place count 843 transition count 1344
Iterating global reduction 5 with 1 rules applied. Total rules applied 1831 place count 843 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1832 place count 842 transition count 1336
Iterating global reduction 5 with 1 rules applied. Total rules applied 1833 place count 842 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1834 place count 841 transition count 1328
Iterating global reduction 5 with 1 rules applied. Total rules applied 1835 place count 841 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1836 place count 840 transition count 1320
Iterating global reduction 5 with 1 rules applied. Total rules applied 1837 place count 840 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1838 place count 839 transition count 1312
Iterating global reduction 5 with 1 rules applied. Total rules applied 1839 place count 839 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1840 place count 838 transition count 1304
Iterating global reduction 5 with 1 rules applied. Total rules applied 1841 place count 838 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1842 place count 837 transition count 1296
Iterating global reduction 5 with 1 rules applied. Total rules applied 1843 place count 837 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1844 place count 836 transition count 1288
Iterating global reduction 5 with 1 rules applied. Total rules applied 1845 place count 836 transition count 1288
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 5 with 284 rules applied. Total rules applied 2129 place count 693 transition count 1147
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2133 place count 689 transition count 1143
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2138 place count 688 transition count 1143
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 2139 place count 688 transition count 1142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2140 place count 687 transition count 1142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2140 place count 687 transition count 1141
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 2142 place count 686 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2144 place count 684 transition count 1139
Iterating global reduction 7 with 2 rules applied. Total rules applied 2146 place count 684 transition count 1139
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 2148 place count 684 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2149 place count 683 transition count 1137
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 2151 place count 682 transition count 1142
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2152 place count 682 transition count 1142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2154 place count 680 transition count 1140
Reduce places removed 8 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 9 with 12 rules applied. Total rules applied 2166 place count 672 transition count 1136
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2170 place count 668 transition count 1136
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2170 place count 668 transition count 1124
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2195 place count 655 transition count 1124
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 11 with 8 rules applied. Total rules applied 2203 place count 647 transition count 1124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2203 place count 647 transition count 1123
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 2205 place count 646 transition count 1123
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 2229 place count 634 transition count 1111
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 2236 place count 627 transition count 1104
Iterating global reduction 12 with 7 rules applied. Total rules applied 2243 place count 627 transition count 1104
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2246 place count 624 transition count 1101
Iterating global reduction 12 with 3 rules applied. Total rules applied 2249 place count 624 transition count 1101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2252 place count 624 transition count 1098
Applied a total of 2252 rules in 1007 ms. Remains 624 /1791 variables (removed 1167) and now considering 1098/2283 (removed 1185) transitions.
// Phase 1: matrix 1098 rows 624 cols
[2024-05-21 03:18:24] [INFO ] Computed 103 invariants in 11 ms
[2024-05-21 03:18:25] [INFO ] Implicit Places using invariants in 923 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 258, 262, 263, 275, 276, 278, 295, 313, 333, 384, 385, 397, 398, 400, 417, 435, 455, 506, 507, 510, 521, 522, 523, 541, 562, 563, 564, 565]
[2024-05-21 03:18:25] [INFO ] Actually due to overlaps returned [541, 523, 48, 167, 295, 417, 150, 31, 147, 275, 278, 397, 400, 521, 562, 148, 276, 398, 522, 563, 1, 18, 262, 263, 384, 385, 506, 507, 185, 564, 19, 66, 86, 137, 313, 333, 435, 455, 510, 565]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 926 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/1791 places, 1098/2283 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 583 transition count 1024
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 509 transition count 1023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 508 transition count 1023
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 151 place count 508 transition count 1000
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 198 place count 484 transition count 1000
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 210 place count 480 transition count 992
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 218 place count 472 transition count 992
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 221 place count 469 transition count 989
Iterating global reduction 5 with 3 rules applied. Total rules applied 224 place count 469 transition count 989
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 227 place count 469 transition count 986
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 293 place count 436 transition count 953
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 294 place count 435 transition count 952
Iterating global reduction 6 with 1 rules applied. Total rules applied 295 place count 435 transition count 952
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 299 place count 433 transition count 953
Applied a total of 299 rules in 117 ms. Remains 433 /584 variables (removed 151) and now considering 953/1098 (removed 145) transitions.
// Phase 1: matrix 953 rows 433 cols
[2024-05-21 03:18:25] [INFO ] Computed 57 invariants in 7 ms
[2024-05-21 03:18:26] [INFO ] Implicit Places using invariants in 744 ms returned [88, 94, 99, 161, 178, 184, 189, 266, 272, 277, 354, 360, 365, 430]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 746 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 419/1791 places, 953/2283 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 419 transition count 952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 418 transition count 952
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 410 transition count 944
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 410 transition count 944
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 402 transition count 936
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 402 transition count 936
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 398 transition count 932
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 398 transition count 932
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 393 transition count 927
Applied a total of 52 rules in 57 ms. Remains 393 /419 variables (removed 26) and now considering 927/953 (removed 26) transitions.
// Phase 1: matrix 927 rows 393 cols
[2024-05-21 03:18:26] [INFO ] Computed 43 invariants in 7 ms
[2024-05-21 03:18:27] [INFO ] Implicit Places using invariants in 789 ms returned []
[2024-05-21 03:18:27] [INFO ] Invariant cache hit.
[2024-05-21 03:18:28] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 393/1791 places, 927/2283 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4964 ms. Remains : 393/1791 places, 927/2283 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-13
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLFireability-13 finished in 5040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 1790 transition count 1963
Reduce places removed 319 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 324 rules applied. Total rules applied 643 place count 1471 transition count 1958
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 646 place count 1468 transition count 1958
Performed 486 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 486 Pre rules applied. Total rules applied 646 place count 1468 transition count 1472
Deduced a syphon composed of 486 places in 5 ms
Ensure Unique test removed 44 places
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 1662 place count 938 transition count 1472
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1694 place count 934 transition count 1444
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1722 place count 906 transition count 1444
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1722 place count 906 transition count 1427
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1773 place count 872 transition count 1427
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1773 place count 872 transition count 1411
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1805 place count 856 transition count 1411
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1809 place count 852 transition count 1395
Iterating global reduction 5 with 4 rules applied. Total rules applied 1813 place count 852 transition count 1395
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1813 place count 852 transition count 1394
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1815 place count 851 transition count 1394
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1817 place count 849 transition count 1385
Iterating global reduction 5 with 2 rules applied. Total rules applied 1819 place count 849 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1820 place count 848 transition count 1377
Iterating global reduction 5 with 1 rules applied. Total rules applied 1821 place count 848 transition count 1377
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1822 place count 847 transition count 1369
Iterating global reduction 5 with 1 rules applied. Total rules applied 1823 place count 847 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1824 place count 846 transition count 1361
Iterating global reduction 5 with 1 rules applied. Total rules applied 1825 place count 846 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1826 place count 845 transition count 1353
Iterating global reduction 5 with 1 rules applied. Total rules applied 1827 place count 845 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1828 place count 844 transition count 1345
Iterating global reduction 5 with 1 rules applied. Total rules applied 1829 place count 844 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1830 place count 843 transition count 1337
Iterating global reduction 5 with 1 rules applied. Total rules applied 1831 place count 843 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1832 place count 842 transition count 1329
Iterating global reduction 5 with 1 rules applied. Total rules applied 1833 place count 842 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1834 place count 841 transition count 1321
Iterating global reduction 5 with 1 rules applied. Total rules applied 1835 place count 841 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1836 place count 840 transition count 1313
Iterating global reduction 5 with 1 rules applied. Total rules applied 1837 place count 840 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1838 place count 839 transition count 1305
Iterating global reduction 5 with 1 rules applied. Total rules applied 1839 place count 839 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1840 place count 838 transition count 1297
Iterating global reduction 5 with 1 rules applied. Total rules applied 1841 place count 838 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1842 place count 837 transition count 1289
Iterating global reduction 5 with 1 rules applied. Total rules applied 1843 place count 837 transition count 1289
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 5 with 286 rules applied. Total rules applied 2129 place count 693 transition count 1147
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2133 place count 689 transition count 1143
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2138 place count 688 transition count 1143
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 2139 place count 688 transition count 1142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2140 place count 687 transition count 1142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2140 place count 687 transition count 1141
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2142 place count 686 transition count 1141
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2144 place count 684 transition count 1139
Iterating global reduction 7 with 2 rules applied. Total rules applied 2146 place count 684 transition count 1139
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 2148 place count 684 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2149 place count 683 transition count 1137
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 2151 place count 682 transition count 1142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2153 place count 680 transition count 1140
Reduce places removed 8 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 9 with 12 rules applied. Total rules applied 2165 place count 672 transition count 1136
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2169 place count 668 transition count 1136
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2169 place count 668 transition count 1124
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2194 place count 655 transition count 1124
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 11 with 8 rules applied. Total rules applied 2202 place count 647 transition count 1124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2202 place count 647 transition count 1123
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 2204 place count 646 transition count 1123
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 2228 place count 634 transition count 1111
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 2235 place count 627 transition count 1104
Iterating global reduction 12 with 7 rules applied. Total rules applied 2242 place count 627 transition count 1104
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2245 place count 624 transition count 1101
Iterating global reduction 12 with 3 rules applied. Total rules applied 2248 place count 624 transition count 1101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2251 place count 624 transition count 1098
Applied a total of 2251 rules in 854 ms. Remains 624 /1791 variables (removed 1167) and now considering 1098/2283 (removed 1185) transitions.
// Phase 1: matrix 1098 rows 624 cols
[2024-05-21 03:18:29] [INFO ] Computed 103 invariants in 11 ms
[2024-05-21 03:18:30] [INFO ] Implicit Places using invariants in 1105 ms returned [1, 18, 19, 31, 48, 66, 87, 139, 149, 150, 152, 169, 187, 258, 262, 263, 275, 276, 278, 295, 313, 333, 384, 385, 397, 398, 400, 417, 435, 455, 506, 507, 510, 521, 522, 523, 541, 562, 563, 564, 565]
[2024-05-21 03:18:30] [INFO ] Actually due to overlaps returned [541, 523, 48, 169, 295, 417, 152, 31, 149, 275, 278, 397, 400, 521, 562, 150, 276, 398, 522, 563, 1, 18, 262, 263, 384, 385, 506, 507, 187, 564, 19, 66, 87, 139, 313, 333, 435, 455, 510, 565]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1108 ms to find 40 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/1791 places, 1098/2283 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 583 transition count 1023
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 508 transition count 1023
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 151 place count 508 transition count 1000
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 484 transition count 1000
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 210 place count 480 transition count 992
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 218 place count 472 transition count 992
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 221 place count 469 transition count 989
Iterating global reduction 4 with 3 rules applied. Total rules applied 224 place count 469 transition count 989
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 227 place count 469 transition count 986
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 293 place count 436 transition count 953
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 294 place count 435 transition count 952
Iterating global reduction 5 with 1 rules applied. Total rules applied 295 place count 435 transition count 952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 435 transition count 951
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 300 place count 433 transition count 952
Applied a total of 300 rules in 135 ms. Remains 433 /584 variables (removed 151) and now considering 952/1098 (removed 146) transitions.
// Phase 1: matrix 952 rows 433 cols
[2024-05-21 03:18:30] [INFO ] Computed 57 invariants in 13 ms
[2024-05-21 03:18:31] [INFO ] Implicit Places using invariants in 757 ms returned [89, 96, 101, 161, 178, 184, 189, 266, 272, 277, 354, 360, 365, 430]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 760 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 419/1791 places, 952/2283 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 419 transition count 951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 418 transition count 951
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 410 transition count 943
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 410 transition count 943
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 402 transition count 935
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 402 transition count 935
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 398 transition count 931
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 398 transition count 931
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 52 place count 393 transition count 926
Applied a total of 52 rules in 90 ms. Remains 393 /419 variables (removed 26) and now considering 926/952 (removed 26) transitions.
// Phase 1: matrix 926 rows 393 cols
[2024-05-21 03:18:31] [INFO ] Computed 43 invariants in 12 ms
[2024-05-21 03:18:32] [INFO ] Implicit Places using invariants in 841 ms returned []
[2024-05-21 03:18:32] [INFO ] Invariant cache hit.
[2024-05-21 03:18:33] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 393/1791 places, 926/2283 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4996 ms. Remains : 393/1791 places, 926/2283 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04b-LTLFireability-14
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04b-LTLFireability-14 finished in 5064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Found a Shortening insensitive property : ASLink-PT-04b-LTLFireability-00
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1791 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1791/1791 places, 2283/2283 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 320 place count 1790 transition count 1962
Reduce places removed 320 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 325 rules applied. Total rules applied 645 place count 1470 transition count 1957
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 648 place count 1467 transition count 1957
Performed 486 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 486 Pre rules applied. Total rules applied 648 place count 1467 transition count 1471
Deduced a syphon composed of 486 places in 5 ms
Ensure Unique test removed 44 places
Reduce places removed 530 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 1664 place count 937 transition count 1471
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 3 with 32 rules applied. Total rules applied 1696 place count 933 transition count 1443
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 1724 place count 905 transition count 1443
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 1724 place count 905 transition count 1426
Deduced a syphon composed of 17 places in 4 ms
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 1775 place count 871 transition count 1426
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 1775 place count 871 transition count 1410
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1807 place count 855 transition count 1410
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1811 place count 851 transition count 1394
Iterating global reduction 5 with 4 rules applied. Total rules applied 1815 place count 851 transition count 1394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1815 place count 851 transition count 1393
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1817 place count 850 transition count 1393
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1819 place count 848 transition count 1384
Iterating global reduction 5 with 2 rules applied. Total rules applied 1821 place count 848 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1822 place count 847 transition count 1376
Iterating global reduction 5 with 1 rules applied. Total rules applied 1823 place count 847 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1824 place count 846 transition count 1368
Iterating global reduction 5 with 1 rules applied. Total rules applied 1825 place count 846 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1826 place count 845 transition count 1360
Iterating global reduction 5 with 1 rules applied. Total rules applied 1827 place count 845 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1828 place count 844 transition count 1352
Iterating global reduction 5 with 1 rules applied. Total rules applied 1829 place count 844 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1830 place count 843 transition count 1344
Iterating global reduction 5 with 1 rules applied. Total rules applied 1831 place count 843 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1832 place count 842 transition count 1336
Iterating global reduction 5 with 1 rules applied. Total rules applied 1833 place count 842 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1834 place count 841 transition count 1328
Iterating global reduction 5 with 1 rules applied. Total rules applied 1835 place count 841 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1836 place count 840 transition count 1320
Iterating global reduction 5 with 1 rules applied. Total rules applied 1837 place count 840 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1838 place count 839 transition count 1312
Iterating global reduction 5 with 1 rules applied. Total rules applied 1839 place count 839 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1840 place count 838 transition count 1304
Iterating global reduction 5 with 1 rules applied. Total rules applied 1841 place count 838 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1842 place count 837 transition count 1296
Iterating global reduction 5 with 1 rules applied. Total rules applied 1843 place count 837 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1844 place count 836 transition count 1288
Iterating global reduction 5 with 1 rules applied. Total rules applied 1845 place count 836 transition count 1288
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 5 with 282 rules applied. Total rules applied 2127 place count 694 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2131 place count 690 transition count 1144
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2136 place count 689 transition count 1144
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 2137 place count 689 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2138 place count 688 transition count 1143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2138 place count 688 transition count 1142
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 2140 place count 687 transition count 1142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2142 place count 685 transition count 1140
Iterating global reduction 7 with 2 rules applied. Total rules applied 2144 place count 685 transition count 1140
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 2146 place count 685 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2147 place count 684 transition count 1138
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 2149 place count 683 transition count 1143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2151 place count 681 transition count 1141
Reduce places removed 8 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 9 with 12 rules applied. Total rules applied 2163 place count 673 transition count 1137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2167 place count 669 transition count 1137
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 2167 place count 669 transition count 1125
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 2192 place count 656 transition count 1125
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 11 with 8 rules applied. Total rules applied 2200 place count 648 transition count 1125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2200 place count 648 transition count 1124
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 2202 place count 647 transition count 1124
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 12 with 24 rules applied. Total rules applied 2226 place count 635 transition count 1112
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 2233 place count 628 transition count 1105
Iterating global reduction 12 with 7 rules applied. Total rules applied 2240 place count 628 transition count 1105
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 2243 place count 625 transition count 1102
Iterating global reduction 12 with 3 rules applied. Total rules applied 2246 place count 625 transition count 1102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2249 place count 625 transition count 1099
Applied a total of 2249 rules in 1055 ms. Remains 625 /1791 variables (removed 1166) and now considering 1099/2283 (removed 1184) transitions.
// Phase 1: matrix 1099 rows 625 cols
[2024-05-21 03:18:35] [INFO ] Computed 103 invariants in 18 ms
[2024-05-21 03:18:36] [INFO ] Implicit Places using invariants in 1444 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 256, 260, 261, 273, 274, 276, 293, 311, 331, 382, 383, 395, 396, 400, 435, 455, 506, 507, 510, 522, 523, 524, 542, 563, 564, 565, 566]
[2024-05-21 03:18:36] [INFO ] Actually due to overlaps returned [542, 524, 48, 167, 293, 150, 31, 147, 273, 276, 395, 400, 522, 563, 148, 274, 396, 523, 564, 1, 18, 260, 261, 382, 383, 506, 507, 185, 565, 19, 66, 86, 137, 311, 331, 435, 455, 510, 566]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1447 ms to find 39 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 586/1791 places, 1099/2283 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 585 transition count 1028
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 514 transition count 1028
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 143 place count 514 transition count 1005
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 190 place count 490 transition count 1005
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 202 place count 486 transition count 997
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 210 place count 478 transition count 997
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 213 place count 475 transition count 994
Iterating global reduction 4 with 3 rules applied. Total rules applied 216 place count 475 transition count 994
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 219 place count 475 transition count 991
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 279 place count 445 transition count 961
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 444 transition count 960
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 444 transition count 960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 444 transition count 959
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 286 place count 442 transition count 960
Applied a total of 286 rules in 115 ms. Remains 442 /586 variables (removed 144) and now considering 960/1099 (removed 139) transitions.
// Phase 1: matrix 960 rows 442 cols
[2024-05-21 03:18:36] [INFO ] Computed 58 invariants in 12 ms
[2024-05-21 03:18:37] [INFO ] Implicit Places using invariants in 767 ms returned [88, 94, 99, 159, 176, 182, 187, 264, 270, 275, 359, 367, 373, 439]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 770 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 428/1791 places, 960/2283 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 428 transition count 959
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 427 transition count 959
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 419 transition count 951
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 419 transition count 951
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 411 transition count 943
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 411 transition count 943
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 406 transition count 938
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 406 transition count 938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 405 transition count 937
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 405 transition count 937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 404 transition count 936
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 404 transition count 936
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 58 place count 399 transition count 931
Applied a total of 58 rules in 115 ms. Remains 399 /428 variables (removed 29) and now considering 931/960 (removed 29) transitions.
// Phase 1: matrix 931 rows 399 cols
[2024-05-21 03:18:37] [INFO ] Computed 44 invariants in 12 ms
[2024-05-21 03:18:38] [INFO ] Implicit Places using invariants in 846 ms returned []
[2024-05-21 03:18:38] [INFO ] Invariant cache hit.
[2024-05-21 03:18:40] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2656 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 399/1791 places, 931/2283 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6159 ms. Remains : 399/1791 places, 931/2283 transitions.
Running random walk in product with property : ASLink-PT-04b-LTLFireability-00
Product exploration explored 100000 steps with 12455 reset in 530 ms.
Stack based approach found an accepted trace after 14847 steps with 1847 reset with depth 11 and stack size 11 in 97 ms.
Treatment of property ASLink-PT-04b-LTLFireability-00 finished in 7329 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-21 03:18:41] [INFO ] Flatten gal took : 95 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17263321940236178454
[2024-05-21 03:18:41] [INFO ] Too many transitions (2283) to apply POR reductions. Disabling POR matrices.
[2024-05-21 03:18:41] [INFO ] Applying decomposition
[2024-05-21 03:18:41] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17263321940236178454
Running compilation step : cd /tmp/ltsmin17263321940236178454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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 03:18:41] [INFO ] Flatten gal took : 99 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/graph10351735038818677300.txt' '-o' '/tmp/graph10351735038818677300.bin' '-w' '/tmp/graph10351735038818677300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10351735038818677300.bin' '-l' '-1' '-v' '-w' '/tmp/graph10351735038818677300.weights' '-q' '0' '-e' '0.001'
[2024-05-21 03:18:41] [INFO ] Decomposing Gal with order
[2024-05-21 03:18:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:18:42] [INFO ] Removed a total of 1849 redundant transitions.
[2024-05-21 03:18:42] [INFO ] Flatten gal took : 199 ms
[2024-05-21 03:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 70 ms.
[2024-05-21 03:18:42] [INFO ] Time to serialize gal into /tmp/LTLFireability2061448961938121839.gal : 26 ms
[2024-05-21 03:18:42] [INFO ] Time to serialize properties into /tmp/LTLFireability11590181649720450237.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/LTLFireability2061448961938121839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11590181649720450237.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 : !((F(("(i18.i1.i0.u442.p1273==1)")||(X("(i24.u563.p1620==1)")))))
Formula 0 simplified : G(!"(i18.i1.i0.u442.p1273==1)" & X!"(i24.u563.p1620==1)")
Compilation finished in 10700 ms.
Running link step : cd /tmp/ltsmin17263321940236178454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 107 ms.
Running LTSmin : cd /tmp/ltsmin17263321940236178454;'/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' '<>(((LTLAPp0==true)||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17263321940236178454;'/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' '<>(((LTLAPp0==true)||X((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17263321940236178454;'/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)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 03:42:54] [INFO ] Applying decomposition
[2024-05-21 03:42:54] [INFO ] Flatten gal took : 208 ms
[2024-05-21 03:42:54] [INFO ] Decomposing Gal with order
[2024-05-21 03:42:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 03:42:55] [INFO ] Removed a total of 1700 redundant transitions.
[2024-05-21 03:42:55] [INFO ] Flatten gal took : 414 ms
[2024-05-21 03:42:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2429 labels/synchronizations in 158 ms.
[2024-05-21 03:42:56] [INFO ] Time to serialize gal into /tmp/LTLFireability6946078178264558814.gal : 38 ms
[2024-05-21 03:42:56] [INFO ] Time to serialize properties into /tmp/LTLFireability14150563240778881251.ltl : 5 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/LTLFireability6946078178264558814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14150563240778881251.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 : !((F(("(i0.i1.i0.i0.i0.i0.i0.i0.i0.u159.p1273==1)")||(X("(i0.i1.i0.i0.i0.u194.p1620==1)")))))
Formula 0 simplified : G(!"(i0.i1.i0.i0.i0.i0.i0.i0.i0.u159.p1273==1)" & X!"(i0.i1.i0.i0.i0.u194.p1620==1)")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin17263321940236178454;'/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)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin17263321940236178454;'/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' '<>(((LTLAPp0==true)||X((LTLAPp1==true))))' '--buchi-type=spotba'

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-04b"
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-04b, 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-171620117700068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b 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 ;