fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r021-smll-171620127800053
Last Updated
July 7, 2024

About the Execution of 2023-gold for ASLink-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16190.439 3600000.00 12652256.00 2850.70 TFTTFFFFT?T?FFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620127800053.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 gold2023
Input is ASLink-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 795K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716412839319

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 21:20:42] [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-22 21:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:20:43] [INFO ] Load time of PNML (sax parser for PT used): 499 ms
[2024-05-22 21:20:43] [INFO ] Transformed 2430 places.
[2024-05-22 21:20:43] [INFO ] Transformed 3040 transitions.
[2024-05-22 21:20:43] [INFO ] Found NUPN structural information;
[2024-05-22 21:20:43] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 692 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-05b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 2430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 2284 transition count 2894
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 2284 transition count 2894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 293 place count 2284 transition count 2893
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 349 place count 2228 transition count 2804
Iterating global reduction 1 with 56 rules applied. Total rules applied 405 place count 2228 transition count 2804
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 422 place count 2228 transition count 2787
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 431 place count 2219 transition count 2778
Iterating global reduction 2 with 9 rules applied. Total rules applied 440 place count 2219 transition count 2778
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 444 place count 2215 transition count 2767
Iterating global reduction 2 with 4 rules applied. Total rules applied 448 place count 2215 transition count 2767
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 451 place count 2212 transition count 2764
Iterating global reduction 2 with 3 rules applied. Total rules applied 454 place count 2212 transition count 2764
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 456 place count 2210 transition count 2762
Iterating global reduction 2 with 2 rules applied. Total rules applied 458 place count 2210 transition count 2762
Applied a total of 458 rules in 2193 ms. Remains 2210 /2430 variables (removed 220) and now considering 2762/3040 (removed 278) transitions.
// Phase 1: matrix 2762 rows 2210 cols
[2024-05-22 21:20:46] [INFO ] Computed 238 invariants in 155 ms
[2024-05-22 21:20:47] [INFO ] Implicit Places using invariants in 1953 ms returned []
[2024-05-22 21:20:47] [INFO ] Invariant cache hit.
[2024-05-22 21:20:57] [INFO ] Implicit Places using invariants and state equation in 9035 ms returned [2044, 2055, 2066, 2074, 2082, 2090, 2098, 2109, 2117, 2125, 2136]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 11031 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2199/2430 places, 2762/3040 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2187 transition count 2750
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2187 transition count 2750
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 2177 transition count 2740
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 2177 transition count 2740
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 2169 transition count 2732
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 2169 transition count 2732
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 2166 transition count 2729
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 2166 transition count 2729
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 2164 transition count 2727
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 2164 transition count 2727
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 2162 transition count 2725
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 2162 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 2161 transition count 2724
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 2161 transition count 2724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 2160 transition count 2723
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 2160 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 2159 transition count 2722
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 2159 transition count 2722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 2158 transition count 2721
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 2158 transition count 2721
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 2157 transition count 2720
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 2157 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 2156 transition count 2719
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 2156 transition count 2719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 2155 transition count 2718
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 2155 transition count 2718
Applied a total of 88 rules in 2109 ms. Remains 2155 /2199 variables (removed 44) and now considering 2718/2762 (removed 44) transitions.
// Phase 1: matrix 2718 rows 2155 cols
[2024-05-22 21:20:59] [INFO ] Computed 227 invariants in 86 ms
[2024-05-22 21:21:01] [INFO ] Implicit Places using invariants in 1906 ms returned []
[2024-05-22 21:21:01] [INFO ] Invariant cache hit.
[2024-05-22 21:21:02] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 3868 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2155/2430 places, 2718/3040 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19203 ms. Remains : 2155/2430 places, 2718/3040 transitions.
Support contains 51 out of 2155 places after structural reductions.
[2024-05-22 21:21:03] [INFO ] Flatten gal took : 442 ms
[2024-05-22 21:21:04] [INFO ] Flatten gal took : 250 ms
[2024-05-22 21:21:04] [INFO ] Input system was already deterministic with 2718 transitions.
Support contains 49 out of 2155 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 30) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-22 21:21:05] [INFO ] Invariant cache hit.
[2024-05-22 21:21:07] [INFO ] [Real]Absence check using 57 positive place invariants in 59 ms returned sat
[2024-05-22 21:21:07] [INFO ] [Real]Absence check using 57 positive and 170 generalized place invariants in 208 ms returned sat
[2024-05-22 21:21:11] [INFO ] After 6263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-22 21:21:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 61 ms returned sat
[2024-05-22 21:21:13] [INFO ] [Nat]Absence check using 57 positive and 170 generalized place invariants in 200 ms returned sat
[2024-05-22 21:21:36] [INFO ] After 21876ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2024-05-22 21:21:36] [INFO ] After 21882ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-22 21:21:36] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 27 out of 2155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Drop transitions removed 379 transitions
Trivial Post-agglo rules discarded 379 transitions
Performed 379 trivial Post agglomeration. Transition count delta: 379
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 2155 transition count 2339
Reduce places removed 379 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 384 rules applied. Total rules applied 763 place count 1776 transition count 2334
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 769 place count 1773 transition count 2331
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 772 place count 1770 transition count 2331
Performed 576 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 576 Pre rules applied. Total rules applied 772 place count 1770 transition count 1755
Deduced a syphon composed of 576 places in 5 ms
Ensure Unique test removed 51 places
Reduce places removed 627 places and 0 transitions.
Iterating global reduction 4 with 1203 rules applied. Total rules applied 1975 place count 1143 transition count 1755
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2014 place count 1138 transition count 1721
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2048 place count 1104 transition count 1721
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 2048 place count 1104 transition count 1703
Deduced a syphon composed of 18 places in 7 ms
Ensure Unique test removed 18 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 2102 place count 1068 transition count 1703
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 2102 place count 1068 transition count 1686
Deduced a syphon composed of 17 places in 17 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 2136 place count 1051 transition count 1686
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2138 place count 1049 transition count 1684
Iterating global reduction 6 with 2 rules applied. Total rules applied 2140 place count 1049 transition count 1684
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2140 place count 1049 transition count 1683
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2142 place count 1048 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2143 place count 1047 transition count 1682
Iterating global reduction 6 with 1 rules applied. Total rules applied 2144 place count 1047 transition count 1682
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 8 ms
Ensure Unique test removed 3 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 6 with 351 rules applied. Total rules applied 2495 place count 870 transition count 1508
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2498 place count 867 transition count 1505
Ensure Unique test removed 1 places
Iterating global reduction 6 with 4 rules applied. Total rules applied 2502 place count 866 transition count 1505
Drop transitions 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 2503 place count 866 transition count 1504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2504 place count 865 transition count 1504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2504 place count 865 transition count 1503
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2506 place count 864 transition count 1503
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2507 place count 863 transition count 1502
Iterating global reduction 8 with 1 rules applied. Total rules applied 2508 place count 863 transition count 1502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions 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 2510 place count 863 transition count 1500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2511 place count 862 transition count 1500
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2513 place count 861 transition count 1506
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 2520 place count 861 transition count 1499
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2527 place count 854 transition count 1499
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2531 place count 854 transition count 1495
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2535 place count 850 transition count 1495
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2540 place count 850 transition count 1495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2541 place count 849 transition count 1494
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2556 place count 839 transition count 1489
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2561 place count 834 transition count 1489
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2561 place count 834 transition count 1474
Deduced a syphon composed of 15 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2592 place count 818 transition count 1474
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2598 place count 812 transition count 1474
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2598 place count 812 transition count 1473
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2600 place count 811 transition count 1473
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2622 place count 800 transition count 1462
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2627 place count 795 transition count 1457
Iterating global reduction 15 with 5 rules applied. Total rules applied 2632 place count 795 transition count 1457
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2637 place count 795 transition count 1452
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2642 place count 790 transition count 1452
Applied a total of 2642 rules in 1178 ms. Remains 790 /2155 variables (removed 1365) and now considering 1452/2718 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1179 ms. Remains : 790/2155 places, 1452/2718 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 111330 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111330 steps, saw 34746 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 1452 rows 790 cols
[2024-05-22 21:21:41] [INFO ] Computed 132 invariants in 22 ms
[2024-05-22 21:21:42] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2024-05-22 21:21:42] [INFO ] [Real]Absence check using 37 positive and 95 generalized place invariants in 40 ms returned sat
[2024-05-22 21:21:42] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-22 21:21:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-05-22 21:21:42] [INFO ] [Nat]Absence check using 37 positive and 95 generalized place invariants in 54 ms returned sat
[2024-05-22 21:21:47] [INFO ] After 4489ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :8
[2024-05-22 21:21:48] [INFO ] After 5461ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :8
Attempting to minimize the solution found.
Minimization took 478 ms.
[2024-05-22 21:21:49] [INFO ] After 6789ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :8
Fused 17 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 510 ms.
Support contains 14 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1452/1452 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 790 transition count 1449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 787 transition count 1449
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 787 transition count 1448
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 786 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 785 transition count 1440
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 785 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 784 transition count 1432
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 784 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 783 transition count 1424
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 783 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 782 transition count 1416
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 782 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 781 transition count 1408
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 781 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 780 transition count 1400
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 780 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 779 transition count 1392
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 779 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 778 transition count 1384
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 778 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 777 transition count 1376
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 777 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 776 transition count 1368
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 776 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 775 transition count 1360
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 775 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 774 transition count 1352
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 774 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 773 transition count 1344
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 773 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 772 transition count 1336
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 772 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 771 transition count 1328
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 771 transition count 1328
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 769 transition count 1326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 768 transition count 1325
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 768 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 767 transition count 1323
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 767 transition count 1323
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 767 transition count 1323
Applied a total of 47 rules in 441 ms. Remains 767 /790 variables (removed 23) and now considering 1323/1452 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 441 ms. Remains : 767/790 places, 1323/1452 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1323 rows 767 cols
[2024-05-22 21:21:50] [INFO ] Computed 132 invariants in 26 ms
[2024-05-22 21:21:51] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2024-05-22 21:21:51] [INFO ] [Real]Absence check using 37 positive and 95 generalized place invariants in 35 ms returned sat
[2024-05-22 21:21:51] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 21:21:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2024-05-22 21:21:51] [INFO ] [Nat]Absence check using 37 positive and 95 generalized place invariants in 51 ms returned sat
[2024-05-22 21:21:53] [INFO ] After 1850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 21:21:54] [INFO ] After 2636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 478 ms.
[2024-05-22 21:21:54] [INFO ] After 3582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 229 ms.
Support contains 12 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 1323/1323 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 767 transition count 1321
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 765 transition count 1321
Applied a total of 4 rules in 57 ms. Remains 765 /767 variables (removed 2) and now considering 1321/1323 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 765/767 places, 1321/1323 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 216575 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216575 steps, saw 45309 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1321 rows 765 cols
[2024-05-22 21:21:59] [INFO ] Computed 132 invariants in 17 ms
[2024-05-22 21:21:59] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2024-05-22 21:21:59] [INFO ] [Real]Absence check using 37 positive and 95 generalized place invariants in 34 ms returned sat
[2024-05-22 21:22:00] [INFO ] After 1278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 21:22:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 19 ms returned sat
[2024-05-22 21:22:00] [INFO ] [Nat]Absence check using 37 positive and 95 generalized place invariants in 56 ms returned sat
[2024-05-22 21:22:02] [INFO ] After 1746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 21:22:03] [INFO ] After 2896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 523 ms.
[2024-05-22 21:22:04] [INFO ] After 3912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 352 ms.
Support contains 12 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1321/1321 transitions.
Applied a total of 0 rules in 46 ms. Remains 765 /765 variables (removed 0) and now considering 1321/1321 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 765/765 places, 1321/1321 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1321/1321 transitions.
Applied a total of 0 rules in 43 ms. Remains 765 /765 variables (removed 0) and now considering 1321/1321 (removed 0) transitions.
[2024-05-22 21:22:04] [INFO ] Invariant cache hit.
[2024-05-22 21:22:06] [INFO ] Implicit Places using invariants in 1187 ms returned [1, 18, 19, 31, 51, 69, 138, 142, 151, 152, 154, 171, 189, 226, 229, 263, 267, 268, 279, 280, 282, 299, 317, 357, 391, 395, 396, 407, 408, 410, 427, 445, 514, 518, 519, 530, 531, 533, 550, 568, 643, 647, 648, 651, 662, 663, 664, 682, 703, 704, 705, 706]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 1202 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 713/765 places, 1321/1321 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 713 transition count 1232
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 98 rules applied. Total rules applied 187 place count 624 transition count 1223
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 191 place count 620 transition count 1223
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 191 place count 620 transition count 1197
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 244 place count 593 transition count 1197
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 256 place count 589 transition count 1189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 264 place count 581 transition count 1189
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 267 place count 578 transition count 1186
Iterating global reduction 5 with 3 rules applied. Total rules applied 270 place count 578 transition count 1186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 273 place count 578 transition count 1183
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 345 place count 542 transition count 1147
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 350 place count 537 transition count 1142
Iterating global reduction 6 with 5 rules applied. Total rules applied 355 place count 537 transition count 1142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 360 place count 537 transition count 1137
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 364 place count 535 transition count 1138
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 376 place count 535 transition count 1126
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 389 place count 522 transition count 1126
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 403 place count 522 transition count 1126
Applied a total of 403 rules in 278 ms. Remains 522 /713 variables (removed 191) and now considering 1126/1321 (removed 195) transitions.
// Phase 1: matrix 1126 rows 522 cols
[2024-05-22 21:22:06] [INFO ] Computed 74 invariants in 10 ms
[2024-05-22 21:22:06] [INFO ] Implicit Places using invariants in 600 ms returned [76, 92, 98, 101, 103, 106, 107, 161, 179, 185, 187, 190, 195, 196, 249, 268, 274, 277, 279, 284, 285, 338, 354, 360, 363, 365, 370, 371, 424, 440, 446, 449]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 603 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 490/765 places, 1126/1321 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 477 transition count 1113
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 477 transition count 1113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 472 transition count 1108
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 472 transition count 1108
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 58 place count 461 transition count 1097
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 461 transition count 1083
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 86 place count 447 transition count 1083
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 447 transition count 1078
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 442 transition count 1078
Applied a total of 96 rules in 128 ms. Remains 442 /490 variables (removed 48) and now considering 1078/1126 (removed 48) transitions.
// Phase 1: matrix 1078 rows 442 cols
[2024-05-22 21:22:07] [INFO ] Computed 42 invariants in 13 ms
[2024-05-22 21:22:07] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-22 21:22:07] [INFO ] Invariant cache hit.
[2024-05-22 21:22:09] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 442/765 places, 1078/1321 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4380 ms. Remains : 442/765 places, 1078/1321 transitions.
Incomplete random walk after 10000 steps, including 182 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 196712 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196712 steps, saw 68324 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-22 21:22:13] [INFO ] Invariant cache hit.
[2024-05-22 21:22:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-22 21:22:13] [INFO ] [Real]Absence check using 10 positive and 32 generalized place invariants in 20 ms returned sat
[2024-05-22 21:22:13] [INFO ] After 629ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2024-05-22 21:22:14] [INFO ] After 936ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:3
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-22 21:22:14] [INFO ] After 1318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:3
[2024-05-22 21:22:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-22 21:22:14] [INFO ] [Nat]Absence check using 10 positive and 32 generalized place invariants in 27 ms returned sat
[2024-05-22 21:22:16] [INFO ] After 1635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 21:22:16] [INFO ] After 2156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 318 ms.
[2024-05-22 21:22:17] [INFO ] After 2772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 191 ms.
Support contains 12 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1078/1078 transitions.
Applied a total of 0 rules in 17 ms. Remains 442 /442 variables (removed 0) and now considering 1078/1078 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 442/442 places, 1078/1078 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1078/1078 transitions.
Applied a total of 0 rules in 16 ms. Remains 442 /442 variables (removed 0) and now considering 1078/1078 (removed 0) transitions.
[2024-05-22 21:22:17] [INFO ] Invariant cache hit.
[2024-05-22 21:22:18] [INFO ] Implicit Places using invariants in 683 ms returned []
[2024-05-22 21:22:18] [INFO ] Invariant cache hit.
[2024-05-22 21:22:20] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2712 ms to find 0 implicit places.
[2024-05-22 21:22:20] [INFO ] Redundant transitions in 131 ms returned []
[2024-05-22 21:22:20] [INFO ] Invariant cache hit.
[2024-05-22 21:22:21] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3782 ms. Remains : 442/442 places, 1078/1078 transitions.
Applied a total of 0 rules in 26 ms. Remains 442 /442 variables (removed 0) and now considering 1078/1078 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-22 21:22:21] [INFO ] Invariant cache hit.
[2024-05-22 21:22:21] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-22 21:22:21] [INFO ] [Real]Absence check using 10 positive and 32 generalized place invariants in 20 ms returned sat
[2024-05-22 21:22:22] [INFO ] After 603ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:3
[2024-05-22 21:22:22] [INFO ] After 931ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:3
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-22 21:22:22] [INFO ] After 1339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:3
[2024-05-22 21:22:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-22 21:22:22] [INFO ] [Nat]Absence check using 10 positive and 32 generalized place invariants in 29 ms returned sat
[2024-05-22 21:22:24] [INFO ] After 1539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-22 21:22:24] [INFO ] After 2054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 281 ms.
[2024-05-22 21:22:25] [INFO ] After 2677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA ASLink-PT-05b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 86 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G((p1||X(p0)))))'
Support contains 2 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 2143 transition count 2691
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 2143 transition count 2691
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2142 transition count 2690
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2141 transition count 2689
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2141 transition count 2689
Applied a total of 29 rules in 1401 ms. Remains 2141 /2155 variables (removed 14) and now considering 2689/2718 (removed 29) transitions.
// Phase 1: matrix 2689 rows 2141 cols
[2024-05-22 21:22:26] [INFO ] Computed 227 invariants in 32 ms
[2024-05-22 21:22:28] [INFO ] Implicit Places using invariants in 1818 ms returned []
[2024-05-22 21:22:28] [INFO ] Invariant cache hit.
[2024-05-22 21:22:30] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 3717 ms to find 0 implicit places.
[2024-05-22 21:22:30] [INFO ] Invariant cache hit.
[2024-05-22 21:22:33] [INFO ] Dead Transitions using invariants and state equation in 2509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2141/2155 places, 2689/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7639 ms. Remains : 2141/2155 places, 2689/2718 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 321 ms :[true, (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s1071 1), p1:(EQ s1905 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-01 finished in 8074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 3 out of 2155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 2154 transition count 2322
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 400 rules applied. Total rules applied 795 place count 1759 transition count 2317
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 798 place count 1756 transition count 2317
Performed 581 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 581 Pre rules applied. Total rules applied 798 place count 1756 transition count 1736
Deduced a syphon composed of 581 places in 7 ms
Ensure Unique test removed 53 places
Reduce places removed 634 places and 0 transitions.
Iterating global reduction 3 with 1215 rules applied. Total rules applied 2013 place count 1122 transition count 1736
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2052 place count 1117 transition count 1702
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2086 place count 1083 transition count 1702
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2086 place count 1083 transition count 1682
Deduced a syphon composed of 20 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 2146 place count 1043 transition count 1682
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 2146 place count 1043 transition count 1663
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 2184 place count 1024 transition count 1663
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2188 place count 1020 transition count 1652
Iterating global reduction 5 with 4 rules applied. Total rules applied 2192 place count 1020 transition count 1652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2192 place count 1020 transition count 1651
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2194 place count 1019 transition count 1651
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2197 place count 1016 transition count 1641
Iterating global reduction 5 with 3 rules applied. Total rules applied 2200 place count 1016 transition count 1641
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2202 place count 1014 transition count 1632
Iterating global reduction 5 with 2 rules applied. Total rules applied 2204 place count 1014 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2205 place count 1013 transition count 1624
Iterating global reduction 5 with 1 rules applied. Total rules applied 2206 place count 1013 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2207 place count 1012 transition count 1616
Iterating global reduction 5 with 1 rules applied. Total rules applied 2208 place count 1012 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2209 place count 1011 transition count 1608
Iterating global reduction 5 with 1 rules applied. Total rules applied 2210 place count 1011 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2211 place count 1010 transition count 1600
Iterating global reduction 5 with 1 rules applied. Total rules applied 2212 place count 1010 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2213 place count 1009 transition count 1592
Iterating global reduction 5 with 1 rules applied. Total rules applied 2214 place count 1009 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2215 place count 1008 transition count 1584
Iterating global reduction 5 with 1 rules applied. Total rules applied 2216 place count 1008 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2217 place count 1007 transition count 1576
Iterating global reduction 5 with 1 rules applied. Total rules applied 2218 place count 1007 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2219 place count 1006 transition count 1568
Iterating global reduction 5 with 1 rules applied. Total rules applied 2220 place count 1006 transition count 1568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2221 place count 1005 transition count 1560
Iterating global reduction 5 with 1 rules applied. Total rules applied 2222 place count 1005 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2223 place count 1004 transition count 1552
Iterating global reduction 5 with 1 rules applied. Total rules applied 2224 place count 1004 transition count 1552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2225 place count 1003 transition count 1544
Iterating global reduction 5 with 1 rules applied. Total rules applied 2226 place count 1003 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2227 place count 1002 transition count 1536
Iterating global reduction 5 with 1 rules applied. Total rules applied 2228 place count 1002 transition count 1536
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 5 with 345 rules applied. Total rules applied 2573 place count 828 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2576 place count 825 transition count 1362
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 2580 place count 824 transition count 1362
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2581 place count 824 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2582 place count 823 transition count 1361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2582 place count 823 transition count 1360
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2584 place count 822 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2585 place count 821 transition count 1359
Iterating global reduction 7 with 1 rules applied. Total rules applied 2586 place count 821 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2588 place count 821 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2589 place count 820 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2591 place count 819 transition count 1362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2593 place count 817 transition count 1360
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2608 place count 807 transition count 1355
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2613 place count 802 transition count 1355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2613 place count 802 transition count 1340
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2644 place count 786 transition count 1340
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2655 place count 775 transition count 1340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2655 place count 775 transition count 1339
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2657 place count 774 transition count 1339
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2689 place count 758 transition count 1323
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2699 place count 748 transition count 1313
Iterating global reduction 12 with 10 rules applied. Total rules applied 2709 place count 748 transition count 1313
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2714 place count 743 transition count 1308
Iterating global reduction 12 with 5 rules applied. Total rules applied 2719 place count 743 transition count 1308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2724 place count 743 transition count 1303
Applied a total of 2724 rules in 1412 ms. Remains 743 /2155 variables (removed 1412) and now considering 1303/2718 (removed 1415) transitions.
// Phase 1: matrix 1303 rows 743 cols
[2024-05-22 21:22:35] [INFO ] Computed 123 invariants in 22 ms
[2024-05-22 21:22:35] [INFO ] Implicit Places using invariants in 948 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 346, 381, 382, 394, 395, 397, 414, 432, 452, 503, 504, 516, 517, 519, 536, 554, 574, 625, 626, 629, 640, 641, 642, 660, 681, 682, 683, 684]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 952 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 693/2155 places, 1303/2718 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 693 transition count 1216
Reduce places removed 87 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 88 rules applied. Total rules applied 175 place count 606 transition count 1215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 605 transition count 1215
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 176 place count 605 transition count 1188
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 231 place count 577 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 243 place count 573 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 251 place count 565 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 562 transition count 1177
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 562 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 260 place count 562 transition count 1174
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 342 place count 521 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 346 place count 519 transition count 1134
Applied a total of 346 rules in 127 ms. Remains 519 /693 variables (removed 174) and now considering 1134/1303 (removed 169) transitions.
// Phase 1: matrix 1134 rows 519 cols
[2024-05-22 21:22:36] [INFO ] Computed 68 invariants in 15 ms
[2024-05-22 21:22:36] [INFO ] Implicit Places using invariants in 751 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 275, 352, 358, 363, 440, 446, 451, 516]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 753 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 503/2155 places, 1134/2718 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 503 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 502 transition count 1133
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 492 transition count 1123
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 492 transition count 1123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 482 transition count 1113
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 482 transition count 1113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 477 transition count 1108
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 477 transition count 1108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 472 transition count 1103
Applied a total of 62 rules in 115 ms. Remains 472 /503 variables (removed 31) and now considering 1103/1134 (removed 31) transitions.
// Phase 1: matrix 1103 rows 472 cols
[2024-05-22 21:22:36] [INFO ] Computed 52 invariants in 10 ms
[2024-05-22 21:22:37] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-22 21:22:37] [INFO ] Invariant cache hit.
[2024-05-22 21:22:39] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 2401 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 472/2155 places, 1103/2718 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5765 ms. Remains : 472/2155 places, 1103/2718 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s36 1) (EQ s145 1)), p0:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-04 finished in 6046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 2140 transition count 2681
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2140 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 2138 transition count 2672
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 2121 transition count 2578
Applied a total of 69 rules in 3401 ms. Remains 2121 /2155 variables (removed 34) and now considering 2578/2718 (removed 140) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:22:43] [INFO ] Computed 227 invariants in 49 ms
[2024-05-22 21:22:44] [INFO ] Implicit Places using invariants in 1518 ms returned []
[2024-05-22 21:22:44] [INFO ] Invariant cache hit.
[2024-05-22 21:22:51] [INFO ] Implicit Places using invariants and state equation in 6497 ms returned []
Implicit Place search using SMT with State Equation took 8032 ms to find 0 implicit places.
[2024-05-22 21:22:51] [INFO ] Invariant cache hit.
[2024-05-22 21:22:53] [INFO ] Dead Transitions using invariants and state equation in 2038 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2121/2155 places, 2578/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13474 ms. Remains : 2121/2155 places, 2578/2718 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1202 1) (EQ s1343 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-06 finished in 13609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p0)&&X(X((p1||G(p2))))))))'
Support contains 3 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2150 transition count 2706
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2150 transition count 2706
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 2146 transition count 2695
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 2146 transition count 2695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2146 transition count 2694
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 2143 transition count 2691
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 2143 transition count 2691
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 2141 transition count 2682
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 2141 transition count 2682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 2139 transition count 2673
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 2139 transition count 2673
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 2138 transition count 2672
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2664
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2656
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2647
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2639
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2630
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2622
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2613
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2613
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2605
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2596
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2588
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2579
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2579
Applied a total of 67 rules in 3886 ms. Remains 2122 /2155 variables (removed 33) and now considering 2579/2718 (removed 139) transitions.
// Phase 1: matrix 2579 rows 2122 cols
[2024-05-22 21:22:57] [INFO ] Computed 227 invariants in 36 ms
[2024-05-22 21:22:58] [INFO ] Implicit Places using invariants in 1728 ms returned []
[2024-05-22 21:22:58] [INFO ] Invariant cache hit.
[2024-05-22 21:23:00] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
[2024-05-22 21:23:00] [INFO ] Invariant cache hit.
[2024-05-22 21:23:03] [INFO ] Dead Transitions using invariants and state equation in 2894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2155 places, 2579/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10389 ms. Remains : 2122/2155 places, 2579/2718 transitions.
Stuttering acceptance computed with spot in 564 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s92 1), p1:(EQ s688 1), p2:(EQ s940 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLFireability-07 finished in 11001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 6 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2150 transition count 2706
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2150 transition count 2706
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 2146 transition count 2695
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 2146 transition count 2695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2146 transition count 2694
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 2143 transition count 2691
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 2143 transition count 2691
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 2141 transition count 2682
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 2141 transition count 2682
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 2139 transition count 2673
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 2139 transition count 2673
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 2138 transition count 2672
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 2138 transition count 2672
Applied a total of 35 rules in 1474 ms. Remains 2138 /2155 variables (removed 17) and now considering 2672/2718 (removed 46) transitions.
// Phase 1: matrix 2672 rows 2138 cols
[2024-05-22 21:23:05] [INFO ] Computed 227 invariants in 33 ms
[2024-05-22 21:23:07] [INFO ] Implicit Places using invariants in 1694 ms returned []
[2024-05-22 21:23:07] [INFO ] Invariant cache hit.
[2024-05-22 21:23:09] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 3877 ms to find 0 implicit places.
[2024-05-22 21:23:09] [INFO ] Invariant cache hit.
[2024-05-22 21:23:12] [INFO ] Dead Transitions using invariants and state equation in 3413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2138/2155 places, 2672/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8767 ms. Remains : 2138/2155 places, 2672/2718 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (AND (EQ s484 1) (EQ s625 1) (EQ s1538 1) (EQ s1906 1)) (EQ s1858 1)), p0:(EQ s822 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1558 ms.
Product exploration explored 100000 steps with 33333 reset in 1526 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05b-LTLFireability-08 finished in 12131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
Support contains 7 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 2140 transition count 2681
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2140 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 2138 transition count 2672
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 2121 transition count 2578
Applied a total of 69 rules in 3605 ms. Remains 2121 /2155 variables (removed 34) and now considering 2578/2718 (removed 140) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:23:19] [INFO ] Computed 227 invariants in 30 ms
[2024-05-22 21:23:22] [INFO ] Implicit Places using invariants in 2076 ms returned []
[2024-05-22 21:23:22] [INFO ] Invariant cache hit.
[2024-05-22 21:23:23] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
[2024-05-22 21:23:23] [INFO ] Invariant cache hit.
[2024-05-22 21:23:27] [INFO ] Dead Transitions using invariants and state equation in 3191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2121/2155 places, 2578/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10662 ms. Remains : 2121/2155 places, 2578/2718 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s1786 0) (EQ s1790 0) (EQ s1794 0) (EQ s111 0) (EQ s529 0)), p0:(AND (EQ s1648 0) (EQ s1951 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 205 reset in 488 ms.
Product exploration explored 100000 steps with 193 reset in 610 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 184793 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184793 steps, saw 34349 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:23:31] [INFO ] Invariant cache hit.
[2024-05-22 21:23:32] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:23:32] [INFO ] [Nat]Absence check using 54 positive place invariants in 31 ms returned sat
[2024-05-22 21:23:32] [INFO ] [Nat]Absence check using 54 positive and 173 generalized place invariants in 134 ms returned sat
[2024-05-22 21:23:35] [INFO ] After 2867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:23:36] [INFO ] Deduced a trap composed of 24 places in 654 ms of which 2 ms to minimize.
[2024-05-22 21:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 915 ms
[2024-05-22 21:23:36] [INFO ] After 3878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 213 ms.
[2024-05-22 21:23:36] [INFO ] After 4614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2121 transition count 2193
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 388 rules applied. Total rules applied 773 place count 1736 transition count 2190
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 776 place count 1734 transition count 2189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 1733 transition count 2189
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 777 place count 1733 transition count 1617
Deduced a syphon composed of 572 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1974 place count 1108 transition count 1617
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2013 place count 1103 transition count 1583
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2047 place count 1069 transition count 1583
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2047 place count 1069 transition count 1563
Deduced a syphon composed of 20 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2107 place count 1029 transition count 1563
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2107 place count 1029 transition count 1544
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2145 place count 1010 transition count 1544
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 2495 place count 834 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2499 place count 830 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2504 place count 829 transition count 1366
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2505 place count 829 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2506 place count 828 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2506 place count 828 transition count 1364
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2508 place count 827 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2510 place count 825 transition count 1362
Iterating global reduction 8 with 2 rules applied. Total rules applied 2512 place count 825 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2514 place count 825 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2515 place count 824 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2517 place count 823 transition count 1365
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2523 place count 823 transition count 1359
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2529 place count 817 transition count 1359
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2533 place count 817 transition count 1355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2537 place count 813 transition count 1355
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2542 place count 813 transition count 1355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2543 place count 812 transition count 1354
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2558 place count 802 transition count 1349
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2563 place count 797 transition count 1349
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2563 place count 797 transition count 1334
Deduced a syphon composed of 15 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2594 place count 781 transition count 1334
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2600 place count 775 transition count 1334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2600 place count 775 transition count 1333
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2624 place count 763 transition count 1322
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2629 place count 758 transition count 1317
Iterating global reduction 15 with 5 rules applied. Total rules applied 2634 place count 758 transition count 1317
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2639 place count 758 transition count 1312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2644 place count 753 transition count 1312
Applied a total of 2644 rules in 907 ms. Remains 753 /2121 variables (removed 1368) and now considering 1312/2578 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 753/2121 places, 1312/2578 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246413 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246413 steps, saw 52747 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1312 rows 753 cols
[2024-05-22 21:23:40] [INFO ] Computed 129 invariants in 14 ms
[2024-05-22 21:23:40] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:23:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-05-22 21:23:41] [INFO ] [Nat]Absence check using 37 positive and 92 generalized place invariants in 55 ms returned sat
[2024-05-22 21:23:42] [INFO ] After 1163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:23:42] [INFO ] After 1253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-22 21:23:42] [INFO ] After 1612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 43 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 753/753 places, 1312/1312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 46 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
[2024-05-22 21:23:42] [INFO ] Invariant cache hit.
[2024-05-22 21:23:44] [INFO ] Implicit Places using invariants in 1513 ms returned [1, 18, 19, 31, 49, 67, 136, 140, 149, 150, 152, 169, 187, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 632, 636, 637, 640, 651, 652, 653, 671, 692, 693, 694, 695]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1526 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 704/753 places, 1312/1312 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 704 transition count 1220
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 190 place count 612 transition count 1214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 611 transition count 1214
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 191 place count 611 transition count 1188
Deduced a syphon composed of 26 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 244 place count 584 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 256 place count 580 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 264 place count 572 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 267 place count 569 transition count 1177
Iterating global reduction 5 with 3 rules applied. Total rules applied 270 place count 569 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 273 place count 569 transition count 1174
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 347 place count 532 transition count 1137
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 352 place count 527 transition count 1132
Iterating global reduction 6 with 5 rules applied. Total rules applied 357 place count 527 transition count 1132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 362 place count 527 transition count 1127
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 366 place count 525 transition count 1128
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 376 place count 525 transition count 1118
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 387 place count 514 transition count 1118
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 402 place count 514 transition count 1118
Applied a total of 402 rules in 223 ms. Remains 514 /704 variables (removed 190) and now considering 1118/1312 (removed 194) transitions.
// Phase 1: matrix 1118 rows 514 cols
[2024-05-22 21:23:44] [INFO ] Computed 74 invariants in 16 ms
[2024-05-22 21:23:45] [INFO ] Implicit Places using invariants in 790 ms returned [74, 90, 96, 99, 101, 104, 105, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 794 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 482/753 places, 1118/1312 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 468 transition count 1104
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 468 transition count 1104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 463 transition count 1099
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 463 transition count 1099
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 58 place count 453 transition count 1089
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 453 transition count 1075
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 86 place count 439 transition count 1075
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 439 transition count 1070
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 434 transition count 1070
Applied a total of 96 rules in 90 ms. Remains 434 /482 variables (removed 48) and now considering 1070/1118 (removed 48) transitions.
// Phase 1: matrix 1070 rows 434 cols
[2024-05-22 21:23:45] [INFO ] Computed 42 invariants in 9 ms
[2024-05-22 21:23:45] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-22 21:23:45] [INFO ] Invariant cache hit.
[2024-05-22 21:23:47] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2373 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 434/753 places, 1070/1312 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5055 ms. Remains : 434/753 places, 1070/1312 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318731 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318731 steps, saw 94355 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:23:50] [INFO ] Invariant cache hit.
[2024-05-22 21:23:50] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:23:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 21:23:50] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-22 21:23:51] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:23:51] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 21:23:51] [INFO ] After 885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1070/1070 transitions.
Applied a total of 0 rules in 15 ms. Remains 434 /434 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 434/434 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1070/1070 transitions.
Applied a total of 0 rules in 14 ms. Remains 434 /434 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2024-05-22 21:23:51] [INFO ] Invariant cache hit.
[2024-05-22 21:23:52] [INFO ] Implicit Places using invariants in 601 ms returned []
[2024-05-22 21:23:52] [INFO ] Invariant cache hit.
[2024-05-22 21:23:53] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2024-05-22 21:23:53] [INFO ] Redundant transitions in 102 ms returned []
[2024-05-22 21:23:53] [INFO ] Invariant cache hit.
[2024-05-22 21:23:54] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2869 ms. Remains : 434/434 places, 1070/1070 transitions.
Applied a total of 0 rules in 15 ms. Remains 434 /434 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 21:23:54] [INFO ] Invariant cache hit.
[2024-05-22 21:23:54] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:23:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 21:23:54] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 16 ms returned sat
[2024-05-22 21:23:55] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:23:55] [INFO ] After 940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-22 21:23:55] [INFO ] After 1102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 2121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 230 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:23:56] [INFO ] Computed 227 invariants in 47 ms
[2024-05-22 21:23:58] [INFO ] Implicit Places using invariants in 1965 ms returned []
[2024-05-22 21:23:58] [INFO ] Invariant cache hit.
[2024-05-22 21:24:00] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 3809 ms to find 0 implicit places.
[2024-05-22 21:24:00] [INFO ] Invariant cache hit.
[2024-05-22 21:24:03] [INFO ] Dead Transitions using invariants and state equation in 2820 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6863 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174822 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174822 steps, saw 33013 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:24:06] [INFO ] Invariant cache hit.
[2024-05-22 21:24:07] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:24:07] [INFO ] [Nat]Absence check using 54 positive place invariants in 30 ms returned sat
[2024-05-22 21:24:07] [INFO ] [Nat]Absence check using 54 positive and 173 generalized place invariants in 155 ms returned sat
[2024-05-22 21:24:10] [INFO ] After 2638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:24:11] [INFO ] Deduced a trap composed of 24 places in 830 ms of which 1 ms to minimize.
[2024-05-22 21:24:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1137 ms
[2024-05-22 21:24:11] [INFO ] After 3886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 245 ms.
[2024-05-22 21:24:11] [INFO ] After 4681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2121 transition count 2193
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 388 rules applied. Total rules applied 773 place count 1736 transition count 2190
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 776 place count 1734 transition count 2189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 1733 transition count 2189
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 777 place count 1733 transition count 1617
Deduced a syphon composed of 572 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1974 place count 1108 transition count 1617
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2013 place count 1103 transition count 1583
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2047 place count 1069 transition count 1583
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2047 place count 1069 transition count 1563
Deduced a syphon composed of 20 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2107 place count 1029 transition count 1563
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2107 place count 1029 transition count 1544
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2145 place count 1010 transition count 1544
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 6 with 350 rules applied. Total rules applied 2495 place count 834 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2499 place count 830 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2504 place count 829 transition count 1366
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2505 place count 829 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2506 place count 828 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2506 place count 828 transition count 1364
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2508 place count 827 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2510 place count 825 transition count 1362
Iterating global reduction 8 with 2 rules applied. Total rules applied 2512 place count 825 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2514 place count 825 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2515 place count 824 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2517 place count 823 transition count 1365
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2523 place count 823 transition count 1359
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2529 place count 817 transition count 1359
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2533 place count 817 transition count 1355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2537 place count 813 transition count 1355
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2542 place count 813 transition count 1355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2543 place count 812 transition count 1354
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2558 place count 802 transition count 1349
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2563 place count 797 transition count 1349
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2563 place count 797 transition count 1334
Deduced a syphon composed of 15 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2594 place count 781 transition count 1334
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2600 place count 775 transition count 1334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2600 place count 775 transition count 1333
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2624 place count 763 transition count 1322
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2629 place count 758 transition count 1317
Iterating global reduction 15 with 5 rules applied. Total rules applied 2634 place count 758 transition count 1317
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2639 place count 758 transition count 1312
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2644 place count 753 transition count 1312
Applied a total of 2644 rules in 814 ms. Remains 753 /2121 variables (removed 1368) and now considering 1312/2578 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 819 ms. Remains : 753/2121 places, 1312/2578 transitions.
Incomplete random walk after 10000 steps, including 119 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 297029 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 297029 steps, saw 62092 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1312 rows 753 cols
[2024-05-22 21:24:15] [INFO ] Computed 129 invariants in 14 ms
[2024-05-22 21:24:15] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:24:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2024-05-22 21:24:15] [INFO ] [Nat]Absence check using 37 positive and 92 generalized place invariants in 35 ms returned sat
[2024-05-22 21:24:16] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:24:17] [INFO ] After 1150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-22 21:24:17] [INFO ] After 1373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 24 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 753/753 places, 1312/1312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1312/1312 transitions.
Applied a total of 0 rules in 23 ms. Remains 753 /753 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
[2024-05-22 21:24:17] [INFO ] Invariant cache hit.
[2024-05-22 21:24:18] [INFO ] Implicit Places using invariants in 1356 ms returned [1, 18, 19, 31, 49, 67, 136, 140, 149, 150, 152, 169, 187, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 632, 636, 637, 640, 651, 652, 653, 671, 692, 693, 694, 695]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1360 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 704/753 places, 1312/1312 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 704 transition count 1220
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 190 place count 612 transition count 1214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 611 transition count 1214
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 191 place count 611 transition count 1188
Deduced a syphon composed of 26 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 244 place count 584 transition count 1188
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 256 place count 580 transition count 1180
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 264 place count 572 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 267 place count 569 transition count 1177
Iterating global reduction 5 with 3 rules applied. Total rules applied 270 place count 569 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 273 place count 569 transition count 1174
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 347 place count 532 transition count 1137
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 352 place count 527 transition count 1132
Iterating global reduction 6 with 5 rules applied. Total rules applied 357 place count 527 transition count 1132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 362 place count 527 transition count 1127
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 366 place count 525 transition count 1128
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 376 place count 525 transition count 1118
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 387 place count 514 transition count 1118
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 402 place count 514 transition count 1118
Applied a total of 402 rules in 199 ms. Remains 514 /704 variables (removed 190) and now considering 1118/1312 (removed 194) transitions.
// Phase 1: matrix 1118 rows 514 cols
[2024-05-22 21:24:18] [INFO ] Computed 74 invariants in 14 ms
[2024-05-22 21:24:19] [INFO ] Implicit Places using invariants in 1013 ms returned [74, 90, 96, 99, 101, 104, 105, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 482/753 places, 1118/1312 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 468 transition count 1104
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 468 transition count 1104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 463 transition count 1099
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 463 transition count 1099
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 58 place count 453 transition count 1089
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 453 transition count 1075
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 86 place count 439 transition count 1075
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 439 transition count 1070
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 434 transition count 1070
Applied a total of 96 rules in 146 ms. Remains 434 /482 variables (removed 48) and now considering 1070/1118 (removed 48) transitions.
// Phase 1: matrix 1070 rows 434 cols
[2024-05-22 21:24:19] [INFO ] Computed 42 invariants in 15 ms
[2024-05-22 21:24:20] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-22 21:24:20] [INFO ] Invariant cache hit.
[2024-05-22 21:24:22] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2622 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 434/753 places, 1070/1312 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5369 ms. Remains : 434/753 places, 1070/1312 transitions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 290077 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290077 steps, saw 85625 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:24:25] [INFO ] Invariant cache hit.
[2024-05-22 21:24:25] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:24:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 21:24:25] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 17 ms returned sat
[2024-05-22 21:24:26] [INFO ] After 891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:24:26] [INFO ] After 959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 21:24:26] [INFO ] After 1099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1070/1070 transitions.
Applied a total of 0 rules in 15 ms. Remains 434 /434 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 434/434 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1070/1070 transitions.
Applied a total of 0 rules in 14 ms. Remains 434 /434 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2024-05-22 21:24:26] [INFO ] Invariant cache hit.
[2024-05-22 21:24:27] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-22 21:24:27] [INFO ] Invariant cache hit.
[2024-05-22 21:24:28] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
[2024-05-22 21:24:28] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-22 21:24:28] [INFO ] Invariant cache hit.
[2024-05-22 21:24:29] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3131 ms. Remains : 434/434 places, 1070/1070 transitions.
Applied a total of 0 rules in 28 ms. Remains 434 /434 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 21:24:29] [INFO ] Invariant cache hit.
[2024-05-22 21:24:30] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:24:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-22 21:24:30] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 23 ms returned sat
[2024-05-22 21:24:31] [INFO ] After 944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:24:31] [INFO ] After 999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-22 21:24:31] [INFO ] After 1179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 199 reset in 494 ms.
Product exploration explored 100000 steps with 196 reset in 555 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Performed 376 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 376 rules applied. Total rules applied 376 place count 2121 transition count 2578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 377 place count 2121 transition count 2577
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 389 Pre rules applied. Total rules applied 377 place count 2121 transition count 2674
Deduced a syphon composed of 765 places in 10 ms
Iterating global reduction 2 with 389 rules applied. Total rules applied 766 place count 2121 transition count 2674
Discarding 207 places :
Symmetric choice reduction at 2 with 207 rule applications. Total rules 973 place count 1914 transition count 2467
Deduced a syphon composed of 558 places in 10 ms
Iterating global reduction 2 with 207 rules applied. Total rules applied 1180 place count 1914 transition count 2467
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1180 place count 1914 transition count 2472
Deduced a syphon composed of 563 places in 9 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1185 place count 1914 transition count 2472
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 926 places in 4 ms
Iterating global reduction 2 with 363 rules applied. Total rules applied 1548 place count 1914 transition count 2473
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 1692 place count 1770 transition count 2327
Deduced a syphon composed of 786 places in 3 ms
Iterating global reduction 2 with 144 rules applied. Total rules applied 1836 place count 1770 transition count 2327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1838 place count 1768 transition count 2324
Deduced a syphon composed of 786 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1840 place count 1768 transition count 2324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1842 place count 1768 transition count 2322
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 817 places in 4 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1873 place count 1768 transition count 2429
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1882 place count 1759 transition count 2409
Deduced a syphon composed of 808 places in 4 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1891 place count 1759 transition count 2409
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 809 places in 4 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1892 place count 1759 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1893 place count 1758 transition count 2409
Deduced a syphon composed of 808 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1894 place count 1758 transition count 2409
Deduced a syphon composed of 808 places in 4 ms
Applied a total of 1894 rules in 1661 ms. Remains 1758 /2121 variables (removed 363) and now considering 2409/2578 (removed 169) transitions.
[2024-05-22 21:24:35] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 2409 rows 1758 cols
[2024-05-22 21:24:35] [INFO ] Computed 227 invariants in 41 ms
[2024-05-22 21:24:37] [INFO ] Dead Transitions using invariants and state equation in 2402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1758/2121 places, 2409/2578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4199 ms. Remains : 1758/2121 places, 2409/2578 transitions.
Built C files in :
/tmp/ltsmin10670752689270487314
[2024-05-22 21:24:37] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10670752689270487314
Running compilation step : cd /tmp/ltsmin10670752689270487314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10670752689270487314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10670752689270487314;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 129 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:24:40] [INFO ] Computed 227 invariants in 31 ms
[2024-05-22 21:24:42] [INFO ] Implicit Places using invariants in 1383 ms returned []
[2024-05-22 21:24:42] [INFO ] Invariant cache hit.
[2024-05-22 21:24:44] [INFO ] Implicit Places using invariants and state equation in 2766 ms returned []
Implicit Place search using SMT with State Equation took 4151 ms to find 0 implicit places.
[2024-05-22 21:24:44] [INFO ] Invariant cache hit.
[2024-05-22 21:24:47] [INFO ] Dead Transitions using invariants and state equation in 2956 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7240 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Built C files in :
/tmp/ltsmin14312031105797437246
[2024-05-22 21:24:47] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14312031105797437246
Running compilation step : cd /tmp/ltsmin14312031105797437246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14312031105797437246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14312031105797437246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:24:51] [INFO ] Flatten gal took : 106 ms
[2024-05-22 21:24:51] [INFO ] Flatten gal took : 95 ms
[2024-05-22 21:24:51] [INFO ] Time to serialize gal into /tmp/LTL14533208278507710784.gal : 29 ms
[2024-05-22 21:24:51] [INFO ] Time to serialize properties into /tmp/LTL1694231944172340695.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14533208278507710784.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9106038460090695850.hoa' '-atoms' '/tmp/LTL1694231944172340695.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1694231944172340695.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9106038460090695850.hoa
Detected timeout of ITS tools.
[2024-05-22 21:25:06] [INFO ] Flatten gal took : 92 ms
[2024-05-22 21:25:06] [INFO ] Flatten gal took : 91 ms
[2024-05-22 21:25:06] [INFO ] Time to serialize gal into /tmp/LTL16098460833511217797.gal : 17 ms
[2024-05-22 21:25:06] [INFO ] Time to serialize properties into /tmp/LTL10748554520231501370.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16098460833511217797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10748554520231501370.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(("((p1813==0)&&(p2163==0))")&&(G("((((p1954==0)||(p1958==0))||((p1962==0)||(p117==0)))||(p572==0))"))))))
Formula 0 simplified : XX(!"((p1813==0)&&(p2163==0))" | F!"((((p1954==0)||(p1958==0))||((p1962==0)||(p117==0)))||(p572==0))")
Detected timeout of ITS tools.
[2024-05-22 21:25:21] [INFO ] Flatten gal took : 96 ms
[2024-05-22 21:25:21] [INFO ] Applying decomposition
[2024-05-22 21:25:21] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph4389059023304682213.txt' '-o' '/tmp/graph4389059023304682213.bin' '-w' '/tmp/graph4389059023304682213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4389059023304682213.bin' '-l' '-1' '-v' '-w' '/tmp/graph4389059023304682213.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:25:22] [INFO ] Decomposing Gal with order
[2024-05-22 21:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:25:23] [INFO ] Removed a total of 1899 redundant transitions.
[2024-05-22 21:25:23] [INFO ] Flatten gal took : 489 ms
[2024-05-22 21:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 35 ms.
[2024-05-22 21:25:23] [INFO ] Time to serialize gal into /tmp/LTL17904036192913408559.gal : 36 ms
[2024-05-22 21:25:23] [INFO ] Time to serialize properties into /tmp/LTL8660865745064100682.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17904036192913408559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8660865745064100682.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(("((i24.u627.p1813==0)&&(i27.u747.p2163==0))")&&(G("((((i22.i4.i0.u685.p1954==0)||(i22.i4.i1.u688.p1958==0))||((i22.i4.i2.u689....211
Formula 0 simplified : XX(!"((i24.u627.p1813==0)&&(i27.u747.p2163==0))" | F!"((((i22.i4.i0.u685.p1954==0)||(i22.i4.i1.u688.p1958==0))||((i22.i4.i2.u689.p19...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5678866108443851564
[2024-05-22 21:25:38] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5678866108443851564
Running compilation step : cd /tmp/ltsmin5678866108443851564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5678866108443851564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5678866108443851564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-05b-LTLFireability-09 finished in 145430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(p1)))'
Support contains 5 out of 2155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 2154 transition count 2322
Reduce places removed 395 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 398 rules applied. Total rules applied 793 place count 1759 transition count 2319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 795 place count 1757 transition count 2319
Performed 580 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 580 Pre rules applied. Total rules applied 795 place count 1757 transition count 1739
Deduced a syphon composed of 580 places in 5 ms
Ensure Unique test removed 53 places
Reduce places removed 633 places and 0 transitions.
Iterating global reduction 3 with 1213 rules applied. Total rules applied 2008 place count 1124 transition count 1739
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 38 rules applied. Total rules applied 2046 place count 1119 transition count 1706
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 2079 place count 1086 transition count 1706
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2079 place count 1086 transition count 1685
Deduced a syphon composed of 21 places in 6 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2142 place count 1044 transition count 1685
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2142 place count 1044 transition count 1665
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2182 place count 1024 transition count 1665
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2185 place count 1021 transition count 1655
Iterating global reduction 5 with 3 rules applied. Total rules applied 2188 place count 1021 transition count 1655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2188 place count 1021 transition count 1654
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2190 place count 1020 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2192 place count 1018 transition count 1645
Iterating global reduction 5 with 2 rules applied. Total rules applied 2194 place count 1018 transition count 1645
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2196 place count 1016 transition count 1636
Iterating global reduction 5 with 2 rules applied. Total rules applied 2198 place count 1016 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2199 place count 1015 transition count 1628
Iterating global reduction 5 with 1 rules applied. Total rules applied 2200 place count 1015 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2201 place count 1014 transition count 1620
Iterating global reduction 5 with 1 rules applied. Total rules applied 2202 place count 1014 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2203 place count 1013 transition count 1612
Iterating global reduction 5 with 1 rules applied. Total rules applied 2204 place count 1013 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2205 place count 1012 transition count 1604
Iterating global reduction 5 with 1 rules applied. Total rules applied 2206 place count 1012 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2207 place count 1011 transition count 1596
Iterating global reduction 5 with 1 rules applied. Total rules applied 2208 place count 1011 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2209 place count 1010 transition count 1588
Iterating global reduction 5 with 1 rules applied. Total rules applied 2210 place count 1010 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2211 place count 1009 transition count 1580
Iterating global reduction 5 with 1 rules applied. Total rules applied 2212 place count 1009 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2213 place count 1008 transition count 1572
Iterating global reduction 5 with 1 rules applied. Total rules applied 2214 place count 1008 transition count 1572
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2215 place count 1007 transition count 1564
Iterating global reduction 5 with 1 rules applied. Total rules applied 2216 place count 1007 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2217 place count 1006 transition count 1556
Iterating global reduction 5 with 1 rules applied. Total rules applied 2218 place count 1006 transition count 1556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2219 place count 1005 transition count 1548
Iterating global reduction 5 with 1 rules applied. Total rules applied 2220 place count 1005 transition count 1548
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2221 place count 1004 transition count 1540
Iterating global reduction 5 with 1 rules applied. Total rules applied 2222 place count 1004 transition count 1540
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 5 with 334 rules applied. Total rules applied 2556 place count 836 transition count 1374
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2560 place count 832 transition count 1370
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2565 place count 831 transition count 1370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2565 place count 831 transition count 1369
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2567 place count 830 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2568 place count 829 transition count 1368
Iterating global reduction 5 with 1 rules applied. Total rules applied 2569 place count 829 transition count 1368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 2571 place count 829 transition count 1366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2572 place count 828 transition count 1366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2574 place count 827 transition count 1372
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2576 place count 825 transition count 1370
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 13 rules applied. Total rules applied 2589 place count 816 transition count 1366
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2593 place count 812 transition count 1366
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 2593 place count 812 transition count 1352
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 29 rules applied. Total rules applied 2622 place count 797 transition count 1352
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 9 with 10 rules applied. Total rules applied 2632 place count 787 transition count 1352
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2632 place count 787 transition count 1351
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2634 place count 786 transition count 1351
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 2664 place count 771 transition count 1336
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 2673 place count 762 transition count 1327
Iterating global reduction 10 with 9 rules applied. Total rules applied 2682 place count 762 transition count 1327
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2687 place count 757 transition count 1322
Iterating global reduction 10 with 5 rules applied. Total rules applied 2692 place count 757 transition count 1322
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2697 place count 757 transition count 1317
Applied a total of 2697 rules in 1103 ms. Remains 757 /2155 variables (removed 1398) and now considering 1317/2718 (removed 1401) transitions.
// Phase 1: matrix 1317 rows 757 cols
[2024-05-22 21:25:42] [INFO ] Computed 125 invariants in 15 ms
[2024-05-22 21:25:44] [INFO ] Implicit Places using invariants in 1339 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 273, 290, 308, 328, 381, 394, 395, 397, 414, 432, 453, 511, 512, 524, 525, 526, 527, 529, 546, 564, 584, 635, 636, 639, 650, 651, 652, 670, 692, 693, 694, 695]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1341 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 707/2155 places, 1317/2718 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 707 transition count 1229
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 619 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 618 transition count 1228
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 178 place count 618 transition count 1200
Deduced a syphon composed of 28 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 235 place count 589 transition count 1200
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 247 place count 585 transition count 1192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 255 place count 577 transition count 1192
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 258 place count 574 transition count 1189
Iterating global reduction 5 with 3 rules applied. Total rules applied 261 place count 574 transition count 1189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 264 place count 574 transition count 1186
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 346 place count 533 transition count 1145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 350 place count 531 transition count 1145
Applied a total of 350 rules in 127 ms. Remains 531 /707 variables (removed 176) and now considering 1145/1317 (removed 172) transitions.
// Phase 1: matrix 1145 rows 531 cols
[2024-05-22 21:25:44] [INFO ] Computed 70 invariants in 16 ms
[2024-05-22 21:25:45] [INFO ] Implicit Places using invariants in 966 ms returned [88, 94, 99, 174, 180, 185, 266, 272, 277, 357, 363, 368, 449, 455, 460, 528]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 968 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 515/2155 places, 1145/2718 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 515 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 514 transition count 1144
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 504 transition count 1134
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 504 transition count 1134
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 494 transition count 1124
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 494 transition count 1124
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 489 transition count 1119
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 489 transition count 1119
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 484 transition count 1114
Applied a total of 62 rules in 99 ms. Remains 484 /515 variables (removed 31) and now considering 1114/1145 (removed 31) transitions.
// Phase 1: matrix 1114 rows 484 cols
[2024-05-22 21:25:45] [INFO ] Computed 54 invariants in 9 ms
[2024-05-22 21:25:46] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-22 21:25:46] [INFO ] Invariant cache hit.
[2024-05-22 21:25:47] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2399 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 484/2155 places, 1114/2718 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6038 ms. Remains : 484/2155 places, 1114/2718 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s333 1), p0:(OR (AND (EQ s254 1) (EQ s256 1)) (AND (EQ s448 1) (EQ s479 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1407 reset in 516 ms.
Product exploration explored 100000 steps with 1447 reset in 546 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 160 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), p0, (AND p0 p1)]
Finished random walk after 5356 steps, including 75 resets, run visited all 4 properties in 21 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (NOT p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 328 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), p0, (AND p0 p1)]
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 1114/1114 transitions.
Applied a total of 0 rules in 27 ms. Remains 484 /484 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2024-05-22 21:25:50] [INFO ] Invariant cache hit.
[2024-05-22 21:25:50] [INFO ] Implicit Places using invariants in 849 ms returned []
[2024-05-22 21:25:50] [INFO ] Invariant cache hit.
[2024-05-22 21:25:52] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
[2024-05-22 21:25:52] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-22 21:25:52] [INFO ] Invariant cache hit.
[2024-05-22 21:25:53] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3839 ms. Remains : 484/484 places, 1114/1114 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), p0, (AND p0 p1)]
Finished random walk after 6949 steps, including 92 resets, run visited all 4 properties in 102 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (NOT p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 414 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 1423 reset in 446 ms.
Product exploration explored 100000 steps with 1404 reset in 367 ms.
Built C files in :
/tmp/ltsmin14682173783867917473
[2024-05-22 21:25:56] [INFO ] Computing symmetric may disable matrix : 1114 transitions.
[2024-05-22 21:25:56] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:25:56] [INFO ] Computing symmetric may enable matrix : 1114 transitions.
[2024-05-22 21:25:56] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:25:56] [INFO ] Computing Do-Not-Accords matrix : 1114 transitions.
[2024-05-22 21:25:56] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:25:56] [INFO ] Built C files in 292ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14682173783867917473
Running compilation step : cd /tmp/ltsmin14682173783867917473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14682173783867917473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14682173783867917473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 1114/1114 transitions.
Applied a total of 0 rules in 20 ms. Remains 484 /484 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2024-05-22 21:25:59] [INFO ] Invariant cache hit.
[2024-05-22 21:26:00] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-22 21:26:00] [INFO ] Invariant cache hit.
[2024-05-22 21:26:02] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 2720 ms to find 0 implicit places.
[2024-05-22 21:26:02] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-22 21:26:02] [INFO ] Invariant cache hit.
[2024-05-22 21:26:03] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3863 ms. Remains : 484/484 places, 1114/1114 transitions.
Built C files in :
/tmp/ltsmin4410509923903911496
[2024-05-22 21:26:03] [INFO ] Computing symmetric may disable matrix : 1114 transitions.
[2024-05-22 21:26:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:26:03] [INFO ] Computing symmetric may enable matrix : 1114 transitions.
[2024-05-22 21:26:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:26:03] [INFO ] Computing Do-Not-Accords matrix : 1114 transitions.
[2024-05-22 21:26:03] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 21:26:03] [INFO ] Built C files in 270ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4410509923903911496
Running compilation step : cd /tmp/ltsmin4410509923903911496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4410509923903911496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4410509923903911496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:26:06] [INFO ] Flatten gal took : 44 ms
[2024-05-22 21:26:06] [INFO ] Flatten gal took : 46 ms
[2024-05-22 21:26:06] [INFO ] Time to serialize gal into /tmp/LTL17653716622243820128.gal : 6 ms
[2024-05-22 21:26:06] [INFO ] Time to serialize properties into /tmp/LTL15155934306358119012.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17653716622243820128.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3125275122553100071.hoa' '-atoms' '/tmp/LTL15155934306358119012.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15155934306358119012.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3125275122553100071.hoa
Detected timeout of ITS tools.
[2024-05-22 21:26:21] [INFO ] Flatten gal took : 43 ms
[2024-05-22 21:26:21] [INFO ] Flatten gal took : 42 ms
[2024-05-22 21:26:21] [INFO ] Time to serialize gal into /tmp/LTL12724213351804792228.gal : 7 ms
[2024-05-22 21:26:21] [INFO ] Time to serialize properties into /tmp/LTL3034431244112208421.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12724213351804792228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3034431244112208421.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("(((p1213==1)&&(p1217==1))||((p2124==1)&&(p2345==1)))"))))U(G("(p1575!=1)"))))
Formula 0 simplified : FG"(((p1213==1)&&(p1217==1))||((p2124==1)&&(p2345==1)))" R F!"(p1575!=1)"
Detected timeout of ITS tools.
[2024-05-22 21:26:37] [INFO ] Flatten gal took : 38 ms
[2024-05-22 21:26:37] [INFO ] Applying decomposition
[2024-05-22 21:26:37] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3610375264215797352.txt' '-o' '/tmp/graph3610375264215797352.bin' '-w' '/tmp/graph3610375264215797352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3610375264215797352.bin' '-l' '-1' '-v' '-w' '/tmp/graph3610375264215797352.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:26:37] [INFO ] Decomposing Gal with order
[2024-05-22 21:26:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:26:37] [INFO ] Removed a total of 2197 redundant transitions.
[2024-05-22 21:26:37] [INFO ] Flatten gal took : 66 ms
[2024-05-22 21:26:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 26 ms.
[2024-05-22 21:26:37] [INFO ] Time to serialize gal into /tmp/LTL2709391131261479431.gal : 8 ms
[2024-05-22 21:26:37] [INFO ] Time to serialize properties into /tmp/LTL2563506333232869627.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2709391131261479431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2563506333232869627.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("(((i3.u62.p1213==1)&&(i5.u83.p1217==1))||((i10.i1.u121.p2124==1)&&(i10.i1.u122.p2345==1)))"))))U(G("(i7.u82.p1575!=1)"))))
Formula 0 simplified : FG"(((i3.u62.p1213==1)&&(i5.u83.p1217==1))||((i10.i1.u121.p2124==1)&&(i10.i1.u122.p2345==1)))" R F!"(i7.u82.p1575!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin677409695914341943
[2024-05-22 21:26:52] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin677409695914341943
Running compilation step : cd /tmp/ltsmin677409695914341943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin677409695914341943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin677409695914341943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-05b-LTLFireability-11 finished in 73626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(((p0 U p1)&&p2))) U p0))'
Support contains 4 out of 2155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2155/2155 places, 2718/2718 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2149 transition count 2705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2149 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2145 transition count 2694
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2145 transition count 2694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2145 transition count 2693
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 2142 transition count 2690
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 2142 transition count 2690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 2140 transition count 2681
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 2140 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 2138 transition count 2672
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 2138 transition count 2672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 2137 transition count 2671
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 2137 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 2136 transition count 2663
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 2136 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 2135 transition count 2655
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 2135 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 2134 transition count 2654
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 2134 transition count 2654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 2133 transition count 2646
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 2133 transition count 2646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 2132 transition count 2638
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 2132 transition count 2638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 2131 transition count 2637
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 2131 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 2130 transition count 2629
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 2130 transition count 2629
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 2129 transition count 2621
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 2129 transition count 2621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 2128 transition count 2620
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 2128 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 2127 transition count 2612
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2127 transition count 2612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 2126 transition count 2604
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 2126 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 2125 transition count 2603
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 2125 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 2124 transition count 2595
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 2124 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 2123 transition count 2587
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 2123 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 2122 transition count 2586
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 2122 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 2121 transition count 2578
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 2121 transition count 2578
Applied a total of 69 rules in 3158 ms. Remains 2121 /2155 variables (removed 34) and now considering 2578/2718 (removed 140) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:26:58] [INFO ] Computed 227 invariants in 32 ms
[2024-05-22 21:27:00] [INFO ] Implicit Places using invariants in 2157 ms returned []
[2024-05-22 21:27:00] [INFO ] Invariant cache hit.
[2024-05-22 21:27:02] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 3843 ms to find 0 implicit places.
[2024-05-22 21:27:02] [INFO ] Invariant cache hit.
[2024-05-22 21:27:04] [INFO ] Dead Transitions using invariants and state equation in 2348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2121/2155 places, 2578/2718 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9350 ms. Remains : 2121/2155 places, 2578/2718 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Running random walk in product with property : ASLink-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s601 1), p2:(OR (AND (EQ s1988 1) (EQ s601 1)) (NEQ s601 1)), p1:(AND (EQ s123 1) (EQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25033 reset in 1181 ms.
Product exploration explored 100000 steps with 24964 reset in 959 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 141352 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141352 steps, saw 27823 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:27:11] [INFO ] Invariant cache hit.
[2024-05-22 21:27:11] [INFO ] [Real]Absence check using 54 positive place invariants in 29 ms returned sat
[2024-05-22 21:27:11] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 133 ms returned sat
[2024-05-22 21:27:14] [INFO ] After 3176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:27:15] [INFO ] [Nat]Absence check using 54 positive place invariants in 47 ms returned sat
[2024-05-22 21:27:15] [INFO ] [Nat]Absence check using 54 positive and 173 generalized place invariants in 207 ms returned sat
[2024-05-22 21:27:19] [INFO ] After 3447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:27:20] [INFO ] Deduced a trap composed of 71 places in 1346 ms of which 3 ms to minimize.
[2024-05-22 21:27:21] [INFO ] Deduced a trap composed of 51 places in 785 ms of which 2 ms to minimize.
[2024-05-22 21:27:22] [INFO ] Deduced a trap composed of 87 places in 556 ms of which 1 ms to minimize.
[2024-05-22 21:27:23] [INFO ] Deduced a trap composed of 186 places in 1195 ms of which 2 ms to minimize.
[2024-05-22 21:27:24] [INFO ] Deduced a trap composed of 108 places in 1313 ms of which 2 ms to minimize.
[2024-05-22 21:27:25] [INFO ] Deduced a trap composed of 106 places in 774 ms of which 1 ms to minimize.
[2024-05-22 21:27:27] [INFO ] Deduced a trap composed of 41 places in 1698 ms of which 3 ms to minimize.
[2024-05-22 21:27:28] [INFO ] Deduced a trap composed of 162 places in 917 ms of which 2 ms to minimize.
[2024-05-22 21:27:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10105 ms
[2024-05-22 21:27:30] [INFO ] Deduced a trap composed of 62 places in 1154 ms of which 2 ms to minimize.
[2024-05-22 21:27:32] [INFO ] Deduced a trap composed of 36 places in 1150 ms of which 2 ms to minimize.
[2024-05-22 21:27:33] [INFO ] Deduced a trap composed of 61 places in 1132 ms of which 2 ms to minimize.
[2024-05-22 21:27:34] [INFO ] Deduced a trap composed of 89 places in 1094 ms of which 2 ms to minimize.
[2024-05-22 21:27:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5290 ms
[2024-05-22 21:27:35] [INFO ] After 20111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 867 ms.
[2024-05-22 21:27:36] [INFO ] After 22232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 688 ms.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 782 place count 1731 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 783 place count 1730 transition count 1613
Deduced a syphon composed of 573 places in 5 ms
Ensure Unique test removed 53 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1199 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 5 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 6 with 344 rules applied. Total rules applied 2497 place count 833 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2501 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2506 place count 828 transition count 1365
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2507 place count 828 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2508 place count 827 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2508 place count 827 transition count 1363
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2510 place count 826 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2512 place count 824 transition count 1361
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2516 place count 824 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2517 place count 823 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2519 place count 822 transition count 1364
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2525 place count 822 transition count 1358
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2531 place count 816 transition count 1358
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2535 place count 816 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2539 place count 812 transition count 1354
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2544 place count 812 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2545 place count 811 transition count 1353
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2560 place count 801 transition count 1348
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2565 place count 796 transition count 1348
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2565 place count 796 transition count 1333
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2596 place count 780 transition count 1333
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2602 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2604 place count 773 transition count 1332
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2626 place count 762 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2631 place count 757 transition count 1316
Iterating global reduction 15 with 5 rules applied. Total rules applied 2636 place count 757 transition count 1316
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2641 place count 757 transition count 1311
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2646 place count 752 transition count 1311
Applied a total of 2646 rules in 739 ms. Remains 752 /2121 variables (removed 1369) and now considering 1311/2578 (removed 1267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 741 ms. Remains : 752/2121 places, 1311/2578 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 190945 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190945 steps, saw 42483 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1311 rows 752 cols
[2024-05-22 21:27:41] [INFO ] Computed 129 invariants in 14 ms
[2024-05-22 21:27:42] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2024-05-22 21:27:42] [INFO ] [Real]Absence check using 37 positive and 92 generalized place invariants in 44 ms returned sat
[2024-05-22 21:27:43] [INFO ] After 1155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:27:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2024-05-22 21:27:43] [INFO ] [Nat]Absence check using 37 positive and 92 generalized place invariants in 42 ms returned sat
[2024-05-22 21:27:44] [INFO ] After 1117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:27:45] [INFO ] After 1774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 352 ms.
[2024-05-22 21:27:45] [INFO ] After 2512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 208 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 22 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 752/752 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 22 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2024-05-22 21:27:45] [INFO ] Invariant cache hit.
[2024-05-22 21:27:47] [INFO ] Implicit Places using invariants in 1283 ms returned [1, 18, 19, 32, 68, 137, 141, 150, 151, 153, 170, 188, 224, 227, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1287 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 702/752 places, 1311/1311 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 702 transition count 1223
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 182 place count 614 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 183 place count 613 transition count 1217
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 183 place count 613 transition count 1190
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 238 place count 585 transition count 1190
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 250 place count 581 transition count 1182
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 258 place count 573 transition count 1182
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 261 place count 570 transition count 1179
Iterating global reduction 5 with 3 rules applied. Total rules applied 264 place count 570 transition count 1179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 267 place count 570 transition count 1176
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 333 place count 537 transition count 1143
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 338 place count 532 transition count 1138
Iterating global reduction 6 with 5 rules applied. Total rules applied 343 place count 532 transition count 1138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 348 place count 532 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 352 place count 530 transition count 1134
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 362 place count 530 transition count 1124
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 373 place count 519 transition count 1124
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 385 place count 519 transition count 1124
Applied a total of 385 rules in 120 ms. Remains 519 /702 variables (removed 183) and now considering 1124/1311 (removed 187) transitions.
// Phase 1: matrix 1124 rows 519 cols
[2024-05-22 21:27:47] [INFO ] Computed 73 invariants in 9 ms
[2024-05-22 21:27:47] [INFO ] Implicit Places using invariants in 749 ms returned [76, 96, 104, 110, 113, 114, 167, 185, 191, 194, 196, 201, 202, 255, 271, 277, 280, 282, 287, 288, 341, 357, 363, 366, 368, 373, 374, 427, 443, 449, 452, 454]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 752 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/752 places, 1124/1311 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 473 transition count 1110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 473 transition count 1110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 467 transition count 1104
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 467 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 465 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 465 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 464 transition count 1101
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 464 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 463 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 463 transition count 1100
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 68 place count 453 transition count 1090
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 453 transition count 1075
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 438 transition count 1075
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 438 transition count 1070
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 108 place count 433 transition count 1070
Applied a total of 108 rules in 113 ms. Remains 433 /487 variables (removed 54) and now considering 1070/1124 (removed 54) transitions.
// Phase 1: matrix 1070 rows 433 cols
[2024-05-22 21:27:48] [INFO ] Computed 41 invariants in 9 ms
[2024-05-22 21:27:48] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-22 21:27:48] [INFO ] Invariant cache hit.
[2024-05-22 21:27:49] [INFO ] Implicit Places using invariants and state equation in 1415 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 : 433/752 places, 1070/1311 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4223 ms. Remains : 433/752 places, 1070/1311 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 195872 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195872 steps, saw 60280 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:27:53] [INFO ] Invariant cache hit.
[2024-05-22 21:27:53] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 21:27:53] [INFO ] [Real]Absence check using 13 positive and 28 generalized place invariants in 21 ms returned sat
[2024-05-22 21:27:54] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:27:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-22 21:27:54] [INFO ] [Nat]Absence check using 13 positive and 28 generalized place invariants in 27 ms returned sat
[2024-05-22 21:27:55] [INFO ] After 1214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:27:56] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2024-05-22 21:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2024-05-22 21:27:56] [INFO ] After 1982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 256 ms.
[2024-05-22 21:27:56] [INFO ] After 2524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 183 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 24 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 433/433 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 23 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2024-05-22 21:27:57] [INFO ] Invariant cache hit.
[2024-05-22 21:27:57] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-22 21:27:57] [INFO ] Invariant cache hit.
[2024-05-22 21:27:59] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2024-05-22 21:27:59] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-22 21:27:59] [INFO ] Invariant cache hit.
[2024-05-22 21:28:00] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3012 ms. Remains : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 29 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Running SMT prover for 5 properties.
[2024-05-22 21:28:00] [INFO ] Invariant cache hit.
[2024-05-22 21:28:00] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 21:28:00] [INFO ] [Real]Absence check using 13 positive and 28 generalized place invariants in 20 ms returned sat
[2024-05-22 21:28:00] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:28:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 21:28:01] [INFO ] [Nat]Absence check using 13 positive and 28 generalized place invariants in 20 ms returned sat
[2024-05-22 21:28:02] [INFO ] After 1059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:28:02] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 5 ms to minimize.
[2024-05-22 21:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2024-05-22 21:28:03] [INFO ] After 1855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 258 ms.
[2024-05-22 21:28:03] [INFO ] After 2340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), true, (X (X (NOT (AND p2 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:28:04] [INFO ] Computed 227 invariants in 30 ms
[2024-05-22 21:28:06] [INFO ] [Real]Absence check using 54 positive place invariants in 70 ms returned sat
[2024-05-22 21:28:07] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 1023 ms returned sat
[2024-05-22 21:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 21:28:19] [INFO ] [Real]Absence check using state equation in 11274 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 120 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
[2024-05-22 21:28:19] [INFO ] Invariant cache hit.
[2024-05-22 21:28:20] [INFO ] Implicit Places using invariants in 1619 ms returned []
[2024-05-22 21:28:20] [INFO ] Invariant cache hit.
[2024-05-22 21:28:22] [INFO ] Implicit Places using invariants and state equation in 1670 ms returned []
Implicit Place search using SMT with State Equation took 3293 ms to find 0 implicit places.
[2024-05-22 21:28:22] [INFO ] Invariant cache hit.
[2024-05-22 21:28:25] [INFO ] Dead Transitions using invariants and state equation in 2746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6160 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 141267 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141267 steps, saw 27810 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:28:29] [INFO ] Invariant cache hit.
[2024-05-22 21:28:29] [INFO ] [Real]Absence check using 54 positive place invariants in 30 ms returned sat
[2024-05-22 21:28:29] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 130 ms returned sat
[2024-05-22 21:28:32] [INFO ] After 3418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:28:33] [INFO ] [Nat]Absence check using 54 positive place invariants in 39 ms returned sat
[2024-05-22 21:28:33] [INFO ] [Nat]Absence check using 54 positive and 173 generalized place invariants in 151 ms returned sat
[2024-05-22 21:28:37] [INFO ] After 3914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:28:39] [INFO ] Deduced a trap composed of 71 places in 1397 ms of which 3 ms to minimize.
[2024-05-22 21:28:40] [INFO ] Deduced a trap composed of 51 places in 810 ms of which 1 ms to minimize.
[2024-05-22 21:28:41] [INFO ] Deduced a trap composed of 87 places in 692 ms of which 1 ms to minimize.
[2024-05-22 21:28:42] [INFO ] Deduced a trap composed of 186 places in 1057 ms of which 2 ms to minimize.
[2024-05-22 21:28:43] [INFO ] Deduced a trap composed of 108 places in 1187 ms of which 2 ms to minimize.
[2024-05-22 21:28:44] [INFO ] Deduced a trap composed of 106 places in 633 ms of which 1 ms to minimize.
[2024-05-22 21:28:46] [INFO ] Deduced a trap composed of 41 places in 1447 ms of which 2 ms to minimize.
[2024-05-22 21:28:47] [INFO ] Deduced a trap composed of 162 places in 975 ms of which 1 ms to minimize.
[2024-05-22 21:28:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 9798 ms
[2024-05-22 21:28:49] [INFO ] Deduced a trap composed of 62 places in 961 ms of which 2 ms to minimize.
[2024-05-22 21:28:50] [INFO ] Deduced a trap composed of 36 places in 1146 ms of which 2 ms to minimize.
[2024-05-22 21:28:51] [INFO ] Deduced a trap composed of 61 places in 1126 ms of which 1 ms to minimize.
[2024-05-22 21:28:52] [INFO ] Deduced a trap composed of 89 places in 1125 ms of which 5 ms to minimize.
[2024-05-22 21:28:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5146 ms
[2024-05-22 21:28:53] [INFO ] After 20094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 872 ms.
[2024-05-22 21:28:54] [INFO ] After 21966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 702 ms.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 782 place count 1731 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 1730 transition count 2186
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 783 place count 1730 transition count 1613
Deduced a syphon composed of 573 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 626 places and 0 transitions.
Iterating global reduction 4 with 1199 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 6 with 344 rules applied. Total rules applied 2497 place count 833 transition count 1369
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2501 place count 829 transition count 1365
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2506 place count 828 transition count 1365
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2507 place count 828 transition count 1364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2508 place count 827 transition count 1364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2508 place count 827 transition count 1363
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2510 place count 826 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2512 place count 824 transition count 1361
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2516 place count 824 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2517 place count 823 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2519 place count 822 transition count 1364
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2525 place count 822 transition count 1358
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2531 place count 816 transition count 1358
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2535 place count 816 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2539 place count 812 transition count 1354
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2544 place count 812 transition count 1354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2545 place count 811 transition count 1353
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2560 place count 801 transition count 1348
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2565 place count 796 transition count 1348
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2565 place count 796 transition count 1333
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2596 place count 780 transition count 1333
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2602 place count 774 transition count 1333
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2602 place count 774 transition count 1332
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2604 place count 773 transition count 1332
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2626 place count 762 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2631 place count 757 transition count 1316
Iterating global reduction 15 with 5 rules applied. Total rules applied 2636 place count 757 transition count 1316
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2641 place count 757 transition count 1311
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2646 place count 752 transition count 1311
Applied a total of 2646 rules in 637 ms. Remains 752 /2121 variables (removed 1369) and now considering 1311/2578 (removed 1267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 752/2121 places, 1311/2578 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 187408 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187408 steps, saw 41809 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1311 rows 752 cols
[2024-05-22 21:28:59] [INFO ] Computed 129 invariants in 14 ms
[2024-05-22 21:28:59] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2024-05-22 21:28:59] [INFO ] [Real]Absence check using 37 positive and 92 generalized place invariants in 35 ms returned sat
[2024-05-22 21:29:00] [INFO ] After 1189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:29:01] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-05-22 21:29:01] [INFO ] [Nat]Absence check using 37 positive and 92 generalized place invariants in 53 ms returned sat
[2024-05-22 21:29:02] [INFO ] After 1098ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:29:02] [INFO ] After 1565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 297 ms.
[2024-05-22 21:29:03] [INFO ] After 2253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 142 ms.
Support contains 4 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 38 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 752/752 places, 1311/1311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1311/1311 transitions.
Applied a total of 0 rules in 37 ms. Remains 752 /752 variables (removed 0) and now considering 1311/1311 (removed 0) transitions.
[2024-05-22 21:29:03] [INFO ] Invariant cache hit.
[2024-05-22 21:29:04] [INFO ] Implicit Places using invariants in 1278 ms returned [1, 18, 19, 32, 68, 137, 141, 150, 151, 153, 170, 188, 224, 227, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1280 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 702/752 places, 1311/1311 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 702 transition count 1223
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 182 place count 614 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 183 place count 613 transition count 1217
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 183 place count 613 transition count 1190
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 238 place count 585 transition count 1190
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 250 place count 581 transition count 1182
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 258 place count 573 transition count 1182
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 261 place count 570 transition count 1179
Iterating global reduction 5 with 3 rules applied. Total rules applied 264 place count 570 transition count 1179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 267 place count 570 transition count 1176
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 333 place count 537 transition count 1143
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 338 place count 532 transition count 1138
Iterating global reduction 6 with 5 rules applied. Total rules applied 343 place count 532 transition count 1138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 348 place count 532 transition count 1133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 352 place count 530 transition count 1134
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 362 place count 530 transition count 1124
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 373 place count 519 transition count 1124
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 385 place count 519 transition count 1124
Applied a total of 385 rules in 166 ms. Remains 519 /702 variables (removed 183) and now considering 1124/1311 (removed 187) transitions.
// Phase 1: matrix 1124 rows 519 cols
[2024-05-22 21:29:04] [INFO ] Computed 73 invariants in 13 ms
[2024-05-22 21:29:05] [INFO ] Implicit Places using invariants in 824 ms returned [76, 96, 104, 110, 113, 114, 167, 185, 191, 194, 196, 201, 202, 255, 271, 277, 280, 282, 287, 288, 341, 357, 363, 366, 368, 373, 374, 427, 443, 449, 452, 454]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 826 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/752 places, 1124/1311 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 473 transition count 1110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 473 transition count 1110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 467 transition count 1104
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 467 transition count 1104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 465 transition count 1102
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 465 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 464 transition count 1101
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 464 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 463 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 463 transition count 1100
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 68 place count 453 transition count 1090
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 453 transition count 1075
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 438 transition count 1075
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 438 transition count 1070
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 108 place count 433 transition count 1070
Applied a total of 108 rules in 186 ms. Remains 433 /487 variables (removed 54) and now considering 1070/1124 (removed 54) transitions.
// Phase 1: matrix 1070 rows 433 cols
[2024-05-22 21:29:05] [INFO ] Computed 41 invariants in 8 ms
[2024-05-22 21:29:06] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-22 21:29:06] [INFO ] Invariant cache hit.
[2024-05-22 21:29:08] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2490 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 433/752 places, 1070/1311 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4986 ms. Remains : 433/752 places, 1070/1311 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:29:08] [INFO ] Invariant cache hit.
[2024-05-22 21:29:09] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 21:29:09] [INFO ] [Real]Absence check using 13 positive and 28 generalized place invariants in 29 ms returned sat
[2024-05-22 21:29:09] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:29:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-22 21:29:09] [INFO ] [Nat]Absence check using 13 positive and 28 generalized place invariants in 28 ms returned sat
[2024-05-22 21:29:10] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:29:11] [INFO ] After 1139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-22 21:29:11] [INFO ] After 1510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 21 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 433/433 places, 1070/1070 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 242962 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242962 steps, saw 74228 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:29:14] [INFO ] Invariant cache hit.
[2024-05-22 21:29:14] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 21:29:14] [INFO ] [Real]Absence check using 13 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-22 21:29:15] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:29:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 21:29:15] [INFO ] [Nat]Absence check using 13 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-22 21:29:16] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:29:16] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 137 ms.
[2024-05-22 21:29:16] [INFO ] After 1131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 19 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 433/433 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 18 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2024-05-22 21:29:16] [INFO ] Invariant cache hit.
[2024-05-22 21:29:17] [INFO ] Implicit Places using invariants in 735 ms returned []
[2024-05-22 21:29:17] [INFO ] Invariant cache hit.
[2024-05-22 21:29:19] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
[2024-05-22 21:29:19] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-22 21:29:19] [INFO ] Invariant cache hit.
[2024-05-22 21:29:20] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3430 ms. Remains : 433/433 places, 1070/1070 transitions.
Applied a total of 0 rules in 15 ms. Remains 433 /433 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-05-22 21:29:20] [INFO ] Invariant cache hit.
[2024-05-22 21:29:20] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 21:29:20] [INFO ] [Real]Absence check using 13 positive and 28 generalized place invariants in 26 ms returned sat
[2024-05-22 21:29:21] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:29:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 21:29:21] [INFO ] [Nat]Absence check using 13 positive and 28 generalized place invariants in 19 ms returned sat
[2024-05-22 21:29:21] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:29:21] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-22 21:29:22] [INFO ] After 1084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : [(F p1), (F (AND p1 p2))]
Knowledge based reduction with 6 factoid took 173 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:29:22] [INFO ] Computed 227 invariants in 47 ms
[2024-05-22 21:29:25] [INFO ] [Real]Absence check using 54 positive place invariants in 66 ms returned sat
[2024-05-22 21:29:26] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 1043 ms returned sat
[2024-05-22 21:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 21:29:37] [INFO ] [Real]Absence check using state equation in 11227 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Product exploration explored 100000 steps with 25097 reset in 1292 ms.
Product exploration explored 100000 steps with 24935 reset in 1131 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), true, p1]
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 2121 transition count 2578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 380 place count 2121 transition count 2577
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 387 Pre rules applied. Total rules applied 380 place count 2121 transition count 2674
Deduced a syphon composed of 766 places in 6 ms
Iterating global reduction 2 with 387 rules applied. Total rules applied 767 place count 2121 transition count 2674
Discarding 209 places :
Symmetric choice reduction at 2 with 209 rule applications. Total rules 976 place count 1912 transition count 2465
Deduced a syphon composed of 557 places in 5 ms
Iterating global reduction 2 with 209 rules applied. Total rules applied 1185 place count 1912 transition count 2465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1185 place count 1912 transition count 2470
Deduced a syphon composed of 562 places in 5 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 1190 place count 1912 transition count 2470
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 925 places in 6 ms
Iterating global reduction 2 with 363 rules applied. Total rules applied 1553 place count 1912 transition count 2471
Discarding 146 places :
Symmetric choice reduction at 2 with 146 rule applications. Total rules 1699 place count 1766 transition count 2323
Deduced a syphon composed of 783 places in 6 ms
Iterating global reduction 2 with 146 rules applied. Total rules applied 1845 place count 1766 transition count 2323
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1847 place count 1764 transition count 2320
Deduced a syphon composed of 783 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1849 place count 1764 transition count 2320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1851 place count 1764 transition count 2318
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 814 places in 6 ms
Iterating global reduction 3 with 31 rules applied. Total rules applied 1882 place count 1764 transition count 2425
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1891 place count 1755 transition count 2405
Deduced a syphon composed of 805 places in 4 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1900 place count 1755 transition count 2405
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 806 places in 4 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1901 place count 1755 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1902 place count 1754 transition count 2405
Deduced a syphon composed of 805 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1903 place count 1754 transition count 2405
Deduced a syphon composed of 805 places in 3 ms
Applied a total of 1903 rules in 908 ms. Remains 1754 /2121 variables (removed 367) and now considering 2405/2578 (removed 173) transitions.
[2024-05-22 21:29:41] [INFO ] Redundant transitions in 102 ms returned []
// Phase 1: matrix 2405 rows 1754 cols
[2024-05-22 21:29:41] [INFO ] Computed 227 invariants in 38 ms
[2024-05-22 21:29:43] [INFO ] Dead Transitions using invariants and state equation in 2103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1754/2121 places, 2405/2578 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3122 ms. Remains : 1754/2121 places, 2405/2578 transitions.
Built C files in :
/tmp/ltsmin12350703160736876192
[2024-05-22 21:29:43] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12350703160736876192
Running compilation step : cd /tmp/ltsmin12350703160736876192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12350703160736876192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12350703160736876192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 199 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-05-22 21:29:47] [INFO ] Computed 227 invariants in 47 ms
[2024-05-22 21:29:48] [INFO ] Implicit Places using invariants in 1861 ms returned []
[2024-05-22 21:29:48] [INFO ] Invariant cache hit.
[2024-05-22 21:29:53] [INFO ] Implicit Places using invariants and state equation in 4619 ms returned []
Implicit Place search using SMT with State Equation took 6481 ms to find 0 implicit places.
[2024-05-22 21:29:53] [INFO ] Invariant cache hit.
[2024-05-22 21:29:56] [INFO ] Dead Transitions using invariants and state equation in 3056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9739 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Built C files in :
/tmp/ltsmin3403333605881419591
[2024-05-22 21:29:56] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3403333605881419591
Running compilation step : cd /tmp/ltsmin3403333605881419591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3403333605881419591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3403333605881419591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:29:59] [INFO ] Flatten gal took : 66 ms
[2024-05-22 21:29:59] [INFO ] Flatten gal took : 68 ms
[2024-05-22 21:29:59] [INFO ] Time to serialize gal into /tmp/LTL4628134120906165707.gal : 20 ms
[2024-05-22 21:29:59] [INFO ] Time to serialize properties into /tmp/LTL2127943799951223528.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4628134120906165707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3691854194489902131.hoa' '-atoms' '/tmp/LTL2127943799951223528.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2127943799951223528.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3691854194489902131.hoa
Detected timeout of ITS tools.
[2024-05-22 21:30:15] [INFO ] Flatten gal took : 104 ms
[2024-05-22 21:30:15] [INFO ] Flatten gal took : 107 ms
[2024-05-22 21:30:15] [INFO ] Time to serialize gal into /tmp/LTL7552769604587558051.gal : 18 ms
[2024-05-22 21:30:15] [INFO ] Time to serialize properties into /tmp/LTL8736439905121470616.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7552769604587558051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8736439905121470616.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((!(X(X((("(p658==1)")U("((p130==1)&&(p287==1))"))&&("(((p2206==1)&&(p658==1))||(p658!=1))")))))U("(p658==1)")))
Formula 0 simplified : !"(p658==1)" & X(!"(p658==1)" W X("(((p2206==1)&&(p658==1))||(p658!=1))" & ("(p658==1)" U "((p130==1)&&(p287==1))")))
Detected timeout of ITS tools.
[2024-05-22 21:30:30] [INFO ] Flatten gal took : 70 ms
[2024-05-22 21:30:30] [INFO ] Applying decomposition
[2024-05-22 21:30:30] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11235509363634593804.txt' '-o' '/tmp/graph11235509363634593804.bin' '-w' '/tmp/graph11235509363634593804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11235509363634593804.bin' '-l' '-1' '-v' '-w' '/tmp/graph11235509363634593804.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:30:30] [INFO ] Decomposing Gal with order
[2024-05-22 21:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:30:30] [INFO ] Removed a total of 1921 redundant transitions.
[2024-05-22 21:30:31] [INFO ] Flatten gal took : 205 ms
[2024-05-22 21:30:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 37 ms.
[2024-05-22 21:30:31] [INFO ] Time to serialize gal into /tmp/LTL16301059152512926350.gal : 33 ms
[2024-05-22 21:30:31] [INFO ] Time to serialize properties into /tmp/LTL9245021536380927632.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16301059152512926350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9245021536380927632.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((!(X(X((("(i7.i0.i1.u224.p658==1)")U("((i5.i0.i0.u42.p130==1)&&(i5.i0.i0.u96.p287==1))"))&&("(((i25.u757.p2206==1)&&(i7.i0.i1.u224....226
Formula 0 simplified : !"(i7.i0.i1.u224.p658==1)" & X(!"(i7.i0.i1.u224.p658==1)" W X("(((i25.u757.p2206==1)&&(i7.i0.i1.u224.p658==1))||(i7.i0.i1.u224.p658!...245
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13394427394435600256
[2024-05-22 21:30:46] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13394427394435600256
Running compilation step : cd /tmp/ltsmin13394427394435600256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13394427394435600256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13394427394435600256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-05b-LTLFireability-15 finished in 233906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)&&p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(((p0 U p1)&&p2))) U p0))'
[2024-05-22 21:30:49] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6239039859908640151
[2024-05-22 21:30:49] [INFO ] Too many transitions (2718) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:30:49] [INFO ] Applying decomposition
[2024-05-22 21:30:49] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6239039859908640151
Running compilation step : cd /tmp/ltsmin6239039859908640151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 21:30:49] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph1293695751600082643.txt' '-o' '/tmp/graph1293695751600082643.bin' '-w' '/tmp/graph1293695751600082643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1293695751600082643.bin' '-l' '-1' '-v' '-w' '/tmp/graph1293695751600082643.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:30:50] [INFO ] Decomposing Gal with order
[2024-05-22 21:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:30:50] [INFO ] Removed a total of 2161 redundant transitions.
[2024-05-22 21:30:50] [INFO ] Flatten gal took : 144 ms
[2024-05-22 21:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 20 ms.
[2024-05-22 21:30:50] [INFO ] Time to serialize gal into /tmp/LTLFireability13430839564275604763.gal : 23 ms
[2024-05-22 21:30:50] [INFO ] Time to serialize properties into /tmp/LTLFireability1158382787690091464.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13430839564275604763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1158382787690091464.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(X(("((i22.i0.i0.u624.p1813==0)&&(i25.u753.p2163==0))")&&(G("((((i22.i4.i0.u681.p1954==0)||(i22.i4.i1.u684.p1958==0))||((i22.i4.i2...217
Formula 0 simplified : XX(!"((i22.i0.i0.u624.p1813==0)&&(i25.u753.p2163==0))" | F!"((((i22.i4.i0.u681.p1954==0)||(i22.i4.i1.u684.p1958==0))||((i22.i4.i2.u6...209
Compilation finished in 11124 ms.
Running link step : cd /tmp/ltsmin6239039859908640151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin6239039859908640151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6239039859908640151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6239039859908640151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>(!(LTLAPp2==true))) U []((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 21:54:13] [INFO ] Applying decomposition
[2024-05-22 21:54:13] [INFO ] Flatten gal took : 228 ms
[2024-05-22 21:54:13] [INFO ] Decomposing Gal with order
[2024-05-22 21:54:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:54:14] [INFO ] Removed a total of 1989 redundant transitions.
[2024-05-22 21:54:14] [INFO ] Flatten gal took : 403 ms
[2024-05-22 21:54:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2948 labels/synchronizations in 261 ms.
[2024-05-22 21:54:14] [INFO ] Time to serialize gal into /tmp/LTLFireability12588852884077191998.gal : 38 ms
[2024-05-22 21:54:14] [INFO ] Time to serialize properties into /tmp/LTLFireability2723465086281621408.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12588852884077191998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2723465086281621408.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(X(("((i0.i1.i0.i0.i0.i0.i0.i1.u211.p1813==0)&&(i1.i0.u253.p2163==0))")&&(G("((((i0.i1.i0.i0.i0.i0.i0.i1.i7.i0.u232.p1954==0)||(i0...355
Formula 0 simplified : XX(!"((i0.i1.i0.i0.i0.i0.i0.i1.u211.p1813==0)&&(i1.i0.u253.p2163==0))" | F!"((((i0.i1.i0.i0.i0.i0.i0.i1.i7.i0.u232.p1954==0)||(i0.i1...347
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin6239039859908640151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>(!(LTLAPp2==true))) U []((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6239039859908640151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!X(X((((LTLAPp4==true) U (LTLAPp5==true))&&(LTLAPp6==true)))) U (LTLAPp4==true))' '--buchi-type=spotba'
LTSmin run took 2928 ms.
FORMULA ASLink-PT-05b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin6239039859908640151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 22:17:39] [INFO ] Flatten gal took : 283 ms
[2024-05-22 22:17:41] [INFO ] Input system was already deterministic with 2718 transitions.
[2024-05-22 22:17:41] [INFO ] Transformed 2155 places.
[2024-05-22 22:17:41] [INFO ] Transformed 2718 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 22:18:12] [INFO ] Time to serialize gal into /tmp/LTLFireability15457651439500301325.gal : 72 ms
[2024-05-22 22:18:12] [INFO ] Time to serialize properties into /tmp/LTLFireability13464852997864818037.ltl : 36 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15457651439500301325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13464852997864818037.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(("((p1813==0)&&(p2163==0))")&&(G("((((p1954==0)||(p1958==0))||((p1962==0)||(p117==0)))||(p572==0))"))))))
Formula 0 simplified : XX(!"((p1813==0)&&(p2163==0))" | F!"((((p1954==0)||(p1958==0))||((p1962==0)||(p117==0)))||(p572==0))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12622416 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15385900 kB

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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ASLink-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-smll-171620127800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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