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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 CloudDeployment-PT-5b-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-5b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716329407053

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:10:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:10:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:10:08] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-21 22:10:08] [INFO ] Transformed 1525 places.
[2024-05-21 22:10:08] [INFO ] Transformed 3132 transitions.
[2024-05-21 22:10:08] [INFO ] Found NUPN structural information;
[2024-05-21 22:10:08] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1520 transition count 3132
Discarding 396 places :
Symmetric choice reduction at 1 with 396 rule applications. Total rules 401 place count 1124 transition count 2736
Iterating global reduction 1 with 396 rules applied. Total rules applied 797 place count 1124 transition count 2736
Discarding 152 places :
Symmetric choice reduction at 1 with 152 rule applications. Total rules 949 place count 972 transition count 2584
Iterating global reduction 1 with 152 rules applied. Total rules applied 1101 place count 972 transition count 2584
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 1120 place count 972 transition count 2565
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1137 place count 955 transition count 2548
Iterating global reduction 2 with 17 rules applied. Total rules applied 1154 place count 955 transition count 2548
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1155 place count 954 transition count 2547
Iterating global reduction 2 with 1 rules applied. Total rules applied 1156 place count 954 transition count 2547
Applied a total of 1156 rules in 450 ms. Remains 954 /1525 variables (removed 571) and now considering 2547/3132 (removed 585) transitions.
// Phase 1: matrix 2547 rows 954 cols
[2024-05-21 22:10:09] [INFO ] Computed 16 invariants in 54 ms
[2024-05-21 22:10:09] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-21 22:10:09] [INFO ] Invariant cache hit.
[2024-05-21 22:10:11] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
Running 2546 sub problems to find dead transitions.
[2024-05-21 22:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/953 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/3501 variables, and 16 constraints, problems are : Problem set: 0 solved, 2546 unsolved in 30083 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 2546/1522 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/953 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2546 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/3501 variables, and 16 constraints, problems are : Problem set: 0 solved, 2546 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/954 constraints, PredecessorRefiner: 1024/1522 constraints, Known Traps: 0/0 constraints]
After SMT, in 80405ms problems are : Problem set: 0 solved, 2546 unsolved
Search for dead transitions found 0 dead transitions in 80457ms
Starting structural reductions in LTL mode, iteration 1 : 954/1525 places, 2547/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82758 ms. Remains : 954/1525 places, 2547/3132 transitions.
Support contains 56 out of 954 places after structural reductions.
[2024-05-21 22:11:32] [INFO ] Flatten gal took : 509 ms
[2024-05-21 22:11:32] [INFO ] Flatten gal took : 259 ms
[2024-05-21 22:11:33] [INFO ] Input system was already deterministic with 2547 transitions.
RANDOM walk for 40000 steps (248 resets) in 1865 ms. (21 steps per ms) remains 20/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
[2024-05-21 22:11:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 184/232 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1737/1969 variables, 232/248 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1969 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 6 (OVERLAPS) 503/2472 variables, 212/460 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2472 variables, 0/460 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 439/2911 variables, 196/656 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2911 variables, 0/656 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 397/3308 variables, 186/842 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3308 variables, 0/842 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 154/3462 variables, 103/945 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3462 variables, 0/945 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 34/3496 variables, 20/965 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3496 variables, 0/965 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 5/3501 variables, 5/970 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3501 variables, 0/970 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/3501 variables, 0/970 constraints. Problems are: Problem set: 6 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3501/3501 variables, and 970 constraints, problems are : Problem set: 6 solved, 14 unsolved in 4765 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 954/954 constraints, PredecessorRefiner: 20/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 190/232 variables, 15/16 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1737/1969 variables, 232/248 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1969 variables, 2/250 constraints. Problems are: Problem set: 6 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1969 variables, 0/250 constraints. Problems are: Problem set: 6 solved, 14 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 7 (OVERLAPS) 503/2472 variables, 212/462 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2472 variables, 10/472 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2472 variables, 0/472 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 439/2911 variables, 196/668 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2911 variables, 0/668 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 397/3308 variables, 186/854 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3308 variables, 0/854 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 154/3462 variables, 103/957 constraints. Problems are: Problem set: 8 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3462 variables, 0/957 constraints. Problems are: Problem set: 8 solved, 12 unsolved
SMT process timed out in 10138ms, After SMT, problems are : Problem set: 8 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 951 edges and 954 vertex of which 311 / 954 are part of one of the 34 SCC in 9 ms
Free SCC test removed 277 places
Drop transitions (Empty/Sink Transition effects.) removed 1379 transitions
Reduce isomorphic transitions removed 1379 transitions.
Graph (complete) has 2476 edges and 677 vertex of which 649 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 282 rules applied. Total rules applied 284 place count 649 transition count 886
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 273 rules applied. Total rules applied 557 place count 383 transition count 879
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 562 place count 378 transition count 879
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 562 place count 378 transition count 822
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 676 place count 321 transition count 822
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 682 place count 315 transition count 816
Iterating global reduction 3 with 6 rules applied. Total rules applied 688 place count 315 transition count 816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 689 place count 315 transition count 815
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 689 place count 315 transition count 811
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 697 place count 311 transition count 811
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 881 place count 219 transition count 719
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 951 place count 184 transition count 923
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 979 place count 184 transition count 895
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 980 place count 183 transition count 883
Iterating global reduction 5 with 1 rules applied. Total rules applied 981 place count 183 transition count 883
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 983 place count 182 transition count 900
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 986 place count 182 transition count 897
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 6 with 96 rules applied. Total rules applied 1082 place count 182 transition count 801
Free-agglomeration rule applied 40 times with reduction of 6 identical transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1122 place count 182 transition count 755
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 6 with 136 rules applied. Total rules applied 1258 place count 142 transition count 659
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1263 place count 137 transition count 627
Iterating global reduction 7 with 5 rules applied. Total rules applied 1268 place count 137 transition count 627
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 7 with 50 rules applied. Total rules applied 1318 place count 137 transition count 577
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1323 place count 137 transition count 577
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1326 place count 137 transition count 574
Applied a total of 1326 rules in 283 ms. Remains 137 /954 variables (removed 817) and now considering 574/2547 (removed 1973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 137/954 places, 574/2547 transitions.
RANDOM walk for 40000 steps (532 resets) in 625 ms. (63 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (54 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (28 resets) in 58 ms. (678 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (54 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
[2024-05-21 22:11:44] [INFO ] Flow matrix only has 377 transitions (discarded 197 similar events)
// Phase 1: matrix 377 rows 137 cols
[2024-05-21 22:11:45] [INFO ] Computed 16 invariants in 11 ms
[2024-05-21 22:11:45] [INFO ] State equation strengthened by 157 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 42/123 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 355/478 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 110/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 36/514 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 47/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 310 constraints, problems are : Problem set: 0 solved, 6 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 137/137 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 15/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 42/123 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:11:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 355/478 variables, 123/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 110/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 36/514 variables, 14/269 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 47/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/514 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 317 constraints, problems are : Problem set: 0 solved, 6 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 137/137 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 5 properties in 334 ms.
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 574/574 transitions.
Graph (trivial) has 77 edges and 137 vertex of which 12 / 137 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 556
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 129 transition count 556
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 129 transition count 554
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 127 transition count 554
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 122 transition count 549
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 122 transition count 548
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 120 transition count 556
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 31 place count 120 transition count 549
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 4 with 65 rules applied. Total rules applied 96 place count 120 transition count 484
Free-agglomeration rule applied 12 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 108 place count 120 transition count 470
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 178 place count 108 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 208 place count 108 transition count 382
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 108 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 107 transition count 381
Applied a total of 210 rules in 87 ms. Remains 107 /137 variables (removed 30) and now considering 381/574 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 107/137 places, 381/574 transitions.
RANDOM walk for 40000 steps (587 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (88 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 505191 steps, run visited all 1 properties in 1283 ms. (steps per millisecond=393 )
Probabilistic random walk after 505191 steps, saw 80015 distinct states, run finished after 1287 ms. (steps per millisecond=392 ) properties seen :1
FORMULA CloudDeployment-PT-5b-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-5b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 153 stabilizing places and 1505 stable transitions
Graph (complete) has 2930 edges and 954 vertex of which 926 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.27 ms
FORMULA CloudDeployment-PT-5b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 933 transition count 1514
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 933 transition count 1514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 933 transition count 1513
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 929 transition count 1509
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 929 transition count 1509
Applied a total of 50 rules in 97 ms. Remains 929 /954 variables (removed 25) and now considering 1509/2547 (removed 1038) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2024-05-21 22:11:48] [INFO ] Computed 15 invariants in 6 ms
[2024-05-21 22:11:48] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-05-21 22:11:48] [INFO ] Invariant cache hit.
[2024-05-21 22:11:49] [INFO ] Implicit Places using invariants and state equation in 894 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2024-05-21 22:11:49] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1311 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/954 places, 1509/2547 transitions.
Applied a total of 0 rules in 25 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1434 ms. Remains : 928/954 places, 1509/2547 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 695 ms.
Product exploration explored 100000 steps with 50000 reset in 491 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2860 edges and 928 vertex of which 912 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5b-LTLFireability-00 finished in 2933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F((p0||G(p1)))||(p2&&X((p2 U (!p0||G(p2))))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 935 transition count 1516
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 935 transition count 1516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 935 transition count 1515
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 933 transition count 1513
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 933 transition count 1513
Applied a total of 42 rules in 84 ms. Remains 933 /954 variables (removed 21) and now considering 1513/2547 (removed 1034) transitions.
// Phase 1: matrix 1513 rows 933 cols
[2024-05-21 22:11:51] [INFO ] Computed 15 invariants in 7 ms
[2024-05-21 22:11:51] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-21 22:11:51] [INFO ] Invariant cache hit.
[2024-05-21 22:11:52] [INFO ] Implicit Places using invariants and state equation in 979 ms returned [11, 19, 185, 193, 358, 366, 533, 541, 706, 716]
[2024-05-21 22:11:52] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 932/954 places, 1513/2547 transitions.
Applied a total of 0 rules in 24 ms. Remains 932 /932 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1413 ms. Remains : 932/954 places, 1513/2547 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01
Product exploration explored 100000 steps with 636 reset in 269 ms.
Product exploration explored 100000 steps with 633 reset in 318 ms.
Computed a total of 137 stabilizing places and 477 stable transitions
Graph (complete) has 2869 edges and 932 vertex of which 916 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.14 ms
Computed a total of 137 stabilizing places and 477 stable transitions
Detected a total of 137/932 stabilizing places and 477/1513 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (255 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (31 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 333847 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :5 out of 6
Probabilistic random walk after 333847 steps, saw 77241 distinct states, run finished after 3003 ms. (steps per millisecond=111 ) properties seen :5
// Phase 1: matrix 1513 rows 932 cols
[2024-05-21 22:11:57] [INFO ] Computed 14 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/391 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/575 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 692/1267 variables, 327/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1267 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 452/1719 variables, 214/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1719 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 410/2129 variables, 172/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2129 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 255/2384 variables, 158/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2384 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 41/2425 variables, 29/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2425 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/2441 variables, 8/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2441 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/2445 variables, 4/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2445 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2445 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2445/2445 variables, and 946 constraints, problems are : Problem set: 0 solved, 1 unsolved in 836 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 378/391 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 184/575 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 692/1267 variables, 327/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1267 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 452/1719 variables, 214/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1719 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 410/2129 variables, 172/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2129 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 255/2384 variables, 158/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2384 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 41/2425 variables, 29/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2425 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 16/2441 variables, 8/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2441 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/2445 variables, 4/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2445 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2445 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2445/2445 variables, and 947 constraints, problems are : Problem set: 0 solved, 1 unsolved in 619 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 932/932 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1475ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1513/1513 transitions.
Graph (trivial) has 972 edges and 932 vertex of which 355 / 932 are part of one of the 40 SCC in 2 ms
Free SCC test removed 315 places
Drop transitions (Empty/Sink Transition effects.) removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Graph (complete) has 2319 edges and 617 vertex of which 601 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 273 rules applied. Total rules applied 275 place count 601 transition count 837
Reduce places removed 254 places and 0 transitions.
Iterating post reduction 1 with 254 rules applied. Total rules applied 529 place count 347 transition count 837
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 529 place count 347 transition count 782
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 639 place count 292 transition count 782
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 645 place count 286 transition count 776
Iterating global reduction 2 with 6 rules applied. Total rules applied 651 place count 286 transition count 776
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 651 place count 286 transition count 770
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 663 place count 280 transition count 770
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 823 place count 200 transition count 690
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 893 place count 165 transition count 900
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 928 place count 165 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1083 place count 165 transition count 710
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1133 place count 165 transition count 640
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 898 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 196 rules applied. Total rules applied 1329 place count 114 transition count 495
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1330 place count 114 transition count 494
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1335 place count 109 transition count 464
Iterating global reduction 5 with 5 rules applied. Total rules applied 1340 place count 109 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 1415 place count 109 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1416 place count 108 transition count 388
Applied a total of 1416 rules in 101 ms. Remains 108 /932 variables (removed 824) and now considering 388/1513 (removed 1125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 108/932 places, 388/1513 transitions.
RANDOM walk for 23126 steps (352 resets) in 72 ms. (316 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 921 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1513/1513 transitions.
Applied a total of 0 rules in 22 ms. Remains 932 /932 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
[2024-05-21 22:12:00] [INFO ] Invariant cache hit.
[2024-05-21 22:12:00] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 22:12:00] [INFO ] Invariant cache hit.
[2024-05-21 22:12:01] [INFO ] Implicit Places using invariants and state equation in 884 ms returned [18, 184, 192, 357, 365, 532, 540, 705, 715]
[2024-05-21 22:12:01] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1071 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/932 places, 1513/1513 transitions.
Applied a total of 0 rules in 22 ms. Remains 931 /931 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1115 ms. Remains : 931/932 places, 1513/1513 transitions.
Computed a total of 137 stabilizing places and 477 stable transitions
Graph (complete) has 2852 edges and 931 vertex of which 916 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Computed a total of 137 stabilizing places and 477 stable transitions
Detected a total of 137/931 stabilizing places and 477/1513 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (251 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 328537 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :5 out of 6
Probabilistic random walk after 328537 steps, saw 76117 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :5
// Phase 1: matrix 1513 rows 931 cols
[2024-05-21 22:12:05] [INFO ] Computed 13 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 378/391 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/555 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 688/1243 variables, 313/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1243 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 469/1712 variables, 223/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1712 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 414/2126 variables, 175/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2126 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 255/2381 variables, 158/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2381 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 43/2424 variables, 30/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2424 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/2440 variables, 8/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2440 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/2444 variables, 4/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2444 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2444 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2444/2444 variables, and 944 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 931/931 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 378/391 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/555 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 688/1243 variables, 313/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1243 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 469/1712 variables, 223/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1712 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/2126 variables, 175/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2126 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 255/2381 variables, 158/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2381 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/2424 variables, 30/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2424 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 16/2440 variables, 8/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2440 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/2444 variables, 4/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2444 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2444 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2444/2444 variables, and 945 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 931/931 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 1513/1513 transitions.
Graph (trivial) has 971 edges and 931 vertex of which 355 / 931 are part of one of the 40 SCC in 2 ms
Free SCC test removed 315 places
Drop transitions (Empty/Sink Transition effects.) removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Graph (complete) has 2302 edges and 616 vertex of which 601 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 601 transition count 837
Reduce places removed 254 places and 0 transitions.
Iterating post reduction 1 with 254 rules applied. Total rules applied 528 place count 347 transition count 837
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 528 place count 347 transition count 782
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 638 place count 292 transition count 782
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 644 place count 286 transition count 776
Iterating global reduction 2 with 6 rules applied. Total rules applied 650 place count 286 transition count 776
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 650 place count 286 transition count 770
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 662 place count 280 transition count 770
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 822 place count 200 transition count 690
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 892 place count 165 transition count 900
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 927 place count 165 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1082 place count 165 transition count 710
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1132 place count 165 transition count 640
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 898 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 196 rules applied. Total rules applied 1328 place count 114 transition count 495
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1329 place count 114 transition count 494
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1334 place count 109 transition count 464
Iterating global reduction 5 with 5 rules applied. Total rules applied 1339 place count 109 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 1414 place count 109 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1415 place count 108 transition count 388
Applied a total of 1415 rules in 93 ms. Remains 108 /931 variables (removed 823) and now considering 388/1513 (removed 1125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 108/931 places, 388/1513 transitions.
RANDOM walk for 17511 steps (273 resets) in 53 ms. (324 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 950 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 614 reset in 173 ms.
Product exploration explored 100000 steps with 613 reset in 183 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 1513/1513 transitions.
Graph (trivial) has 969 edges and 931 vertex of which 355 / 931 are part of one of the 40 SCC in 5 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2427 edges and 616 vertex of which 601 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.4 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 248 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 248 rules applied. Total rules applied 250 place count 601 transition count 1151
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 250 place count 601 transition count 1180
Deduced a syphon composed of 282 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 284 place count 601 transition count 1180
Discarding 132 places :
Symmetric choice reduction at 1 with 132 rule applications. Total rules 416 place count 469 transition count 1048
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 132 rules applied. Total rules applied 548 place count 469 transition count 1048
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 650 place count 469 transition count 1048
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 727 place count 392 transition count 971
Deduced a syphon composed of 175 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 804 place count 392 transition count 971
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 839 place count 392 transition count 1226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 844 place count 392 transition count 1221
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 884 place count 352 transition count 1096
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 924 place count 352 transition count 1096
Deduced a syphon composed of 170 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 2 with 75 rules applied. Total rules applied 999 place count 352 transition count 1021
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1009 place count 342 transition count 1011
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 1019 place count 342 transition count 1011
Deduced a syphon composed of 160 places in 1 ms
Applied a total of 1019 rules in 187 ms. Remains 342 /931 variables (removed 589) and now considering 1011/1513 (removed 502) transitions.
[2024-05-21 22:12:09] [INFO ] Redundant transitions in 645 ms returned []
Running 1010 sub problems to find dead transitions.
[2024-05-21 22:12:09] [INFO ] Flow matrix only has 852 transitions (discarded 159 similar events)
// Phase 1: matrix 852 rows 342 cols
[2024-05-21 22:12:09] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:12:09] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1010 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
At refinement iteration 2 (OVERLAPS) 851/1192 variables, 341/346 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1192 variables, 250/596 constraints. Problems are: Problem set: 209 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1192/1194 variables, and 596 constraints, problems are : Problem set: 209 solved, 801 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 341/342 constraints, ReadFeed: 250/251 constraints, PredecessorRefiner: 1010/1010 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 209 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 1 (OVERLAPS) 12/193 variables, 5/5 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 3 (OVERLAPS) 836/1029 variables, 193/198 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 250/448 constraints. Problems are: Problem set: 209 solved, 801 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1029 variables, 801/1249 constraints. Problems are: Problem set: 209 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1194 variables, and 1249 constraints, problems are : Problem set: 209 solved, 801 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/342 constraints, ReadFeed: 250/251 constraints, PredecessorRefiner: 801/1010 constraints, Known Traps: 0/0 constraints]
After SMT, in 62034ms problems are : Problem set: 209 solved, 801 unsolved
Search for dead transitions found 209 dead transitions in 62043ms
Found 209 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 209 transitions
Dead transitions reduction (with SMT) removed 209 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 342/931 places, 802/1513 transitions.
Graph (complete) has 1787 edges and 342 vertex of which 182 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.2 ms
Discarding 160 places :
Also discarding 0 output transitions
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -105
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 182 transition count 907
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 101 place count 182 transition count 812
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 101 rules in 44 ms. Remains 182 /342 variables (removed 160) and now considering 812/802 (removed -10) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 182/931 places, 812/1513 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62952 ms. Remains : 182/931 places, 812/1513 transitions.
Built C files in :
/tmp/ltsmin16644078432169396658
[2024-05-21 22:13:11] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16644078432169396658
Running compilation step : cd /tmp/ltsmin16644078432169396658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16644078432169396658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16644078432169396658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 931/931 places, 1513/1513 transitions.
Applied a total of 0 rules in 18 ms. Remains 931 /931 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
// Phase 1: matrix 1513 rows 931 cols
[2024-05-21 22:13:15] [INFO ] Computed 13 invariants in 5 ms
[2024-05-21 22:13:15] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 22:13:15] [INFO ] Invariant cache hit.
[2024-05-21 22:13:16] [INFO ] Implicit Places using invariants and state equation in 899 ms returned [183, 191, 356, 364, 531, 539, 704, 714]
[2024-05-21 22:13:16] [INFO ] Actually due to overlaps returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1091 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/931 places, 1513/1513 transitions.
Applied a total of 0 rules in 18 ms. Remains 930 /930 variables (removed 0) and now considering 1513/1513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1127 ms. Remains : 930/931 places, 1513/1513 transitions.
Built C files in :
/tmp/ltsmin15374574336795218040
[2024-05-21 22:13:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15374574336795218040
Running compilation step : cd /tmp/ltsmin15374574336795218040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15374574336795218040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15374574336795218040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 22:13:19] [INFO ] Flatten gal took : 53 ms
[2024-05-21 22:13:19] [INFO ] Flatten gal took : 53 ms
[2024-05-21 22:13:19] [INFO ] Time to serialize gal into /tmp/LTL11627898953011669978.gal : 22 ms
[2024-05-21 22:13:19] [INFO ] Time to serialize properties into /tmp/LTL521716887607086352.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11627898953011669978.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15243801752056866865.hoa' '-atoms' '/tmp/LTL521716887607086352.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL521716887607086352.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15243801752056866865.hoa
Detected timeout of ITS tools.
[2024-05-21 22:13:34] [INFO ] Flatten gal took : 49 ms
[2024-05-21 22:13:34] [INFO ] Flatten gal took : 47 ms
[2024-05-21 22:13:34] [INFO ] Time to serialize gal into /tmp/LTL4074113624573576945.gal : 9 ms
[2024-05-21 22:13:34] [INFO ] Time to serialize properties into /tmp/LTL10667148993118867092.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4074113624573576945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10667148993118867092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(p682==1)")||(G("(p1183==0)"))))||(("(p1183!=1)")&&(X(("(p1183!=1)")U(("(p682!=1)")||(G("(p1183!=1)")))))))))))
Formula 0 simplified : XXF(G(!"(p682==1)" & F!"(p1183==0)") & (!"(p1183!=1)" | X(!"(p1183!=1)" M !"(p682!=1)")))
Detected timeout of ITS tools.
[2024-05-21 22:13:50] [INFO ] Flatten gal took : 44 ms
[2024-05-21 22:13:50] [INFO ] Applying decomposition
[2024-05-21 22:13:50] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3850203432168948546.txt' '-o' '/tmp/graph3850203432168948546.bin' '-w' '/tmp/graph3850203432168948546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3850203432168948546.bin' '-l' '-1' '-v' '-w' '/tmp/graph3850203432168948546.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:13:50] [INFO ] Decomposing Gal with order
[2024-05-21 22:13:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:13:50] [INFO ] Removed a total of 1700 redundant transitions.
[2024-05-21 22:13:50] [INFO ] Flatten gal took : 470 ms
[2024-05-21 22:13:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 28 ms.
[2024-05-21 22:13:50] [INFO ] Time to serialize gal into /tmp/LTL13209331782172504537.gal : 16 ms
[2024-05-21 22:13:50] [INFO ] Time to serialize properties into /tmp/LTL18301581143052822844.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13209331782172504537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18301581143052822844.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(i13.i1.i0.u142.p682==1)")||(G("(i26.u261.p1183==0)"))))||(("(i26.u261.p1183!=1)")&&(X(("(i26.u261.p1183!=1)")U(("(i13.i...212
Formula 0 simplified : XXF(G(!"(i13.i1.i0.u142.p682==1)" & F!"(i26.u261.p1183==0)") & (!"(i26.u261.p1183!=1)" | X(!"(i26.u261.p1183!=1)" M !"(i13.i1.i0.u14...169
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 134685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 930 transition count 1510
Applied a total of 48 rules in 70 ms. Remains 930 /954 variables (removed 24) and now considering 1510/2547 (removed 1037) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2024-05-21 22:14:06] [INFO ] Computed 15 invariants in 7 ms
[2024-05-21 22:14:06] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 22:14:06] [INFO ] Invariant cache hit.
[2024-05-21 22:14:07] [INFO ] Implicit Places using invariants and state equation in 945 ms returned [11, 19, 185, 193, 359, 367, 532, 540, 705, 713]
[2024-05-21 22:14:07] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/954 places, 1510/2547 transitions.
Applied a total of 0 rules in 18 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1251 ms. Remains : 929/954 places, 1510/2547 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-03
Stuttering criterion allowed to conclude after 189 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-03 finished in 1448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U X(G(!p2)))&&p0)))'
Support contains 24 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 945 transition count 2538
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 945 transition count 2538
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 945 transition count 2537
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 941 transition count 2533
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 941 transition count 2533
Applied a total of 27 rules in 93 ms. Remains 941 /954 variables (removed 13) and now considering 2533/2547 (removed 14) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-21 22:14:07] [INFO ] Computed 16 invariants in 17 ms
[2024-05-21 22:14:08] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-21 22:14:08] [INFO ] Invariant cache hit.
[2024-05-21 22:14:10] [INFO ] Implicit Places using invariants and state equation in 2228 ms returned []
Implicit Place search using SMT with State Equation took 2770 ms to find 0 implicit places.
Running 2532 sub problems to find dead transitions.
[2024-05-21 22:14:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 2532/1508 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 1024/1508 constraints, Known Traps: 0/0 constraints]
After SMT, in 80327ms problems are : Problem set: 0 solved, 2532 unsolved
Search for dead transitions found 0 dead transitions in 80352ms
Starting structural reductions in LTL mode, iteration 1 : 941/954 places, 2533/2547 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83230 ms. Remains : 941/954 places, 2533/2547 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04
Product exploration explored 100000 steps with 621 reset in 426 ms.
Product exploration explored 100000 steps with 630 reset in 369 ms.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 202 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) p2), p2, p2]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (248 resets) in 556 ms. (71 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (32 resets) in 239 ms. (166 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (31 resets) in 334 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (33 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 74 ms. (533 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (31 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
[2024-05-21 22:15:32] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 442/2869 variables, 196/636 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2869 variables, 0/636 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 408/3277 variables, 188/824 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3277 variables, 0/824 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 159/3436 variables, 109/933 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3436 variables, 0/933 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 33/3469 variables, 19/952 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3469 variables, 0/952 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 5/3474 variables, 5/957 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3474/3474 variables, and 957 constraints, problems are : Problem set: 2 solved, 7 unsolved in 2736 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 941/941 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 3/443 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2427 variables, 0/443 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 442/2869 variables, 196/639 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2869 variables, 0/639 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 408/3277 variables, 188/827 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3277 variables, 0/827 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 159/3436 variables, 109/936 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3436 variables, 0/936 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 33/3469 variables, 19/955 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3469/3474 variables, and 955 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 936/941 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7897ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 2 ms
Free SCC test removed 307 places
Drop transitions (Empty/Sink Transition effects.) removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 214 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 146/941 places, 1499/2533 transitions.
RANDOM walk for 40000 steps (1037 resets) in 837 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (101 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (110 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (105 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (105 resets) in 92 ms. (430 steps per ms) remains 2/7 properties
[2024-05-21 22:15:41] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2024-05-21 22:15:41] [INFO ] Computed 21 invariants in 10 ms
[2024-05-21 22:15:41] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 95/114 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 31/145 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 2 unsolved in 410 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 95/114 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 31/145 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1444 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1444 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1445 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1445/1445 variables, and 322 constraints, problems are : Problem set: 0 solved, 2 unsolved in 529 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 158 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 2 properties in 7 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p1), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 32 factoid took 613 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 23 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-21 22:15:43] [INFO ] Computed 16 invariants in 22 ms
[2024-05-21 22:15:43] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-21 22:15:43] [INFO ] Invariant cache hit.
[2024-05-21 22:15:46] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 2896 ms to find 0 implicit places.
Running 2532 sub problems to find dead transitions.
[2024-05-21 22:15:46] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 2532/1508 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 1024/1508 constraints, Known Traps: 0/0 constraints]
After SMT, in 80111ms problems are : Problem set: 0 solved, 2532 unsolved
Search for dead transitions found 0 dead transitions in 80135ms
Finished structural reductions in LTL mode , in 1 iterations and 83068 ms. Remains : 941/941 places, 2533/2533 transitions.
Computed a total of 145 stabilizing places and 1497 stable transitions
Graph (complete) has 2908 edges and 941 vertex of which 913 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.8 ms
Computed a total of 145 stabilizing places and 1497 stable transitions
Detected a total of 145/941 stabilizing places and 1497/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 154 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
RANDOM walk for 40000 steps (248 resets) in 211 ms. (188 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (28 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
[2024-05-21 22:17:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 442/2869 variables, 196/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2869 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 408/3277 variables, 188/824 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3277 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 159/3436 variables, 109/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3436 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 33/3469 variables, 19/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3469 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 5/3474 variables, 5/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/3474 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3474/3474 variables, and 957 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2610 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 941/941 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 197/221 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1720/1941 variables, 221/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1941 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 486/2427 variables, 203/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2427 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2427 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 442/2869 variables, 196/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2869 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 408/3277 variables, 188/827 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3277 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 159/3436 variables, 109/936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3436 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 33/3469 variables, 19/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3469 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 5/3474 variables, 5/960 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3474/3474 variables, and 960 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 941/941 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 7709ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Graph (trivial) has 950 edges and 941 vertex of which 346 / 941 are part of one of the 39 SCC in 2 ms
Free SCC test removed 307 places
Drop transitions (Empty/Sink Transition effects.) removed 391 transitions
Reduce isomorphic transitions removed 391 transitions.
Graph (complete) has 2392 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 633 transition count 1890
Reduce places removed 247 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 250 rules applied. Total rules applied 504 place count 386 transition count 1887
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 506 place count 384 transition count 1887
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 506 place count 384 transition count 1825
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 630 place count 322 transition count 1825
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 802 place count 236 transition count 1739
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 872 place count 201 transition count 1949
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 904 place count 201 transition count 1917
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 4 with 130 rules applied. Total rules applied 1034 place count 201 transition count 1787
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1082 place count 201 transition count 1727
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 4 with 166 rules applied. Total rules applied 1248 place count 153 transition count 1609
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1255 place count 146 transition count 1562
Iterating global reduction 5 with 7 rules applied. Total rules applied 1262 place count 146 transition count 1562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1264 place count 146 transition count 1560
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1325 place count 146 transition count 1499
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1327 place count 146 transition count 1499
Applied a total of 1327 rules in 193 ms. Remains 146 /941 variables (removed 795) and now considering 1499/2533 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 146/941 places, 1499/2533 transitions.
RANDOM walk for 40000 steps (1026 resets) in 658 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (102 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (98 resets) in 93 ms. (425 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (106 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
[2024-05-21 22:17:15] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
// Phase 1: matrix 1299 rows 146 cols
[2024-05-21 22:17:15] [INFO ] Computed 21 invariants in 13 ms
[2024-05-21 22:17:15] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 3 unsolved in 553 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1445 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1445/1445 variables, and 322 constraints, problems are : Problem set: 0 solved, 3 unsolved in 732 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1355ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 172 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1499/1499 transitions.
RANDOM walk for 40000 steps (1024 resets) in 416 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (103 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (106 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (105 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 439943 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 3
Probabilistic random walk after 439943 steps, saw 65429 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-21 22:17:20] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 22:17:20] [INFO ] Invariant cache hit.
[2024-05-21 22:17:20] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/1445 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1445 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1445/1445 variables, and 321 constraints, problems are : Problem set: 0 solved, 3 unsolved in 585 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 121/145 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1444 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1444 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1445 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1445 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1445/1445 variables, and 322 constraints, problems are : Problem set: 0 solved, 3 unsolved in 682 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 146/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1324ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 282 ms.
Support contains 24 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 27 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 146/146 places, 1499/1499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1499/1499 transitions.
Applied a total of 0 rules in 20 ms. Remains 146 /146 variables (removed 0) and now considering 1499/1499 (removed 0) transitions.
[2024-05-21 22:17:21] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 22:17:21] [INFO ] Invariant cache hit.
[2024-05-21 22:17:22] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-21 22:17:22] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 22:17:22] [INFO ] Invariant cache hit.
[2024-05-21 22:17:22] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-21 22:17:23] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2024-05-21 22:17:23] [INFO ] Redundant transitions in 157 ms returned []
Running 1498 sub problems to find dead transitions.
[2024-05-21 22:17:23] [INFO ] Flow matrix only has 1299 transitions (discarded 200 similar events)
[2024-05-21 22:17:23] [INFO ] Invariant cache hit.
[2024-05-21 22:17:23] [INFO ] State equation strengthened by 154 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 2 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1444/1445 variables, and 320 constraints, problems are : Problem set: 0 solved, 1498 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 145/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1498/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 2 (OVERLAPS) 1299/1444 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1444 variables, 154/320 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 473/793 constraints. Problems are: Problem set: 0 solved, 1498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1444/1445 variables, and 793 constraints, problems are : Problem set: 0 solved, 1498 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 145/146 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1498/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 80302ms problems are : Problem set: 0 solved, 1498 unsolved
Search for dead transitions found 0 dead transitions in 80317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81996 ms. Remains : 146/146 places, 1499/1499 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 146 vertex of which 32 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Empty/Sink Transition effects.) removed 44 transitions
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 118 transition count 1246
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 109 transition count 1244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 107 transition count 1243
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 107 transition count 1235
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 99 transition count 1235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 96 transition count 1232
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 96 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 93 transition count 1214
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 93 transition count 1214
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 94 place count 93 transition count 1172
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 108 place count 86 transition count 1163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 114 place count 86 transition count 1157
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 120 place count 83 transition count 1172
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 155 place count 83 transition count 1137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 155 place count 83 transition count 1134
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 161 place count 80 transition count 1134
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 80 transition count 1132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 78 transition count 1132
Applied a total of 165 rules in 85 ms. Remains 78 /146 variables (removed 68) and now considering 1132/1499 (removed 367) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1132 rows 78 cols
[2024-05-21 22:18:43] [INFO ] Computed 21 invariants in 7 ms
[2024-05-21 22:18:43] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 22:18:43] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 2 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-21 22:18:44] [INFO ] After 237ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :3
[2024-05-21 22:18:44] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 451 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) p0))), (F p2), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 354 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 621 reset in 289 ms.
Product exploration explored 100000 steps with 635 reset in 435 ms.
Built C files in :
/tmp/ltsmin6109246545873974055
[2024-05-21 22:18:45] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6109246545873974055
Running compilation step : cd /tmp/ltsmin6109246545873974055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6109246545873974055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6109246545873974055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 24 out of 941 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 941/941 places, 2533/2533 transitions.
Applied a total of 0 rules in 24 ms. Remains 941 /941 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
// Phase 1: matrix 2533 rows 941 cols
[2024-05-21 22:18:48] [INFO ] Computed 16 invariants in 10 ms
[2024-05-21 22:18:49] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-21 22:18:49] [INFO ] Invariant cache hit.
[2024-05-21 22:18:51] [INFO ] Implicit Places using invariants and state equation in 2211 ms returned []
Implicit Place search using SMT with State Equation took 2761 ms to find 0 implicit places.
Running 2532 sub problems to find dead transitions.
[2024-05-21 22:18:51] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 2532/1508 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2532 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 940/3474 variables, and 16 constraints, problems are : Problem set: 0 solved, 2532 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/941 constraints, PredecessorRefiner: 1024/1508 constraints, Known Traps: 0/0 constraints]
After SMT, in 80971ms problems are : Problem set: 0 solved, 2532 unsolved
Search for dead transitions found 0 dead transitions in 80994ms
Finished structural reductions in LTL mode , in 1 iterations and 83793 ms. Remains : 941/941 places, 2533/2533 transitions.
Built C files in :
/tmp/ltsmin8563221229326890210
[2024-05-21 22:20:12] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8563221229326890210
Running compilation step : cd /tmp/ltsmin8563221229326890210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8563221229326890210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8563221229326890210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 22:20:15] [INFO ] Flatten gal took : 191 ms
[2024-05-21 22:20:16] [INFO ] Flatten gal took : 190 ms
[2024-05-21 22:20:16] [INFO ] Time to serialize gal into /tmp/LTL17006208881411026423.gal : 25 ms
[2024-05-21 22:20:16] [INFO ] Time to serialize properties into /tmp/LTL6974389339671669285.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17006208881411026423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13696169265529455095.hoa' '-atoms' '/tmp/LTL6974389339671669285.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(p1437==0)")&&(("(p1260==1)")U(X(G(!("(((((p49==1)&&(p87==1))&&((p245==1)&&(p1503==1)))&&(p1521==1))||(p1260==1))"))))))&&("((...377
Formula 0 simplified : G(!"((((((p27==0)||(p58==0))||((p95==0)||(p302==0)))||(((p348==0)||(p385==0))||((p592==0)||(p638==0))))||((((p675==0)||(p882==0))||(...364
Detected timeout of ITS tools.
[2024-05-21 22:20:46] [INFO ] Flatten gal took : 188 ms
[2024-05-21 22:20:46] [INFO ] Applying decomposition
[2024-05-21 22:20:47] [INFO ] Flatten gal took : 190 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4153275205356271960.txt' '-o' '/tmp/graph4153275205356271960.bin' '-w' '/tmp/graph4153275205356271960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4153275205356271960.bin' '-l' '-1' '-v' '-w' '/tmp/graph4153275205356271960.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:20:47] [INFO ] Decomposing Gal with order
[2024-05-21 22:20:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:20:48] [INFO ] Removed a total of 10963 redundant transitions.
[2024-05-21 22:20:48] [INFO ] Flatten gal took : 582 ms
[2024-05-21 22:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2115 labels/synchronizations in 163 ms.
[2024-05-21 22:20:48] [INFO ] Time to serialize gal into /tmp/LTL13660851890168010924.gal : 31 ms
[2024-05-21 22:20:48] [INFO ] Time to serialize properties into /tmp/LTL402498731268385689.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13660851890168010924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL402498731268385689.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((("(i24.i1.i2.u324.p1437==0)")&&(("(i8.i0.i1.u271.p1260==1)")U(X(G(!("(((((i17.u5.p49==1)&&(i17.u340.p87==1))&&((i4.i1.i0.u54.p24...632
Formula 0 simplified : G(!"((((((i17.u5.p27==0)||(i17.u340.p58==0))||((i4.i1.i3.u11.p95==0)||(i17.u340.p302==0)))||(((i11.u75.p348==0)||(i11.u77.p385==0))|...619
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 416125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Support contains 9 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 933 transition count 1514
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 933 transition count 1514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 933 transition count 1513
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 929 transition count 1509
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 929 transition count 1509
Applied a total of 50 rules in 59 ms. Remains 929 /954 variables (removed 25) and now considering 1509/2547 (removed 1038) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2024-05-21 22:21:03] [INFO ] Computed 15 invariants in 7 ms
[2024-05-21 22:21:03] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 22:21:03] [INFO ] Invariant cache hit.
[2024-05-21 22:21:04] [INFO ] Implicit Places using invariants and state equation in 814 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2024-05-21 22:21:04] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1002 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/954 places, 1509/2547 transitions.
Applied a total of 0 rules in 19 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1082 ms. Remains : 928/954 places, 1509/2547 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05
Product exploration explored 100000 steps with 614 reset in 188 ms.
Product exploration explored 100000 steps with 609 reset in 203 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2860 edges and 928 vertex of which 912 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (251 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (28 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (27 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (25 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 218218 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 5
Probabilistic random walk after 218218 steps, saw 51077 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 1509 rows 928 cols
[2024-05-21 22:21:08] [INFO ] Computed 14 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 187/196 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 681/877 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 484/1361 variables, 203/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1361 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 436/1797 variables, 194/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1797 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 423/2220 variables, 189/796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2220 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 167/2387 variables, 116/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2387 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 35/2422 variables, 20/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2422 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 15/2437 variables, 10/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2437 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2437 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2437/2437 variables, and 942 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1329 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 187/196 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 681/877 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 484/1361 variables, 203/413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1361 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1361 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 436/1797 variables, 194/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1797 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 423/2220 variables, 189/801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2220 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 167/2387 variables, 116/917 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2387 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 35/2422 variables, 20/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2422 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 15/2437 variables, 10/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2437 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2437 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2437/2437 variables, and 947 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3486 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4848ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 835 ms.
Support contains 9 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1509/1509 transitions.
Graph (trivial) has 956 edges and 928 vertex of which 341 / 928 are part of one of the 38 SCC in 1 ms
Free SCC test removed 303 places
Drop transitions (Empty/Sink Transition effects.) removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Graph (complete) has 2349 edges and 625 vertex of which 609 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 609 transition count 850
Reduce places removed 254 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 257 rules applied. Total rules applied 530 place count 355 transition count 847
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 532 place count 353 transition count 847
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 532 place count 353 transition count 790
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 646 place count 296 transition count 790
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 651 place count 291 transition count 785
Iterating global reduction 3 with 5 rules applied. Total rules applied 656 place count 291 transition count 785
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 656 place count 291 transition count 781
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 664 place count 287 transition count 781
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 830 place count 204 transition count 698
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 900 place count 169 transition count 908
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 932 place count 169 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 934 place count 168 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 937 place count 168 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 1065 place count 168 transition count 762
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1108 place count 168 transition count 707
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 5 with 161 rules applied. Total rules applied 1269 place count 125 transition count 589
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1276 place count 118 transition count 542
Iterating global reduction 6 with 7 rules applied. Total rules applied 1283 place count 118 transition count 542
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1285 place count 118 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 7 with 61 rules applied. Total rules applied 1346 place count 118 transition count 479
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1350 place count 118 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1353 place count 118 transition count 476
Applied a total of 1353 rules in 96 ms. Remains 118 /928 variables (removed 810) and now considering 476/1509 (removed 1033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 118/928 places, 476/1509 transitions.
RANDOM walk for 40000 steps (689 resets) in 589 ms. (67 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (41 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (42 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2024-05-21 22:21:14] [INFO ] Flow matrix only has 276 transitions (discarded 200 similar events)
// Phase 1: matrix 276 rows 118 cols
[2024-05-21 22:21:14] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 22:21:14] [INFO ] State equation strengthened by 141 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/114 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 275/389 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 120/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/394 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 21/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/394 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/114 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 275/389 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 120/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/394 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 21/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/394 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 662ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 93 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1509/1509 transitions.
Applied a total of 0 rules in 20 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
// Phase 1: matrix 1509 rows 928 cols
[2024-05-21 22:21:16] [INFO ] Computed 14 invariants in 8 ms
[2024-05-21 22:21:16] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 22:21:16] [INFO ] Invariant cache hit.
[2024-05-21 22:21:17] [INFO ] Implicit Places using invariants and state equation in 749 ms returned [18, 184, 192, 357, 365, 530, 538, 703, 711]
[2024-05-21 22:21:17] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 932 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 927/928 places, 1509/1509 transitions.
Applied a total of 0 rules in 15 ms. Remains 927 /927 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 967 ms. Remains : 927/928 places, 1509/1509 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2843 edges and 927 vertex of which 912 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (243 resets) in 393 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (27 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (28 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (24 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 250851 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 5
Probabilistic random walk after 250851 steps, saw 59782 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 1509 rows 927 cols
[2024-05-21 22:21:20] [INFO ] Computed 13 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 167/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 653/829 variables, 176/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 495/1324 variables, 202/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 450/1774 variables, 205/596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1774 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 421/2195 variables, 186/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2195 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 188/2383 variables, 125/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2383 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 38/2421 variables, 23/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2421 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 15/2436 variables, 10/940 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2436 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2436 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2436/2436 variables, and 940 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1261 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 927/927 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 167/176 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 653/829 variables, 176/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 495/1324 variables, 202/391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 5/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 450/1774 variables, 205/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1774 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 421/2195 variables, 186/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2195 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 188/2383 variables, 125/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2383 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 38/2421 variables, 23/935 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2421 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 15/2436 variables, 10/945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2436 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2436 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2436/2436 variables, and 945 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3435 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 927/927 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4728ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 80 ms.
Support contains 4 out of 927 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 927/927 places, 1509/1509 transitions.
Graph (trivial) has 965 edges and 927 vertex of which 355 / 927 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Drop transitions (Empty/Sink Transition effects.) removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Graph (complete) has 2293 edges and 612 vertex of which 597 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 597 transition count 836
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 522 place count 346 transition count 836
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 522 place count 346 transition count 779
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 636 place count 289 transition count 779
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 641 place count 284 transition count 774
Iterating global reduction 2 with 5 rules applied. Total rules applied 646 place count 284 transition count 774
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 646 place count 284 transition count 770
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 654 place count 280 transition count 770
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 814 place count 200 transition count 690
Performed 35 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 884 place count 165 transition count 900
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 919 place count 165 transition count 865
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 3 with 155 rules applied. Total rules applied 1074 place count 165 transition count 710
Free-agglomeration rule applied 48 times with reduction of 20 identical transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 1122 place count 165 transition count 642
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 923 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 194 rules applied. Total rules applied 1316 place count 116 transition count 497
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1317 place count 116 transition count 496
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1322 place count 111 transition count 466
Iterating global reduction 5 with 5 rules applied. Total rules applied 1327 place count 111 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 1402 place count 111 transition count 391
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1404 place count 111 transition count 391
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1405 place count 110 transition count 390
Applied a total of 1405 rules in 79 ms. Remains 110 /927 variables (removed 817) and now considering 390/1509 (removed 1119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 110/927 places, 390/1509 transitions.
RANDOM walk for 2413 steps (35 resets) in 11 ms. (201 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 618 reset in 188 ms.
Product exploration explored 100000 steps with 629 reset in 202 ms.
Built C files in :
/tmp/ltsmin14644542130182717051
[2024-05-21 22:21:26] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14644542130182717051
Running compilation step : cd /tmp/ltsmin14644542130182717051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14644542130182717051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14644542130182717051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 9 out of 927 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 927/927 places, 1509/1509 transitions.
Applied a total of 0 rules in 16 ms. Remains 927 /927 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
[2024-05-21 22:21:29] [INFO ] Invariant cache hit.
[2024-05-21 22:21:30] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 22:21:30] [INFO ] Invariant cache hit.
[2024-05-21 22:21:30] [INFO ] Implicit Places using invariants and state equation in 864 ms returned [183, 191, 356, 364, 529, 537, 702, 710]
[2024-05-21 22:21:30] [INFO ] Actually due to overlaps returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1016 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 926/927 places, 1509/1509 transitions.
Applied a total of 0 rules in 23 ms. Remains 926 /926 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1056 ms. Remains : 926/927 places, 1509/1509 transitions.
Built C files in :
/tmp/ltsmin6099870090391137667
[2024-05-21 22:21:30] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6099870090391137667
Running compilation step : cd /tmp/ltsmin6099870090391137667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6099870090391137667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6099870090391137667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 22:21:34] [INFO ] Flatten gal took : 39 ms
[2024-05-21 22:21:34] [INFO ] Flatten gal took : 39 ms
[2024-05-21 22:21:34] [INFO ] Time to serialize gal into /tmp/LTL5832738641069235516.gal : 6 ms
[2024-05-21 22:21:34] [INFO ] Time to serialize properties into /tmp/LTL13167733629922717319.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5832738641069235516.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13312896259723386834.hoa' '-atoms' '/tmp/LTL13167733629922717319.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13167733629922717319.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13312896259723386834.hoa
Detected timeout of ITS tools.
[2024-05-21 22:21:49] [INFO ] Flatten gal took : 39 ms
[2024-05-21 22:21:49] [INFO ] Flatten gal took : 40 ms
[2024-05-21 22:21:49] [INFO ] Time to serialize gal into /tmp/LTL5490107336461267441.gal : 6 ms
[2024-05-21 22:21:49] [INFO ] Time to serialize properties into /tmp/LTL13432084517740300725.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5490107336461267441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13432084517740300725.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))")||(("(p1521==0)")||(X("(((p301==0)||(p343==0))||((p580==0)||(p1472...296
Formula 0 simplified : XF(!"((((p301==0)||(p343==0))||((p580==0)||(p1472==0)))&&((((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))||(p1521==0)))" & XXF(!"...280
Detected timeout of ITS tools.
[2024-05-21 22:22:04] [INFO ] Flatten gal took : 42 ms
[2024-05-21 22:22:04] [INFO ] Applying decomposition
[2024-05-21 22:22:04] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9786162419336381890.txt' '-o' '/tmp/graph9786162419336381890.bin' '-w' '/tmp/graph9786162419336381890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9786162419336381890.bin' '-l' '-1' '-v' '-w' '/tmp/graph9786162419336381890.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:22:04] [INFO ] Decomposing Gal with order
[2024-05-21 22:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:22:04] [INFO ] Removed a total of 2199 redundant transitions.
[2024-05-21 22:22:04] [INFO ] Flatten gal took : 64 ms
[2024-05-21 22:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 11 ms.
[2024-05-21 22:22:04] [INFO ] Time to serialize gal into /tmp/LTL13841493394755816648.gal : 8 ms
[2024-05-21 22:22:04] [INFO ] Time to serialize properties into /tmp/LTL3158263336021450757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13841493394755816648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3158263336021450757.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((i19.u201.p919==0)||(i19.u203.p957==0))||((i18.u253.p1129==0)||(i24.u337.p1503==0)))")||(("(i24.u341.p1521==0)")||(X...452
Formula 0 simplified : XF(!"((((i24.u69.p301==0)||(i24.u73.p343==0))||((i10.u74.p580==0)||(i24.u332.p1472==0)))&&((((i19.u201.p919==0)||(i19.u203.p957==0))...436
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 76260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 983 edges and 954 vertex of which 348 / 954 are part of one of the 39 SCC in 1 ms
Free SCC test removed 309 places
Ensure Unique test removed 354 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 2513 edges and 645 vertex of which 617 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 616 transition count 913
Reduce places removed 254 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 255 rules applied. Total rules applied 511 place count 362 transition count 912
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 512 place count 361 transition count 912
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 512 place count 361 transition count 862
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 612 place count 311 transition count 862
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 617 place count 306 transition count 857
Iterating global reduction 3 with 5 rules applied. Total rules applied 622 place count 306 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 306 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 623 place count 306 transition count 854
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 627 place count 304 transition count 854
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 825 place count 205 transition count 755
Performed 26 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 877 place count 179 transition count 835
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 923 place count 179 transition count 789
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 933 place count 174 transition count 874
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1013 place count 174 transition count 794
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1014 place count 173 transition count 793
Applied a total of 1014 rules in 98 ms. Remains 173 /954 variables (removed 781) and now considering 793/2547 (removed 1754) transitions.
[2024-05-21 22:22:19] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
// Phase 1: matrix 600 rows 173 cols
[2024-05-21 22:22:19] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 22:22:20] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 22:22:20] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
[2024-05-21 22:22:20] [INFO ] Invariant cache hit.
[2024-05-21 22:22:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:22:20] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-21 22:22:20] [INFO ] Redundant transitions in 430 ms returned []
Running 752 sub problems to find dead transitions.
[2024-05-21 22:22:20] [INFO ] Flow matrix only has 600 transitions (discarded 193 similar events)
[2024-05-21 22:22:20] [INFO ] Invariant cache hit.
[2024-05-21 22:22:20] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (OVERLAPS) 599/767 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 5 (OVERLAPS) 5/772 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/773 variables, and 208 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 752 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (OVERLAPS) 599/767 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/767 variables, 29/232 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/767 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 6 (OVERLAPS) 5/772 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/772 variables, 723/960 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/773 variables, and 960 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints]
After SMT, in 61599ms problems are : Problem set: 0 solved, 752 unsolved
Search for dead transitions found 0 dead transitions in 61605ms
Starting structural reductions in SI_LTL mode, iteration 1 : 173/954 places, 793/2547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62487 ms. Remains : 173/954 places, 793/2547 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-08 finished in 62536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 983 edges and 954 vertex of which 355 / 954 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2505 edges and 639 vertex of which 611 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 610 transition count 908
Reduce places removed 253 places and 0 transitions.
Iterating post reduction 1 with 253 rules applied. Total rules applied 508 place count 357 transition count 908
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 508 place count 357 transition count 860
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 604 place count 309 transition count 860
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 608 place count 305 transition count 856
Iterating global reduction 2 with 4 rules applied. Total rules applied 612 place count 305 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 613 place count 305 transition count 855
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 613 place count 305 transition count 854
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 615 place count 304 transition count 854
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 813 place count 205 transition count 755
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 863 place count 180 transition count 826
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 903 place count 180 transition count 786
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 913 place count 175 transition count 871
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 993 place count 175 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 994 place count 174 transition count 790
Applied a total of 994 rules in 92 ms. Remains 174 /954 variables (removed 780) and now considering 790/2547 (removed 1757) transitions.
[2024-05-21 22:23:22] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
// Phase 1: matrix 606 rows 174 cols
[2024-05-21 22:23:22] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 22:23:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:23:22] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:23:22] [INFO ] Invariant cache hit.
[2024-05-21 22:23:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:23:22] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-21 22:23:23] [INFO ] Redundant transitions in 460 ms returned []
Running 749 sub problems to find dead transitions.
[2024-05-21 22:23:23] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:23:23] [INFO ] Invariant cache hit.
[2024-05-21 22:23:23] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 5/779 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 27/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (OVERLAPS) 5/779 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 722/958 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/780 variables, and 958 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61817ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 61823ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/954 places, 790/2547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62754 ms. Remains : 174/954 places, 790/2547 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-09
Product exploration explored 100000 steps with 3075 reset in 392 ms.
Product exploration explored 100000 steps with 3070 reset in 360 ms.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1315 resets) in 1727 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1119366 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :0 out of 1
Probabilistic random walk after 1119366 steps, saw 138986 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
[2024-05-21 22:24:29] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:24:29] [INFO ] Invariant cache hit.
[2024-05-21 22:24:29] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/388 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/397 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 341/738 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 41/779 variables, 25/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/779 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 354/388 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/397 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 341/738 variables, 112/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/738 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/779 variables, 25/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 779/780 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 174 transition count 730
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 810
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 39 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 108/174 places, 399/790 transitions.
RANDOM walk for 2280 steps (43 resets) in 14 ms. (152 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 20 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2024-05-21 22:24:30] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:24:30] [INFO ] Invariant cache hit.
[2024-05-21 22:24:30] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 22:24:30] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:24:30] [INFO ] Invariant cache hit.
[2024-05-21 22:24:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:24:30] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-05-21 22:24:31] [INFO ] Redundant transitions in 466 ms returned []
Running 749 sub problems to find dead transitions.
[2024-05-21 22:24:31] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:24:31] [INFO ] Invariant cache hit.
[2024-05-21 22:24:31] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 5/779 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 27/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (OVERLAPS) 5/779 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 722/958 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/780 variables, and 958 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61953ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 61959ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62840 ms. Remains : 174/174 places, 790/790 transitions.
Computed a total of 54 stabilizing places and 505 stable transitions
Computed a total of 54 stabilizing places and 505 stable transitions
Detected a total of 54/174 stabilizing places and 505/790 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1293 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (80 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1067574 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :0 out of 1
Probabilistic random walk after 1067574 steps, saw 133647 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
[2024-05-21 22:25:36] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:25:36] [INFO ] Invariant cache hit.
[2024-05-21 22:25:36] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 354/388 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/397 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 341/738 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 41/779 variables, 25/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/779 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/34 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 354/388 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/397 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 341/738 variables, 112/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/738 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/779 variables, 25/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/779 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/779 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 779/780 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 790/790 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 174 transition count 730
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 164 transition count 810
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 164 transition count 800
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 175 place count 164 transition count 715
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 225 place count 164 transition count 645
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 876 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 421 place count 113 transition count 500
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 113 transition count 499
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 427 place count 108 transition count 469
Iterating global reduction 4 with 5 rules applied. Total rules applied 432 place count 108 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 502 place count 108 transition count 399
Applied a total of 502 rules in 42 ms. Remains 108 /174 variables (removed 66) and now considering 399/790 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 108/174 places, 399/790 transitions.
RANDOM walk for 2154 steps (41 resets) in 16 ms. (126 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3051 reset in 325 ms.
Product exploration explored 100000 steps with 3049 reset in 338 ms.
Built C files in :
/tmp/ltsmin1697860666017640118
[2024-05-21 22:25:37] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2024-05-21 22:25:37] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:25:37] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2024-05-21 22:25:37] [INFO ] Computation of Complete enable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:25:38] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2024-05-21 22:25:38] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:25:38] [INFO ] Built C files in 243ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1697860666017640118
Running compilation step : cd /tmp/ltsmin1697860666017640118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2786 ms.
Running link step : cd /tmp/ltsmin1697860666017640118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 327 ms.
Running LTSmin : cd /tmp/ltsmin1697860666017640118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2463238646960455434.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 790/790 transitions.
Applied a total of 0 rules in 13 ms. Remains 174 /174 variables (removed 0) and now considering 790/790 (removed 0) transitions.
[2024-05-21 22:25:52] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:25:52] [INFO ] Invariant cache hit.
[2024-05-21 22:25:53] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:25:53] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:25:53] [INFO ] Invariant cache hit.
[2024-05-21 22:25:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 22:25:53] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-21 22:25:53] [INFO ] Redundant transitions in 459 ms returned []
Running 749 sub problems to find dead transitions.
[2024-05-21 22:25:53] [INFO ] Flow matrix only has 606 transitions (discarded 184 similar events)
[2024-05-21 22:25:53] [INFO ] Invariant cache hit.
[2024-05-21 22:25:53] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 5/779 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/779 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/780 variables, and 209 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (OVERLAPS) 605/774 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/774 variables, 30/204 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/774 variables, 27/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/774 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (OVERLAPS) 5/779 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/779 variables, 722/958 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/780 variables, and 958 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints]
After SMT, in 61935ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 61941ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62779 ms. Remains : 174/174 places, 790/790 transitions.
Built C files in :
/tmp/ltsmin16276207260340030815
[2024-05-21 22:26:55] [INFO ] Computing symmetric may disable matrix : 790 transitions.
[2024-05-21 22:26:55] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:26:55] [INFO ] Computing symmetric may enable matrix : 790 transitions.
[2024-05-21 22:26:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:26:55] [INFO ] Computing Do-Not-Accords matrix : 790 transitions.
[2024-05-21 22:26:55] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:26:55] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16276207260340030815
Running compilation step : cd /tmp/ltsmin16276207260340030815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2788 ms.
Running link step : cd /tmp/ltsmin16276207260340030815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16276207260340030815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9672308104891911414.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:27:10] [INFO ] Flatten gal took : 32 ms
[2024-05-21 22:27:11] [INFO ] Flatten gal took : 72 ms
[2024-05-21 22:27:11] [INFO ] Time to serialize gal into /tmp/LTL7235111875750512929.gal : 4 ms
[2024-05-21 22:27:11] [INFO ] Time to serialize properties into /tmp/LTL9864916229692282029.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7235111875750512929.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9952584790854380693.hoa' '-atoms' '/tmp/LTL9864916229692282029.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1150!=1)"))))
Formula 0 simplified : FG!"(p1150!=1)"
Detected timeout of ITS tools.
[2024-05-21 22:27:41] [INFO ] Flatten gal took : 33 ms
[2024-05-21 22:27:41] [INFO ] Applying decomposition
[2024-05-21 22:27:41] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3971842758398685664.txt' '-o' '/tmp/graph3971842758398685664.bin' '-w' '/tmp/graph3971842758398685664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3971842758398685664.bin' '-l' '-1' '-v' '-w' '/tmp/graph3971842758398685664.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:27:41] [INFO ] Decomposing Gal with order
[2024-05-21 22:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:27:41] [INFO ] Removed a total of 1570 redundant transitions.
[2024-05-21 22:27:41] [INFO ] Flatten gal took : 42 ms
[2024-05-21 22:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 6 ms.
[2024-05-21 22:27:41] [INFO ] Time to serialize gal into /tmp/LTL4434754370967795025.gal : 3 ms
[2024-05-21 22:27:41] [INFO ] Time to serialize properties into /tmp/LTL9585514294808531652.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4434754370967795025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9585514294808531652.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(i3.u27.p1150!=1)"))))
Formula 0 simplified : FG!"(i3.u27.p1150!=1)"
Reverse transition relation is NOT exact ! Due to transitions t0, t2492_t980, t2483_t792, t27_t2006_t941_t752_t563_t370_t176, t27_t2272_t980_t860_t2, t27_t...2293
Computing Next relation with stutter on 1.31058e+12 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
128 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.36009,54920,1,0,65589,28531,4751,190071,1922,108413,54644
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-5b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-5b-LTLFireability-09 finished in 260739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 931 transition count 1511
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 931 transition count 1511
Applied a total of 46 rules in 65 ms. Remains 931 /954 variables (removed 23) and now considering 1511/2547 (removed 1036) transitions.
// Phase 1: matrix 1511 rows 931 cols
[2024-05-21 22:27:43] [INFO ] Computed 15 invariants in 11 ms
[2024-05-21 22:27:43] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 22:27:43] [INFO ] Invariant cache hit.
[2024-05-21 22:27:44] [INFO ] Implicit Places using invariants and state equation in 899 ms returned [11, 19, 185, 193, 358, 366, 533, 541, 706, 714]
[2024-05-21 22:27:44] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/954 places, 1511/2547 transitions.
Applied a total of 0 rules in 16 ms. Remains 930 /930 variables (removed 0) and now considering 1511/1511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1194 ms. Remains : 930/954 places, 1511/2547 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 427 steps with 3 reset in 2 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5b-LTLFireability-12 finished in 1326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (X(p1)||G(p0))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 2547
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 934 transition count 1515
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 934 transition count 1515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 930 transition count 1510
Applied a total of 48 rules in 65 ms. Remains 930 /954 variables (removed 24) and now considering 1510/2547 (removed 1037) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2024-05-21 22:27:44] [INFO ] Computed 15 invariants in 11 ms
[2024-05-21 22:27:44] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 22:27:44] [INFO ] Invariant cache hit.
[2024-05-21 22:27:45] [INFO ] Implicit Places using invariants and state equation in 930 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 705, 713]
[2024-05-21 22:27:45] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/954 places, 1510/2547 transitions.
Applied a total of 0 rules in 20 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1222 ms. Remains : 929/954 places, 1510/2547 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-14
Product exploration explored 100000 steps with 624 reset in 189 ms.
Product exploration explored 100000 steps with 639 reset in 212 ms.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2861 edges and 929 vertex of which 913 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (249 resets) in 443 ms. (90 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (30 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (29 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
// Phase 1: matrix 1510 rows 929 cols
[2024-05-21 22:27:46] [INFO ] Computed 14 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 391/420 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 182/602 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 683/1285 variables, 325/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1285 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 434/1719 variables, 205/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1719 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 412/2131 variables, 172/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2131 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 246/2377 variables, 153/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2377 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 42/2419 variables, 29/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2419 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/2435 variables, 8/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2435 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/2439 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2439 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2439 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2439/2439 variables, and 943 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1045 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 929/929 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 391/420 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 182/602 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 683/1285 variables, 325/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1285 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 434/1719 variables, 205/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1719 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 412/2131 variables, 172/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2131 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 246/2377 variables, 153/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2377 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 42/2419 variables, 29/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2419 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 16/2435 variables, 8/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2435 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/2439 variables, 4/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2439 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2439 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2439/2439 variables, and 945 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1015 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 929/929 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2070ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11132 steps, including 290 resets, run visited all 2 properties in 121 ms. (steps per millisecond=92 )
Parikh walk visited 2 properties in 120 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 929 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 929/929 places, 1510/1510 transitions.
Applied a total of 0 rules in 19 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2024-05-21 22:27:49] [INFO ] Invariant cache hit.
[2024-05-21 22:27:49] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 22:27:49] [INFO ] Invariant cache hit.
[2024-05-21 22:27:50] [INFO ] Implicit Places using invariants and state equation in 904 ms returned [18, 184, 192, 357, 365, 530, 538, 704, 712]
[2024-05-21 22:27:50] [INFO ] Actually due to overlaps returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1085 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/929 places, 1510/1510 transitions.
Applied a total of 0 rules in 14 ms. Remains 928 /928 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1120 ms. Remains : 928/929 places, 1510/1510 transitions.
Computed a total of 133 stabilizing places and 473 stable transitions
Graph (complete) has 2844 edges and 928 vertex of which 913 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Computed a total of 133 stabilizing places and 473 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (256 resets) in 406 ms. (98 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (30 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (31 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
// Phase 1: matrix 1510 rows 928 cols
[2024-05-21 22:27:51] [INFO ] Computed 13 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 391/420 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 162/582 variables, 13/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 679/1261 variables, 311/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1261 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 451/1712 variables, 214/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1712 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 416/2128 variables, 175/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2128 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 246/2374 variables, 153/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2374 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 44/2418 variables, 30/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2418 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/2434 variables, 8/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2434 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/2438 variables, 4/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2438 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2438 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2438/2438 variables, and 941 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1108 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/29 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 391/420 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 162/582 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 679/1261 variables, 311/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1261 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 451/1712 variables, 214/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1712 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 416/2128 variables, 175/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2128 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 246/2374 variables, 153/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2374 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 44/2418 variables, 30/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2418 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 16/2434 variables, 8/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2434 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/2438 variables, 4/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2438 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2438 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2438/2438 variables, and 943 constraints, problems are : Problem set: 0 solved, 2 unsolved in 959 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 928/928 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2080ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 105 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=35 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 619 reset in 244 ms.
Product exploration explored 100000 steps with 632 reset in 212 ms.
Built C files in :
/tmp/ltsmin9354507433777476797
[2024-05-21 22:27:54] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9354507433777476797
Running compilation step : cd /tmp/ltsmin9354507433777476797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9354507433777476797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9354507433777476797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1510/1510 transitions.
Applied a total of 0 rules in 15 ms. Remains 928 /928 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
[2024-05-21 22:27:57] [INFO ] Invariant cache hit.
[2024-05-21 22:27:58] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 22:27:58] [INFO ] Invariant cache hit.
[2024-05-21 22:27:59] [INFO ] Implicit Places using invariants and state equation in 899 ms returned [183, 191, 356, 364, 529, 537, 703, 711]
[2024-05-21 22:27:59] [INFO ] Actually due to overlaps returned [183]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1064 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 927/928 places, 1510/1510 transitions.
Applied a total of 0 rules in 21 ms. Remains 927 /927 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1101 ms. Remains : 927/928 places, 1510/1510 transitions.
Built C files in :
/tmp/ltsmin5759136655124291230
[2024-05-21 22:27:59] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5759136655124291230
Running compilation step : cd /tmp/ltsmin5759136655124291230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5759136655124291230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5759136655124291230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 22:28:02] [INFO ] Flatten gal took : 41 ms
[2024-05-21 22:28:02] [INFO ] Flatten gal took : 41 ms
[2024-05-21 22:28:02] [INFO ] Time to serialize gal into /tmp/LTL3341057293803213171.gal : 6 ms
[2024-05-21 22:28:02] [INFO ] Time to serialize properties into /tmp/LTL8420827489964264681.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3341057293803213171.gal' '-t' 'CGAL' '-hoa' '/tmp/aut66361901850062372.hoa' '-atoms' '/tmp/LTL8420827489964264681.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p996!=1)")&&(X(("(p996!=1)")U((X("(p514==1)"))||(G("(p996!=1)")))))))))
Formula 0 simplified : FG(!"(p996!=1)" | X(!"(p996!=1)" M X!"(p514==1)"))
Detected timeout of ITS tools.
[2024-05-21 22:28:32] [INFO ] Flatten gal took : 44 ms
[2024-05-21 22:28:32] [INFO ] Applying decomposition
[2024-05-21 22:28:32] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph63812897232666464.txt' '-o' '/tmp/graph63812897232666464.bin' '-w' '/tmp/graph63812897232666464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph63812897232666464.bin' '-l' '-1' '-v' '-w' '/tmp/graph63812897232666464.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:28:32] [INFO ] Decomposing Gal with order
[2024-05-21 22:28:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:28:32] [INFO ] Removed a total of 1635 redundant transitions.
[2024-05-21 22:28:32] [INFO ] Flatten gal took : 59 ms
[2024-05-21 22:28:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 10 ms.
[2024-05-21 22:28:32] [INFO ] Time to serialize gal into /tmp/LTL6025422874836575135.gal : 7 ms
[2024-05-21 22:28:32] [INFO ] Time to serialize properties into /tmp/LTL1250295038794492485.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6025422874836575135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1250295038794492485.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i14.u213.p996!=1)")&&(X(("(i14.u213.p996!=1)")U((X("(i7.u108.p514==1)"))||(G("(i14.u213.p996!=1)")))))))))
Formula 0 simplified : FG(!"(i14.u213.p996!=1)" | X(!"(i14.u213.p996!=1)" M X!"(i7.u108.p514==1)"))
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-5b-LTLFireability-14 finished in 63480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F((p0||G(p1)))||(p2&&X((p2 U (!p0||G(p2))))))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-01
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 981 edges and 954 vertex of which 355 / 954 are part of one of the 40 SCC in 1 ms
Free SCC test removed 315 places
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Graph (complete) has 2505 edges and 639 vertex of which 611 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 610 transition count 909
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 1 with 252 rules applied. Total rules applied 506 place count 358 transition count 909
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 506 place count 358 transition count 861
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 602 place count 310 transition count 861
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 605 place count 307 transition count 858
Iterating global reduction 2 with 3 rules applied. Total rules applied 608 place count 307 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 609 place count 307 transition count 857
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 609 place count 307 transition count 856
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 611 place count 306 transition count 856
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 809 place count 207 transition count 757
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 859 place count 182 transition count 832
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 860 place count 181 transition count 831
Applied a total of 860 rules in 59 ms. Remains 181 /954 variables (removed 773) and now considering 831/2547 (removed 1716) transitions.
[2024-05-21 22:28:48] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
// Phase 1: matrix 672 rows 181 cols
[2024-05-21 22:28:48] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:28:48] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 22:28:48] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:28:48] [INFO ] Invariant cache hit.
[2024-05-21 22:28:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 22:28:48] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-21 22:28:48] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:28:48] [INFO ] Invariant cache hit.
[2024-05-21 22:28:48] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (OVERLAPS) 5/852 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (OVERLAPS) 5/852 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 750/1011 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/853 variables, and 1011 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
After SMT, in 61936ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 61943ms
Starting structural reductions in LI_LTL mode, iteration 1 : 181/954 places, 831/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62350 ms. Remains : 181/954 places, 831/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-01
Product exploration explored 100000 steps with 3133 reset in 371 ms.
Product exploration explored 100000 steps with 3141 reset in 385 ms.
Computed a total of 51 stabilizing places and 521 stable transitions
Computed a total of 51 stabilizing places and 521 stable transitions
Detected a total of 51/181 stabilizing places and 521/831 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 368 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1334 resets) in 1155 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (82 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (86 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 420273 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 6
Probabilistic random walk after 420273 steps, saw 61423 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-21 22:29:55] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:29:55] [INFO ] Invariant cache hit.
[2024-05-21 22:29:55] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 555/677 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/682 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 160/842 variables, 75/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/842 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 10/852 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 6 unsolved in 521 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 555/677 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 5/682 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 160/842 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/842 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 10/852 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/853 variables, and 227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 563 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 184 ms.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 181 transition count 761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 100 place count 166 transition count 906
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 135 place count 166 transition count 871
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 290 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 340 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 893 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 536 place count 115 transition count 501
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 115 transition count 500
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 542 place count 110 transition count 470
Iterating global reduction 4 with 5 rules applied. Total rules applied 547 place count 110 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 617 place count 110 transition count 400
Applied a total of 617 rules in 50 ms. Remains 110 /181 variables (removed 71) and now considering 400/831 (removed 431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 110/181 places, 400/831 transitions.
RANDOM walk for 22170 steps (431 resets) in 75 ms. (291 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 957 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-21 22:29:58] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:29:58] [INFO ] Invariant cache hit.
[2024-05-21 22:29:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 22:29:58] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:29:58] [INFO ] Invariant cache hit.
[2024-05-21 22:29:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 22:29:58] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-21 22:29:58] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:29:58] [INFO ] Invariant cache hit.
[2024-05-21 22:29:58] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (OVERLAPS) 5/852 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (OVERLAPS) 5/852 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 750/1011 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/853 variables, and 1011 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
After SMT, in 62278ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 62287ms
Finished structural reductions in LTL mode , in 1 iterations and 62689 ms. Remains : 181/181 places, 831/831 transitions.
Computed a total of 51 stabilizing places and 521 stable transitions
Computed a total of 51 stabilizing places and 521 stable transitions
Detected a total of 51/181 stabilizing places and 521/831 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1290 resets) in 681 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (85 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 430836 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 6
Probabilistic random walk after 430836 steps, saw 62896 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
[2024-05-21 22:31:04] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:31:04] [INFO ] Invariant cache hit.
[2024-05-21 22:31:04] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 555/677 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/682 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 160/842 variables, 75/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/842 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 10/852 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 6 unsolved in 518 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 116/122 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 555/677 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 5/682 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/682 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 160/842 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/842 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 10/852 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/852 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/853 variables, and 227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 527 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1060ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 181 transition count 761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 100 place count 166 transition count 906
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 135 place count 166 transition count 871
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 290 place count 166 transition count 716
Free-agglomeration rule applied 50 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 340 place count 166 transition count 646
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Graph (complete) has 893 edges and 116 vertex of which 115 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 196 rules applied. Total rules applied 536 place count 115 transition count 501
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 115 transition count 500
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 542 place count 110 transition count 470
Iterating global reduction 4 with 5 rules applied. Total rules applied 547 place count 110 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 617 place count 110 transition count 400
Applied a total of 617 rules in 46 ms. Remains 110 /181 variables (removed 71) and now considering 400/831 (removed 431) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 110/181 places, 400/831 transitions.
RANDOM walk for 38038 steps (722 resets) in 115 ms. (327 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 966 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3130 reset in 395 ms.
Product exploration explored 100000 steps with 3118 reset in 367 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 181 transition count 791
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -105
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 45 place count 181 transition count 896
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 125 place count 181 transition count 816
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 125 rules in 46 ms. Remains 181 /181 variables (removed 0) and now considering 816/831 (removed 15) transitions.
[2024-05-21 22:31:09] [INFO ] Redundant transitions in 546 ms returned []
Running 775 sub problems to find dead transitions.
[2024-05-21 22:31:09] [INFO ] Flow matrix only has 632 transitions (discarded 184 similar events)
// Phase 1: matrix 632 rows 181 cols
[2024-05-21 22:31:09] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 22:31:09] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 775 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
At refinement iteration 2 (OVERLAPS) 631/807 variables, 176/181 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/807 variables, 30/211 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/211 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 5 (OVERLAPS) 5/812 variables, 5/216 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 0/216 constraints. Problems are: Problem set: 20 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 812/813 variables, and 216 constraints, problems are : Problem set: 20 solved, 755 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 775/775 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 755 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 2 (OVERLAPS) 626/797 variables, 171/176 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 30/206 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/797 variables, 36/242 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/242 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 6 (OVERLAPS) 15/812 variables, 10/252 constraints. Problems are: Problem set: 20 solved, 755 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 719/971 constraints. Problems are: Problem set: 20 solved, 755 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 812/813 variables, and 971 constraints, problems are : Problem set: 20 solved, 755 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 755/775 constraints, Known Traps: 0/0 constraints]
After SMT, in 62232ms problems are : Problem set: 20 solved, 755 unsolved
Search for dead transitions found 20 dead transitions in 62240ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/181 places, 796/831 transitions.
Graph (complete) has 1766 edges and 181 vertex of which 176 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 176 /181 variables (removed 5) and now considering 796/796 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 176/181 places, 796/831 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62857 ms. Remains : 176/181 places, 796/831 transitions.
Built C files in :
/tmp/ltsmin526809724551896287
[2024-05-21 22:32:11] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin526809724551896287
Running compilation step : cd /tmp/ltsmin526809724551896287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1711 ms.
Running link step : cd /tmp/ltsmin526809724551896287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin526809724551896287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9514006721078448928.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 831/831 transitions.
Applied a total of 0 rules in 5 ms. Remains 181 /181 variables (removed 0) and now considering 831/831 (removed 0) transitions.
[2024-05-21 22:32:26] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
// Phase 1: matrix 672 rows 181 cols
[2024-05-21 22:32:26] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:32:26] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 22:32:26] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:32:26] [INFO ] Invariant cache hit.
[2024-05-21 22:32:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 22:32:27] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-21 22:32:27] [INFO ] Flow matrix only has 672 transitions (discarded 159 similar events)
[2024-05-21 22:32:27] [INFO ] Invariant cache hit.
[2024-05-21 22:32:27] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (OVERLAPS) 5/852 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/852 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 852/853 variables, and 221 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (OVERLAPS) 671/847 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 35/216 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 40/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (OVERLAPS) 5/852 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/852 variables, 750/1011 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 852/853 variables, and 1011 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 181/181 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
After SMT, in 62074ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 62082ms
Finished structural reductions in LTL mode , in 1 iterations and 62483 ms. Remains : 181/181 places, 831/831 transitions.
Built C files in :
/tmp/ltsmin15075377888665638654
[2024-05-21 22:33:29] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15075377888665638654
Running compilation step : cd /tmp/ltsmin15075377888665638654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1832 ms.
Running link step : cd /tmp/ltsmin15075377888665638654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15075377888665638654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9896999669306926746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:33:44] [INFO ] Flatten gal took : 29 ms
[2024-05-21 22:33:44] [INFO ] Flatten gal took : 29 ms
[2024-05-21 22:33:44] [INFO ] Time to serialize gal into /tmp/LTL11818751045611936782.gal : 4 ms
[2024-05-21 22:33:44] [INFO ] Time to serialize properties into /tmp/LTL6020220368469089381.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11818751045611936782.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5489880962212643546.hoa' '-atoms' '/tmp/LTL6020220368469089381.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6020220368469089381.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5489880962212643546.hoa
Detected timeout of ITS tools.
[2024-05-21 22:33:59] [INFO ] Flatten gal took : 28 ms
[2024-05-21 22:33:59] [INFO ] Flatten gal took : 34 ms
[2024-05-21 22:33:59] [INFO ] Time to serialize gal into /tmp/LTL17980722016701203457.gal : 5 ms
[2024-05-21 22:33:59] [INFO ] Time to serialize properties into /tmp/LTL9433482704026793323.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17980722016701203457.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9433482704026793323.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(p682==1)")||(G("(p1183==0)"))))||(("(p1183!=1)")&&(X(("(p1183!=1)")U(("(p682!=1)")||(G("(p1183!=1)")))))))))))
Formula 0 simplified : XXF(G(!"(p682==1)" & F!"(p1183==0)") & (!"(p1183!=1)" | X(!"(p1183!=1)" M !"(p682!=1)")))
Detected timeout of ITS tools.
[2024-05-21 22:34:14] [INFO ] Flatten gal took : 33 ms
[2024-05-21 22:34:14] [INFO ] Applying decomposition
[2024-05-21 22:34:14] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12842906483433563627.txt' '-o' '/tmp/graph12842906483433563627.bin' '-w' '/tmp/graph12842906483433563627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12842906483433563627.bin' '-l' '-1' '-v' '-w' '/tmp/graph12842906483433563627.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:34:14] [INFO ] Decomposing Gal with order
[2024-05-21 22:34:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:34:14] [INFO ] Removed a total of 1773 redundant transitions.
[2024-05-21 22:34:14] [INFO ] Flatten gal took : 38 ms
[2024-05-21 22:34:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 6 ms.
[2024-05-21 22:34:14] [INFO ] Time to serialize gal into /tmp/LTL16528945917991080160.gal : 3 ms
[2024-05-21 22:34:14] [INFO ] Time to serialize properties into /tmp/LTL495826285436584438.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16528945917991080160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL495826285436584438.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((F(("(i2.u16.p682==1)")||(G("(i5.u30.p1183==0)"))))||(("(i5.u30.p1183!=1)")&&(X(("(i5.u30.p1183!=1)")U(("(i2.u16.p682!=1)")||...188
Formula 0 simplified : XXF(G(!"(i2.u16.p682==1)" & F!"(i5.u30.p1183==0)") & (!"(i5.u30.p1183!=1)" | X(!"(i5.u30.p1183!=1)" M !"(i2.u16.p682!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t2492_t980, t2483_t792, t2502_t410, t27_t2006_t941_t752_t563_t370_t176, t27_t2279_t980_t8...2955
Computing Next relation with stutter on 1.31058e+12 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
90 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.950845,64152,1,0,91097,12873,5867,259700,1302,64480,86950
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property CloudDeployment-PT-5b-LTLFireability-01 finished in 328204 ms.
FORMULA CloudDeployment-PT-5b-LTLFireability-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U X(G(!p2)))&&p0)))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-04
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p2), p2, p2]
Support contains 24 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 963 edges and 954 vertex of which 346 / 954 are part of one of the 39 SCC in 0 ms
Free SCC test removed 307 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Graph (complete) has 2521 edges and 647 vertex of which 646 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 646 transition count 1942
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 256 rules applied. Total rules applied 511 place count 393 transition count 1939
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 513 place count 391 transition count 1939
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 513 place count 391 transition count 1890
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 611 place count 342 transition count 1890
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 615 place count 338 transition count 1886
Iterating global reduction 3 with 4 rules applied. Total rules applied 619 place count 338 transition count 1886
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 338 transition count 1885
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 620 place count 338 transition count 1883
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 624 place count 336 transition count 1883
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 824 place count 236 transition count 1783
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 874 place count 211 transition count 1913
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 894 place count 211 transition count 1893
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 898 place count 211 transition count 1889
Applied a total of 898 rules in 101 ms. Remains 211 /954 variables (removed 743) and now considering 1889/2547 (removed 658) transitions.
[2024-05-21 22:34:16] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-21 22:34:16] [INFO ] Computed 16 invariants in 15 ms
[2024-05-21 22:34:16] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-21 22:34:16] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:34:16] [INFO ] Invariant cache hit.
[2024-05-21 22:34:17] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 22:34:18] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2024-05-21 22:34:18] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:34:18] [INFO ] Invariant cache hit.
[2024-05-21 22:34:18] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/1917 variables, and 453 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 864/1317 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1915/1917 variables, and 1317 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 81442ms problems are : Problem set: 0 solved, 1888 unsolved
Search for dead transitions found 0 dead transitions in 81470ms
Starting structural reductions in LI_LTL mode, iteration 1 : 211/954 places, 1889/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 83605 ms. Remains : 211/954 places, 1889/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-04
Product exploration explored 100000 steps with 2903 reset in 615 ms.
Product exploration explored 100000 steps with 2865 reset in 600 ms.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 148 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2), p2, p2]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (1224 resets) in 1747 ms. (22 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (84 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (87 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (76 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (83 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (81 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (84 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (83 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (81 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
[2024-05-21 22:35:42] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:35:42] [INFO ] Invariant cache hit.
[2024-05-21 22:35:42] [INFO ] State equation strengthened by 228 read => feed constraints.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 9/1916 variables, 9/454 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1916 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/1917 variables, 1/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1917/1917 variables, and 455 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1417 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 1/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1907 variables, 0/446 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 9/1916 variables, 9/455 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1916 variables, 2/457 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1916 variables, 0/457 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/1917 variables, 1/458 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1917/1917 variables, and 458 constraints, problems are : Problem set: 2 solved, 7 unsolved in 3096 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4669ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 1541 ms.
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 211 transition count 1850
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 59 place count 201 transition count 1930
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 201 transition count 1922
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 197 place count 201 transition count 1792
Free-agglomeration rule applied 48 times with reduction of 12 identical transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 245 place count 201 transition count 1732
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 411 place count 153 transition count 1614
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 418 place count 146 transition count 1567
Iterating global reduction 3 with 7 rules applied. Total rules applied 425 place count 146 transition count 1567
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 427 place count 146 transition count 1565
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 488 place count 146 transition count 1504
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 490 place count 146 transition count 1504
Applied a total of 490 rules in 128 ms. Remains 146 /211 variables (removed 65) and now considering 1504/1889 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 146/211 places, 1504/1889 transitions.
RANDOM walk for 40000 steps (1049 resets) in 1224 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (109 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (106 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (101 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 453503 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 3
Probabilistic random walk after 453503 steps, saw 65304 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-21 22:35:52] [INFO ] Flow matrix only has 1304 transitions (discarded 200 similar events)
// Phase 1: matrix 1304 rows 146 cols
[2024-05-21 22:35:52] [INFO ] Computed 16 invariants in 12 ms
[2024-05-21 22:35:52] [INFO ] State equation strengthened by 158 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 50/74 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1213/1287 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1287 variables, 95/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1287 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 97/1384 variables, 37/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1384 variables, 38/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1384 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 58/1442 variables, 27/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1442 variables, 25/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1442 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/1450 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1450 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1450 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1450/1450 variables, and 320 constraints, problems are : Problem set: 0 solved, 3 unsolved in 651 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 146/146 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 50/74 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1213/1287 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1287 variables, 95/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1287 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 97/1384 variables, 37/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1384 variables, 38/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1384 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1384 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 58/1442 variables, 27/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1442 variables, 25/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1442 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1450 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1450 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1450 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1450/1450 variables, and 321 constraints, problems are : Problem set: 0 solved, 3 unsolved in 769 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 146/146 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1500ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 950 steps, including 18 resets, run visited all 1 properties in 5 ms. (steps per millisecond=190 )
Parikh walk visited 3 properties in 34 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p1), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 32 factoid took 733 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 9 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2024-05-21 22:35:54] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-21 22:35:54] [INFO ] Computed 16 invariants in 14 ms
[2024-05-21 22:35:55] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-21 22:35:55] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:35:55] [INFO ] Invariant cache hit.
[2024-05-21 22:35:55] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 22:35:56] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2024-05-21 22:35:56] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:35:56] [INFO ] Invariant cache hit.
[2024-05-21 22:35:56] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 (/ 227.0 12.0))
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 (/ 203.0 12.0))
(s15 (/ 35.0 12.0))
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/1917 variables, and 453 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 864/1317 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1915/1917 variables, and 1317 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 82859ms problems are : Problem set: 0 solved, 1888 unsolved
Search for dead transitions found 0 dead transitions in 82882ms
Finished structural reductions in LTL mode , in 1 iterations and 84986 ms. Remains : 211/211 places, 1889/1889 transitions.
Computed a total of 68 stabilizing places and 1569 stable transitions
Graph (complete) has 2047 edges and 211 vertex of which 184 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Computed a total of 68 stabilizing places and 1569 stable transitions
Detected a total of 68/211 stabilizing places and 1569/1889 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 165 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
RANDOM walk for 40000 steps (1223 resets) in 1414 ms. (28 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (78 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (73 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
[2024-05-21 22:37:20] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:37:20] [INFO ] Invariant cache hit.
[2024-05-21 22:37:20] [INFO ] State equation strengthened by 228 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/1916 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1916 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/1917 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/1917 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1917/1917 variables, and 455 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1193 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 85/109 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1578/1687 variables, 109/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 165/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 220/1907 variables, 93/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1907 variables, 62/445 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1907 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1907 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 9/1916 variables, 9/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1916 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1916 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/1917 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1917 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1917/1917 variables, and 458 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2285 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 211/211 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3565ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 996 ms.
Support contains 19 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Graph (trivial) has 177 edges and 211 vertex of which 2 / 211 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 210 transition count 1846
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 208 transition count 1846
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 208 transition count 1845
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 26 place count 198 transition count 1925
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 36 place count 198 transition count 1915
Drop transitions (Redundant composition of simpler transitions.) removed 155 transitions
Redundant transition composition rules discarded 155 transitions
Iterating global reduction 2 with 155 rules applied. Total rules applied 191 place count 198 transition count 1760
Free-agglomeration rule applied 53 times with reduction of 20 identical transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 244 place count 198 transition count 1687
Reduce places removed 53 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 2 with 198 rules applied. Total rules applied 442 place count 145 transition count 1542
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 447 place count 140 transition count 1512
Iterating global reduction 3 with 5 rules applied. Total rules applied 452 place count 140 transition count 1512
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 527 place count 140 transition count 1437
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 528 place count 140 transition count 1437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 529 place count 139 transition count 1436
Applied a total of 529 rules in 150 ms. Remains 139 /211 variables (removed 72) and now considering 1436/1889 (removed 453) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 139/211 places, 1436/1889 transitions.
RANDOM walk for 40000 steps (1529 resets) in 867 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (159 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 400269 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 400269 steps, saw 75480 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-21 22:37:28] [INFO ] Flow matrix only has 1241 transitions (discarded 195 similar events)
// Phase 1: matrix 1241 rows 139 cols
[2024-05-21 22:37:28] [INFO ] Computed 16 invariants in 11 ms
[2024-05-21 22:37:28] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 30/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1136/1204 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 93/1297 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1297 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1297 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 73/1370 variables, 34/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1370 variables, 5/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/1380 variables, 10/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1380 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1380 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1380/1380 variables, and 162 constraints, problems are : Problem set: 0 solved, 2 unsolved in 374 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 139/139 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 30/68 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1136/1204 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1204 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 93/1297 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1297 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1297 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1297 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 73/1370 variables, 34/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1370 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/1380 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1380 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1380 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1380/1380 variables, and 163 constraints, problems are : Problem set: 0 solved, 2 unsolved in 447 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 139/139 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 865ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) p0))), (F p2), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 18 factoid took 464 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p2 p1), (OR p2 (AND p0 p1)), (OR p2 p1)]
Product exploration explored 100000 steps with 2925 reset in 585 ms.
Product exploration explored 100000 steps with 2883 reset in 575 ms.
Built C files in :
/tmp/ltsmin12418203863378506706
[2024-05-21 22:37:31] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12418203863378506706
Running compilation step : cd /tmp/ltsmin12418203863378506706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12418203863378506706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12418203863378506706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 24 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 1889/1889 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2024-05-21 22:37:34] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
// Phase 1: matrix 1706 rows 211 cols
[2024-05-21 22:37:34] [INFO ] Computed 16 invariants in 8 ms
[2024-05-21 22:37:35] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-21 22:37:35] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:37:35] [INFO ] Invariant cache hit.
[2024-05-21 22:37:35] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-21 22:37:37] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2024-05-21 22:37:37] [INFO ] Flow matrix only has 1706 transitions (discarded 183 similar events)
[2024-05-21 22:37:37] [INFO ] Invariant cache hit.
[2024-05-21 22:37:37] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1915/1917 variables, and 453 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 2 (OVERLAPS) 1705/1915 variables, 210/226 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1915 variables, 227/453 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 864/1317 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1915/1917 variables, and 1317 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 210/211 constraints, ReadFeed: 227/228 constraints, PredecessorRefiner: 1888/864 constraints, Known Traps: 0/0 constraints]
After SMT, in 81868ms problems are : Problem set: 0 solved, 1888 unsolved
Search for dead transitions found 0 dead transitions in 81889ms
Finished structural reductions in LTL mode , in 1 iterations and 84012 ms. Remains : 211/211 places, 1889/1889 transitions.
Built C files in :
/tmp/ltsmin5355169110250854981
[2024-05-21 22:38:59] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5355169110250854981
Running compilation step : cd /tmp/ltsmin5355169110250854981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5355169110250854981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5355169110250854981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 22:39:02] [INFO ] Flatten gal took : 179 ms
[2024-05-21 22:39:02] [INFO ] Flatten gal took : 181 ms
[2024-05-21 22:39:02] [INFO ] Time to serialize gal into /tmp/LTL1608052594215463399.gal : 23 ms
[2024-05-21 22:39:02] [INFO ] Time to serialize properties into /tmp/LTL15530798955359610128.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1608052594215463399.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9443297347047382715.hoa' '-atoms' '/tmp/LTL15530798955359610128.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((("(p1437==0)")&&(("(p1260==1)")U(X(G(!("(((((p49==1)&&(p87==1))&&((p245==1)&&(p1503==1)))&&(p1521==1))||(p1260==1))"))))))&&("((...377
Formula 0 simplified : G(!"((((((p27==0)||(p58==0))||((p95==0)||(p302==0)))||(((p348==0)||(p385==0))||((p592==0)||(p638==0))))||((((p675==0)||(p882==0))||(...364
Detected timeout of ITS tools.
[2024-05-21 22:39:33] [INFO ] Flatten gal took : 180 ms
[2024-05-21 22:39:33] [INFO ] Applying decomposition
[2024-05-21 22:39:33] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph143504008850116854.txt' '-o' '/tmp/graph143504008850116854.bin' '-w' '/tmp/graph143504008850116854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph143504008850116854.bin' '-l' '-1' '-v' '-w' '/tmp/graph143504008850116854.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:39:33] [INFO ] Decomposing Gal with order
[2024-05-21 22:39:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:39:34] [INFO ] Removed a total of 9933 redundant transitions.
[2024-05-21 22:39:34] [INFO ] Flatten gal took : 455 ms
[2024-05-21 22:39:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2195 labels/synchronizations in 90 ms.
[2024-05-21 22:39:34] [INFO ] Time to serialize gal into /tmp/LTL17383719755867081936.gal : 15 ms
[2024-05-21 22:39:34] [INFO ] Time to serialize properties into /tmp/LTL12978822264500418873.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17383719755867081936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12978822264500418873.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((("(i4.u30.p1437==0)")&&(("(i4.u26.p1260==1)")U(X(G(!("(((((i0.u0.p49==1)&&(i0.u1.p87==1))&&((i0.u2.p245==1)&&(u33.p1503==1)))&&(...539
Formula 0 simplified : G(!"((((((i0.u0.p27==0)||(i0.u1.p58==0))||((i0.u2.p95==0)||(i3.u21.p302==0)))||(((i1.u7.p348==0)||(i1.u12.p385==0))||((i3.u21.p592==...526
Reverse transition relation is NOT exact ! Due to transitions t1125, t2492_t980, t2483_t792, u33.t3, i0.t866_t875_t941, i0.t949_t946, i0.t936, i0.u0.t907.t...1295
Computing Next relation with stutter on 1.94178e+12 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudDeployment-PT-5b-LTLFireability-04 finished in 333379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(G((X(p2)||p1))))))))'
Found a Lengthening insensitive property : CloudDeployment-PT-5b-LTLFireability-05
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 9 out of 954 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 954/954 places, 2547/2547 transitions.
Graph (trivial) has 971 edges and 954 vertex of which 341 / 954 are part of one of the 38 SCC in 0 ms
Free SCC test removed 303 places
Ensure Unique test removed 347 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 2525 edges and 651 vertex of which 623 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 1025 output transitions
Drop transitions (Output transitions of discarded places.) removed 1025 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 623 transition count 920
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 258 rules applied. Total rules applied 515 place count 368 transition count 917
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 517 place count 366 transition count 917
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 517 place count 366 transition count 868
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 615 place count 317 transition count 868
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 620 place count 312 transition count 863
Iterating global reduction 3 with 5 rules applied. Total rules applied 625 place count 312 transition count 863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 626 place count 312 transition count 862
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 626 place count 312 transition count 860
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 630 place count 310 transition count 860
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 832 place count 209 transition count 759
Performed 25 Post agglomeration using F-continuation condition with reduction of 50 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 882 place count 184 transition count 834
Applied a total of 882 rules in 51 ms. Remains 184 /954 variables (removed 770) and now considering 834/2547 (removed 1713) transitions.
[2024-05-21 22:39:49] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-21 22:39:49] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 22:39:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:39:49] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:39:49] [INFO ] Invariant cache hit.
[2024-05-21 22:39:50] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 22:39:50] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-21 22:39:50] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:39:50] [INFO ] Invariant cache hit.
[2024-05-21 22:39:50] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 1/860 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/861 variables, and 392 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 833/1224 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/861 variables, and 1224 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
After SMT, in 62086ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 62096ms
Starting structural reductions in LI_LTL mode, iteration 1 : 184/954 places, 834/2547 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62674 ms. Remains : 184/954 places, 834/2547 transitions.
Running random walk in product with property : CloudDeployment-PT-5b-LTLFireability-05
Product exploration explored 100000 steps with 2829 reset in 391 ms.
Product exploration explored 100000 steps with 2863 reset in 406 ms.
Computed a total of 49 stabilizing places and 491 stable transitions
Computed a total of 49 stabilizing places and 491 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1182 resets) in 1034 ms. (38 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (62 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (59 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (62 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (59 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 466507 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 5
Probabilistic random walk after 466507 steps, saw 65781 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-21 22:40:57] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:40:57] [INFO ] Invariant cache hit.
[2024-05-21 22:40:57] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 28/860 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/861 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 393 constraints, problems are : Problem set: 0 solved, 5 unsolved in 434 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 28/860 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/860 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/861 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 398 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1214 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1678ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 651 ms.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 834/834 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 184 transition count 768
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 96 place count 169 transition count 913
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 128 place count 169 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 168 transition count 898
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 168 transition count 895
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 3 with 128 rules applied. Total rules applied 261 place count 168 transition count 767
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 304 place count 168 transition count 712
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 465 place count 125 transition count 594
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 472 place count 118 transition count 547
Iterating global reduction 4 with 7 rules applied. Total rules applied 479 place count 118 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 481 place count 118 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 542 place count 118 transition count 484
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 546 place count 118 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 549 place count 118 transition count 481
Applied a total of 549 rules in 71 ms. Remains 118 /184 variables (removed 66) and now considering 481/834 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 118/184 places, 481/834 transitions.
RANDOM walk for 40000 steps (792 resets) in 1018 ms. (39 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (55 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (55 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
[2024-05-21 22:40:59] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
// Phase 1: matrix 281 rows 118 cols
[2024-05-21 22:40:59] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 22:40:59] [INFO ] State equation strengthened by 145 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/243 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/335 variables, 35/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 59/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/391 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 25/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/399 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 158 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/243 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/335 variables, 35/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 59/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/391 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 25/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/399 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/399 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 102 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 834/834 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2024-05-21 22:41:00] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-21 22:41:01] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 22:41:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:41:01] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:41:01] [INFO ] Invariant cache hit.
[2024-05-21 22:41:01] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 22:41:01] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-21 22:41:01] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:41:01] [INFO ] Invariant cache hit.
[2024-05-21 22:41:01] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 1/860 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/861 variables, and 392 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 833/1224 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/861 variables, and 1224 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
After SMT, in 62252ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 62258ms
Finished structural reductions in LTL mode , in 1 iterations and 62746 ms. Remains : 184/184 places, 834/834 transitions.
Computed a total of 49 stabilizing places and 491 stable transitions
Computed a total of 49 stabilizing places and 491 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1194 resets) in 1313 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (59 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (63 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (59 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (59 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 454301 steps, run timeout after 3005 ms. (steps per millisecond=151 ) properties seen :0 out of 5
Probabilistic random walk after 454301 steps, saw 64440 distinct states, run finished after 3005 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-21 22:42:07] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:42:07] [INFO ] Invariant cache hit.
[2024-05-21 22:42:07] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 28/860 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/861 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/861 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 393 constraints, problems are : Problem set: 0 solved, 5 unsolved in 482 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/405 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/832 variables, 124/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 198/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 28/860 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/860 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/860 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/861 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/861 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 398 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1143 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1660ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 745 ms.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 834/834 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 184 transition count 768
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -145
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 96 place count 169 transition count 913
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 128 place count 169 transition count 881
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 168 transition count 898
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 168 transition count 895
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 3 with 128 rules applied. Total rules applied 261 place count 168 transition count 767
Free-agglomeration rule applied 43 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 304 place count 168 transition count 712
Reduce places removed 43 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 465 place count 125 transition count 594
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 472 place count 118 transition count 547
Iterating global reduction 4 with 7 rules applied. Total rules applied 479 place count 118 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 481 place count 118 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 5 with 61 rules applied. Total rules applied 542 place count 118 transition count 484
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 546 place count 118 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 549 place count 118 transition count 481
Applied a total of 549 rules in 65 ms. Remains 118 /184 variables (removed 66) and now considering 481/834 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 118/184 places, 481/834 transitions.
RANDOM walk for 40000 steps (791 resets) in 653 ms. (61 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (51 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2024-05-21 22:42:10] [INFO ] Flow matrix only has 281 transitions (discarded 200 similar events)
// Phase 1: matrix 281 rows 118 cols
[2024-05-21 22:42:10] [INFO ] Computed 13 invariants in 1 ms
[2024-05-21 22:42:10] [INFO ] State equation strengthened by 145 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/243 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/335 variables, 35/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 59/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/391 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 25/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/399 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 172 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/243 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/335 variables, 35/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 59/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/391 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 25/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/399 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/399 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 118/118 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 478ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 102 steps, including 2 resets, run visited all 2 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2850 reset in 419 ms.
Product exploration explored 100000 steps with 2841 reset in 442 ms.
Built C files in :
/tmp/ltsmin9996003314148435413
[2024-05-21 22:42:12] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9996003314148435413
Running compilation step : cd /tmp/ltsmin9996003314148435413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1722 ms.
Running link step : cd /tmp/ltsmin9996003314148435413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9996003314148435413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16868597278776875106.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 834/834 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2024-05-21 22:42:27] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
// Phase 1: matrix 677 rows 184 cols
[2024-05-21 22:42:27] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 22:42:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 22:42:27] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:42:27] [INFO ] Invariant cache hit.
[2024-05-21 22:42:28] [INFO ] State equation strengthened by 204 read => feed constraints.
[2024-05-21 22:42:28] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-21 22:42:28] [INFO ] Flow matrix only has 677 transitions (discarded 157 similar events)
[2024-05-21 22:42:28] [INFO ] Invariant cache hit.
[2024-05-21 22:42:28] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 5 (OVERLAPS) 1/860 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 860/861 variables, and 392 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (OVERLAPS) 676/859 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/859 variables, 203/391 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/859 variables, 833/1224 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 859/861 variables, and 1224 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 183/184 constraints, ReadFeed: 203/204 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
After SMT, in 62635ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 62646ms
Finished structural reductions in LTL mode , in 1 iterations and 63193 ms. Remains : 184/184 places, 834/834 transitions.
Built C files in :
/tmp/ltsmin1765346187294691677
[2024-05-21 22:43:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1765346187294691677
Running compilation step : cd /tmp/ltsmin1765346187294691677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1767 ms.
Running link step : cd /tmp/ltsmin1765346187294691677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1765346187294691677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6449539765461921003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:43:46] [INFO ] Flatten gal took : 28 ms
[2024-05-21 22:43:46] [INFO ] Flatten gal took : 28 ms
[2024-05-21 22:43:46] [INFO ] Time to serialize gal into /tmp/LTL868563957705659799.gal : 4 ms
[2024-05-21 22:43:46] [INFO ] Time to serialize properties into /tmp/LTL6206880636536396305.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL868563957705659799.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12650881346253807523.hoa' '-atoms' '/tmp/LTL6206880636536396305.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6206880636536396305.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12650881346253807523.hoa
Detected timeout of ITS tools.
[2024-05-21 22:44:01] [INFO ] Flatten gal took : 29 ms
[2024-05-21 22:44:01] [INFO ] Flatten gal took : 28 ms
[2024-05-21 22:44:01] [INFO ] Time to serialize gal into /tmp/LTL10678902907880870169.gal : 4 ms
[2024-05-21 22:44:01] [INFO ] Time to serialize properties into /tmp/LTL7619506855503735737.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10678902907880870169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7619506855503735737.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))")||(("(p1521==0)")||(X("(((p301==0)||(p343==0))||((p580==0)||(p1472...296
Formula 0 simplified : XF(!"((((p301==0)||(p343==0))||((p580==0)||(p1472==0)))&&((((p919==0)||(p957==0))||((p1129==0)||(p1503==0)))||(p1521==0)))" & XXF(!"...280
Detected timeout of ITS tools.
[2024-05-21 22:44:16] [INFO ] Flatten gal took : 30 ms
[2024-05-21 22:44:16] [INFO ] Applying decomposition
[2024-05-21 22:44:16] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12634647358127528394.txt' '-o' '/tmp/graph12634647358127528394.bin' '-w' '/tmp/graph12634647358127528394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12634647358127528394.bin' '-l' '-1' '-v' '-w' '/tmp/graph12634647358127528394.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:44:16] [INFO ] Decomposing Gal with order
[2024-05-21 22:44:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:44:16] [INFO ] Removed a total of 1815 redundant transitions.
[2024-05-21 22:44:16] [INFO ] Flatten gal took : 38 ms
[2024-05-21 22:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 6 ms.
[2024-05-21 22:44:16] [INFO ] Time to serialize gal into /tmp/LTL9947280918715675994.gal : 2 ms
[2024-05-21 22:44:16] [INFO ] Time to serialize properties into /tmp/LTL3567887507114216035.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9947280918715675994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3567887507114216035.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X(X(G(("(((i3.u21.p919==0)||(i3.u22.p957==0))||((i3.u23.p1129==0)||(u45.p1503==0)))")||(("(u45.p1521==0)")||(X("(((i1.u8.p301=...404
Formula 0 simplified : XF(!"((((i1.u8.p301==0)||(i1.u9.p343==0))||((i1.u8.p580==0)||(i4.u38.p1472==0)))&&((((i3.u21.p919==0)||(i3.u22.p957==0))||((i3.u23.p...388
Reverse transition relation is NOT exact ! Due to transitions t2492_t980, t2483_t792, t2006_t941_t752_t563_t370_t176, u45.t3, i0.t944_t949_t946, i0.t2399_t...2377
Computing Next relation with stutter on 1.31058e+12 deadlock states
6 unique states visited
0 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
967 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.73271,377600,1,0,604454,14248,5649,2.71085e+06,1346,105548,237585
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property CloudDeployment-PT-5b-LTLFireability-05 finished in 279406 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((p0 U (X(p1)||G(p0))))))))'
[2024-05-21 22:44:29] [INFO ] Flatten gal took : 189 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15384729805831272405
[2024-05-21 22:44:29] [INFO ] Too many transitions (2547) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:44:29] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15384729805831272405
Running compilation step : cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 22:44:29] [INFO ] Applying decomposition
[2024-05-21 22:44:29] [INFO ] Flatten gal took : 189 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7728075450941871610.txt' '-o' '/tmp/graph7728075450941871610.bin' '-w' '/tmp/graph7728075450941871610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7728075450941871610.bin' '-l' '-1' '-v' '-w' '/tmp/graph7728075450941871610.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:44:29] [INFO ] Decomposing Gal with order
[2024-05-21 22:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:44:30] [INFO ] Removed a total of 12443 redundant transitions.
[2024-05-21 22:44:30] [INFO ] Flatten gal took : 392 ms
[2024-05-21 22:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 104 ms.
[2024-05-21 22:44:30] [INFO ] Time to serialize gal into /tmp/LTLFireability1437638724345424930.gal : 46 ms
[2024-05-21 22:44:30] [INFO ] Time to serialize properties into /tmp/LTLFireability17693179518092817406.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1437638724345424930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17693179518092817406.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((F(("((i23.i1.i3.u333.p1437==0)&&((((((i24.u6.p27==0)||(i24.u7.p58==0))||((i0.i1.i1.u13.p95==0)||(i21.i0.i0.u284.p302==0)))||(((i6.u...660
Formula 0 simplified : G(!"((i23.i1.i3.u333.p1437==0)&&((((((i24.u6.p27==0)||(i24.u7.p58==0))||((i0.i1.i1.u13.p95==0)||(i21.i0.i0.u284.p302==0)))||(((i6.u7...649
Compilation finished in 11211 ms.
Running link step : cd /tmp/ltsmin15384729805831272405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp4==true) U X([](!(LTLAPp5==true))))&&(LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp4==true) U X([](!(LTLAPp5==true))))&&(LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp6==true)||X(X([]((X((LTLAPp8==true))||(LTLAPp7==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp6==true)||X(X([]((X((LTLAPp8==true))||(LTLAPp7==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp9==true)&&X(((LTLAPp9==true) U (X((LTLAPp10==true))||[]((LTLAPp9==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp9==true)&&X(((LTLAPp9==true) U (X((LTLAPp10==true))||[]((LTLAPp9==true))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin15384729805831272405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp4==true) U X([](!(LTLAPp5==true))))&&(LTLAPp3==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-5b, 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 r070-tall-171620506200596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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