Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 293K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716216447102

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-20 14:47:29] [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-20 14:47:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:47:30] [INFO ] Load time of PNML (sax parser for PT used): 421 ms
[2024-05-20 14:47:30] [INFO ] Transformed 846 places.
[2024-05-20 14:47:30] [INFO ] Transformed 1148 transitions.
[2024-05-20 14:47:30] [INFO ] Found NUPN structural information;
[2024-05-20 14:47:30] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 689 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 5 formulas.
FORMULA ASLink-PT-01b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 798 transition count 1100
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 798 transition count 1100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 798 transition count 1099
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 113 place count 782 transition count 1070
Iterating global reduction 1 with 16 rules applied. Total rules applied 129 place count 782 transition count 1070
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 134 place count 782 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 778 transition count 1061
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 778 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 777 transition count 1060
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 777 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 776 transition count 1059
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 776 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 775 transition count 1058
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 775 transition count 1058
Applied a total of 148 rules in 585 ms. Remains 775 /846 variables (removed 71) and now considering 1058/1148 (removed 90) transitions.
// Phase 1: matrix 1058 rows 775 cols
[2024-05-20 14:47:31] [INFO ] Computed 82 invariants in 87 ms
[2024-05-20 14:47:32] [INFO ] Implicit Places using invariants in 1082 ms returned [609, 620, 631, 639, 647, 655, 663, 674, 682, 690, 701]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1132 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 764/846 places, 1058/1148 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 752 transition count 1046
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 752 transition count 1046
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 744 transition count 1038
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 744 transition count 1038
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 739 transition count 1033
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 739 transition count 1033
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 737 transition count 1031
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 737 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 736 transition count 1030
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 736 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 735 transition count 1029
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 735 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 734 transition count 1028
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 734 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 733 transition count 1027
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 733 transition count 1027
Applied a total of 62 rules in 255 ms. Remains 733 /764 variables (removed 31) and now considering 1027/1058 (removed 31) transitions.
// Phase 1: matrix 1027 rows 733 cols
[2024-05-20 14:47:32] [INFO ] Computed 71 invariants in 39 ms
[2024-05-20 14:47:33] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2024-05-20 14:47:33] [INFO ] Invariant cache hit.
[2024-05-20 14:47:37] [INFO ] Implicit Places using invariants and state equation in 3420 ms returned []
Implicit Place search using SMT with State Equation took 4724 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 733/846 places, 1027/1148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6726 ms. Remains : 733/846 places, 1027/1148 transitions.
Support contains 45 out of 733 places after structural reductions.
[2024-05-20 14:47:37] [INFO ] Flatten gal took : 253 ms
[2024-05-20 14:47:38] [INFO ] Flatten gal took : 139 ms
[2024-05-20 14:47:38] [INFO ] Input system was already deterministic with 1027 transitions.
RANDOM walk for 40000 steps (230 resets) in 2567 ms. (15 steps per ms) remains 11/26 properties
BEST_FIRST walk for 40003 steps (73 resets) in 308 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (72 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (61 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (65 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (66 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (73 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (61 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (69 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (68 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (58 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (64 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
[2024-05-20 14:47:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 155/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 138/317 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 5 (OVERLAPS) 416/733 variables, 53/71 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-20 14:47:41] [INFO ] Deduced a trap composed of 41 places in 376 ms of which 69 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/733 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1027/1760 variables, 733/805 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1760 variables, 0/805 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1760 variables, 0/805 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1760/1760 variables, and 805 constraints, problems are : Problem set: 1 solved, 10 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 733/733 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 254/275 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 237/512 variables, 18/28 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 221/733 variables, 43/72 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/733 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/1760 variables, and 805 constraints, problems are : Problem set: 9 solved, 2 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 733/733 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 9398ms problems are : Problem set: 9 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 733 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 733 transition count 903
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 129 rules applied. Total rules applied 253 place count 609 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 256 place count 606 transition count 898
Performed 192 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 192 Pre rules applied. Total rules applied 256 place count 606 transition count 706
Deduced a syphon composed of 192 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 654 place count 400 transition count 706
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 665 place count 399 transition count 696
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 675 place count 389 transition count 696
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 675 place count 389 transition count 691
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 690 place count 379 transition count 691
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 690 place count 379 transition count 687
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 698 place count 375 transition count 687
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 705 place count 368 transition count 673
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 713 place count 367 transition count 673
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 713 place count 367 transition count 672
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 715 place count 366 transition count 672
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 719 place count 362 transition count 668
Iterating global reduction 5 with 4 rules applied. Total rules applied 723 place count 362 transition count 668
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 723 place count 362 transition count 667
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 725 place count 361 transition count 667
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 726 place count 360 transition count 666
Iterating global reduction 5 with 1 rules applied. Total rules applied 727 place count 360 transition count 666
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 121 rules applied. Total rules applied 848 place count 299 transition count 606
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 851 place count 296 transition count 603
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 855 place count 295 transition count 603
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 856 place count 295 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 857 place count 294 transition count 602
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 859 place count 292 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 861 place count 292 transition count 600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 863 place count 292 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 864 place count 291 transition count 598
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 865 place count 290 transition count 597
Iterating global reduction 9 with 1 rules applied. Total rules applied 866 place count 290 transition count 597
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 867 place count 289 transition count 596
Iterating global reduction 9 with 1 rules applied. Total rules applied 868 place count 289 transition count 596
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 870 place count 288 transition count 601
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 872 place count 288 transition count 599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 874 place count 286 transition count 599
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 875 place count 286 transition count 599
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 876 place count 285 transition count 598
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 879 place count 283 transition count 597
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 880 place count 282 transition count 597
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 880 place count 282 transition count 594
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 7 rules applied. Total rules applied 887 place count 278 transition count 594
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 12 with 2 rules applied. Total rules applied 889 place count 276 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 889 place count 276 transition count 593
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 891 place count 275 transition count 593
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 897 place count 272 transition count 590
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 898 place count 271 transition count 589
Iterating global reduction 13 with 1 rules applied. Total rules applied 899 place count 271 transition count 589
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 900 place count 271 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 901 place count 270 transition count 588
Applied a total of 901 rules in 629 ms. Remains 270 /733 variables (removed 463) and now considering 588/1027 (removed 439) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 270/733 places, 588/1027 transitions.
RANDOM walk for 40000 steps (820 resets) in 660 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (367 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (373 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 387611 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 2
Probabilistic random walk after 387611 steps, saw 116323 distinct states, run finished after 3006 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 588 rows 270 cols
[2024-05-20 14:47:53] [INFO ] Computed 43 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/122 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/124 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 114/238 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/256 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/270 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 588/858 variables, 270/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/858 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/858 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 858/858 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/122 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 14:47:54] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/124 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 18/256 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 14:47:54] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/270 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 858/858 variables, and 315 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2271ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ASLink-PT-01b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-01b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 733 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 732 transition count 903
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 128 rules applied. Total rules applied 251 place count 609 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 254 place count 606 transition count 898
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 194 Pre rules applied. Total rules applied 254 place count 606 transition count 704
Deduced a syphon composed of 194 places in 3 ms
Ensure Unique test removed 14 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 656 place count 398 transition count 704
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 667 place count 397 transition count 694
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 677 place count 387 transition count 694
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 677 place count 387 transition count 689
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 692 place count 377 transition count 689
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 692 place count 377 transition count 685
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 700 place count 373 transition count 685
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 706 place count 367 transition count 672
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 713 place count 366 transition count 672
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 713 place count 366 transition count 671
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 715 place count 365 transition count 671
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 719 place count 361 transition count 660
Iterating global reduction 5 with 4 rules applied. Total rules applied 723 place count 361 transition count 660
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 723 place count 361 transition count 659
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 725 place count 360 transition count 659
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 726 place count 359 transition count 651
Iterating global reduction 5 with 1 rules applied. Total rules applied 727 place count 359 transition count 651
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 728 place count 358 transition count 643
Iterating global reduction 5 with 1 rules applied. Total rules applied 729 place count 358 transition count 643
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 730 place count 357 transition count 635
Iterating global reduction 5 with 1 rules applied. Total rules applied 731 place count 357 transition count 635
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 732 place count 356 transition count 627
Iterating global reduction 5 with 1 rules applied. Total rules applied 733 place count 356 transition count 627
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 734 place count 355 transition count 619
Iterating global reduction 5 with 1 rules applied. Total rules applied 735 place count 355 transition count 619
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 736 place count 354 transition count 611
Iterating global reduction 5 with 1 rules applied. Total rules applied 737 place count 354 transition count 611
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 738 place count 353 transition count 603
Iterating global reduction 5 with 1 rules applied. Total rules applied 739 place count 353 transition count 603
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 740 place count 352 transition count 595
Iterating global reduction 5 with 1 rules applied. Total rules applied 741 place count 352 transition count 595
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 742 place count 351 transition count 587
Iterating global reduction 5 with 1 rules applied. Total rules applied 743 place count 351 transition count 587
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 744 place count 350 transition count 579
Iterating global reduction 5 with 1 rules applied. Total rules applied 745 place count 350 transition count 579
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 746 place count 349 transition count 571
Iterating global reduction 5 with 1 rules applied. Total rules applied 747 place count 349 transition count 571
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 748 place count 348 transition count 563
Iterating global reduction 5 with 1 rules applied. Total rules applied 749 place count 348 transition count 563
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 750 place count 347 transition count 555
Iterating global reduction 5 with 1 rules applied. Total rules applied 751 place count 347 transition count 555
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 752 place count 346 transition count 547
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 346 transition count 547
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 117 rules applied. Total rules applied 870 place count 287 transition count 489
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 873 place count 284 transition count 486
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 877 place count 283 transition count 486
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 878 place count 283 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 879 place count 282 transition count 485
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 881 place count 280 transition count 483
Iterating global reduction 7 with 2 rules applied. Total rules applied 883 place count 280 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 885 place count 280 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 886 place count 279 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 888 place count 278 transition count 488
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 890 place count 276 transition count 486
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 893 place count 274 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 894 place count 273 transition count 485
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 894 place count 273 transition count 482
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 901 place count 269 transition count 482
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 11 with 3 rules applied. Total rules applied 904 place count 266 transition count 482
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 904 place count 266 transition count 481
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 906 place count 265 transition count 481
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 914 place count 261 transition count 477
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 916 place count 259 transition count 475
Iterating global reduction 12 with 2 rules applied. Total rules applied 918 place count 259 transition count 475
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 919 place count 258 transition count 474
Iterating global reduction 12 with 1 rules applied. Total rules applied 920 place count 258 transition count 474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 921 place count 258 transition count 473
Applied a total of 921 rules in 439 ms. Remains 258 /733 variables (removed 475) and now considering 473/1027 (removed 554) transitions.
// Phase 1: matrix 473 rows 258 cols
[2024-05-20 14:47:56] [INFO ] Computed 42 invariants in 7 ms
[2024-05-20 14:47:57] [INFO ] Implicit Places using invariants in 494 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 138, 149, 150, 151, 169, 190, 191, 192, 193]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 497 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/733 places, 473/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 241 transition count 445
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 213 transition count 445
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 56 place count 213 transition count 434
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 79 place count 201 transition count 434
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 91 place count 197 transition count 426
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 99 place count 189 transition count 426
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 186 transition count 423
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 186 transition count 423
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 108 place count 186 transition count 420
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 140 place count 170 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 169 transition count 405
Applied a total of 142 rules in 38 ms. Remains 169 /241 variables (removed 72) and now considering 405/473 (removed 68) transitions.
// Phase 1: matrix 405 rows 169 cols
[2024-05-20 14:47:57] [INFO ] Computed 20 invariants in 6 ms
[2024-05-20 14:47:57] [INFO ] Implicit Places using invariants in 283 ms returned [88, 94, 99, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 286 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/733 places, 405/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 404
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 162 transition count 402
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 162 transition count 402
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 160 transition count 400
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 160 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 159 transition count 399
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 159 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 158 transition count 398
Applied a total of 14 rules in 28 ms. Remains 158 /165 variables (removed 7) and now considering 398/405 (removed 7) transitions.
// Phase 1: matrix 398 rows 158 cols
[2024-05-20 14:47:57] [INFO ] Computed 16 invariants in 6 ms
[2024-05-20 14:47:57] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-20 14:47:57] [INFO ] Invariant cache hit.
[2024-05-20 14:47:58] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 158/733 places, 398/1027 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2203 ms. Remains : 158/733 places, 398/1027 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-02
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-01b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLFireability-02 finished in 2580 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 733 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 732 transition count 903
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 128 rules applied. Total rules applied 251 place count 609 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 254 place count 606 transition count 898
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 193 Pre rules applied. Total rules applied 254 place count 606 transition count 705
Deduced a syphon composed of 193 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 654 place count 399 transition count 705
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 665 place count 398 transition count 695
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 675 place count 388 transition count 695
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 675 place count 388 transition count 690
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 690 place count 378 transition count 690
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 690 place count 378 transition count 686
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 698 place count 374 transition count 686
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 704 place count 368 transition count 673
Iterating global reduction 5 with 6 rules applied. Total rules applied 710 place count 368 transition count 673
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 710 place count 368 transition count 672
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 712 place count 367 transition count 672
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 715 place count 364 transition count 662
Iterating global reduction 5 with 3 rules applied. Total rules applied 718 place count 364 transition count 662
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 720 place count 362 transition count 653
Iterating global reduction 5 with 2 rules applied. Total rules applied 722 place count 362 transition count 653
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 723 place count 361 transition count 645
Iterating global reduction 5 with 1 rules applied. Total rules applied 724 place count 361 transition count 645
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 725 place count 360 transition count 637
Iterating global reduction 5 with 1 rules applied. Total rules applied 726 place count 360 transition count 637
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 727 place count 359 transition count 629
Iterating global reduction 5 with 1 rules applied. Total rules applied 728 place count 359 transition count 629
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 729 place count 358 transition count 621
Iterating global reduction 5 with 1 rules applied. Total rules applied 730 place count 358 transition count 621
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 731 place count 357 transition count 613
Iterating global reduction 5 with 1 rules applied. Total rules applied 732 place count 357 transition count 613
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 733 place count 356 transition count 605
Iterating global reduction 5 with 1 rules applied. Total rules applied 734 place count 356 transition count 605
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 735 place count 355 transition count 597
Iterating global reduction 5 with 1 rules applied. Total rules applied 736 place count 355 transition count 597
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 737 place count 354 transition count 589
Iterating global reduction 5 with 1 rules applied. Total rules applied 738 place count 354 transition count 589
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 739 place count 353 transition count 581
Iterating global reduction 5 with 1 rules applied. Total rules applied 740 place count 353 transition count 581
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 741 place count 352 transition count 573
Iterating global reduction 5 with 1 rules applied. Total rules applied 742 place count 352 transition count 573
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 743 place count 351 transition count 565
Iterating global reduction 5 with 1 rules applied. Total rules applied 744 place count 351 transition count 565
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 745 place count 350 transition count 557
Iterating global reduction 5 with 1 rules applied. Total rules applied 746 place count 350 transition count 557
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 747 place count 349 transition count 549
Iterating global reduction 5 with 1 rules applied. Total rules applied 748 place count 349 transition count 549
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 119 rules applied. Total rules applied 867 place count 289 transition count 490
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 871 place count 285 transition count 486
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 876 place count 284 transition count 486
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 877 place count 284 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 878 place count 283 transition count 485
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 880 place count 281 transition count 483
Iterating global reduction 7 with 2 rules applied. Total rules applied 882 place count 281 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 884 place count 281 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 885 place count 280 transition count 481
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 886 place count 279 transition count 480
Iterating global reduction 9 with 1 rules applied. Total rules applied 887 place count 279 transition count 480
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 888 place count 278 transition count 479
Iterating global reduction 9 with 1 rules applied. Total rules applied 889 place count 278 transition count 479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 891 place count 277 transition count 484
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 893 place count 275 transition count 482
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 896 place count 273 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 897 place count 272 transition count 481
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 897 place count 272 transition count 478
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 904 place count 268 transition count 478
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 11 with 3 rules applied. Total rules applied 907 place count 265 transition count 478
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 907 place count 265 transition count 477
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 909 place count 264 transition count 477
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 917 place count 260 transition count 473
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 919 place count 258 transition count 471
Iterating global reduction 12 with 2 rules applied. Total rules applied 921 place count 258 transition count 471
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 922 place count 257 transition count 470
Iterating global reduction 12 with 1 rules applied. Total rules applied 923 place count 257 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 924 place count 257 transition count 469
Applied a total of 924 rules in 346 ms. Remains 257 /733 variables (removed 476) and now considering 469/1027 (removed 558) transitions.
// Phase 1: matrix 469 rows 257 cols
[2024-05-20 14:47:58] [INFO ] Computed 43 invariants in 5 ms
[2024-05-20 14:47:59] [INFO ] Implicit Places using invariants in 808 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 138, 149, 150, 151, 169, 170, 191, 192, 193, 194]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 813 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/733 places, 469/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 239 transition count 441
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 211 transition count 441
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 56 place count 211 transition count 430
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 79 place count 199 transition count 430
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 91 place count 195 transition count 422
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 99 place count 187 transition count 422
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 184 transition count 419
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 184 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 108 place count 184 transition count 416
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 134 place count 171 transition count 403
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 138 place count 169 transition count 404
Applied a total of 138 rules in 28 ms. Remains 169 /239 variables (removed 70) and now considering 404/469 (removed 65) transitions.
// Phase 1: matrix 404 rows 169 cols
[2024-05-20 14:47:59] [INFO ] Computed 20 invariants in 4 ms
[2024-05-20 14:48:00] [INFO ] Implicit Places using invariants in 262 ms returned [88, 94, 99, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 265 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/733 places, 404/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 162 transition count 401
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 162 transition count 401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 160 transition count 399
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 160 transition count 399
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 159 transition count 398
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 159 transition count 398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 158 transition count 397
Applied a total of 14 rules in 25 ms. Remains 158 /165 variables (removed 7) and now considering 397/404 (removed 7) transitions.
// Phase 1: matrix 397 rows 158 cols
[2024-05-20 14:48:00] [INFO ] Computed 16 invariants in 4 ms
[2024-05-20 14:48:00] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-20 14:48:00] [INFO ] Invariant cache hit.
[2024-05-20 14:48:00] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 158/733 places, 397/1027 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2210 ms. Remains : 158/733 places, 397/1027 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-05
Product exploration explored 100000 steps with 3626 reset in 426 ms.
Product exploration explored 100000 steps with 3626 reset in 482 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9194 steps (341 resets) in 50 ms. (180 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 397/397 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 397/397 (removed 0) transitions.
[2024-05-20 14:48:02] [INFO ] Invariant cache hit.
[2024-05-20 14:48:02] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-20 14:48:02] [INFO ] Invariant cache hit.
[2024-05-20 14:48:03] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2024-05-20 14:48:03] [INFO ] Redundant transitions in 37 ms returned []
Running 382 sub problems to find dead transitions.
[2024-05-20 14:48:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (OVERLAPS) 2/158 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-20 14:48:10] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-20 14:48:10] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-20 14:48:12] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 3 ms to minimize.
[2024-05-20 14:48:13] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 397/555 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 382 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 178 constraints, problems are : Problem set: 0 solved, 382 unsolved in 29832 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (OVERLAPS) 2/158 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 382 unsolved
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 TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 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 TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 7 (OVERLAPS) 397/555 variables, 158/178 constraints. Problems are: Problem set: 224 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 158/336 constraints. Problems are: Problem set: 224 solved, 158 unsolved
[2024-05-20 14:48:53] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 1/337 constraints. Problems are: Problem set: 224 solved, 158 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 555/555 variables, and 337 constraints, problems are : Problem set: 224 solved, 158 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 158/382 constraints, Known Traps: 5/5 constraints]
After SMT, in 60366ms problems are : Problem set: 224 solved, 158 unsolved
Search for dead transitions found 224 dead transitions in 60380ms
Found 224 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 224 transitions
Dead transitions reduction (with SMT) removed 224 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/158 places, 173/397 transitions.
Ensure Unique test removed 30 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 128 transition count 143
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 98 transition count 143
Applied a total of 60 rules in 3 ms. Remains 98 /158 variables (removed 60) and now considering 143/173 (removed 30) transitions.
// Phase 1: matrix 143 rows 98 cols
[2024-05-20 14:49:03] [INFO ] Computed 14 invariants in 3 ms
[2024-05-20 14:49:03] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-20 14:49:03] [INFO ] Invariant cache hit.
[2024-05-20 14:49:04] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/158 places, 143/397 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61704 ms. Remains : 98/158 places, 143/397 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3615 steps (224 resets) in 13 ms. (258 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5912 reset in 135 ms.
Product exploration explored 100000 steps with 5826 reset in 178 ms.
Built C files in :
/tmp/ltsmin1146089806592321222
[2024-05-20 14:49:04] [INFO ] Computing symmetric may disable matrix : 143 transitions.
[2024-05-20 14:49:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:49:04] [INFO ] Computing symmetric may enable matrix : 143 transitions.
[2024-05-20 14:49:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:49:04] [INFO ] Computing Do-Not-Accords matrix : 143 transitions.
[2024-05-20 14:49:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:49:04] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1146089806592321222
Running compilation step : cd /tmp/ltsmin1146089806592321222;'/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 1038 ms.
Running link step : cd /tmp/ltsmin1146089806592321222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin1146089806592321222;'/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/stateBased109309557125813939.hoa' '--buchi-type=spotba'
LTSmin run took 4593 ms.
FORMULA ASLink-PT-01b-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-01b-LTLFireability-05 finished in 72076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(F(p1))))))'
Support contains 2 out of 733 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 726 transition count 1013
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 726 transition count 1013
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 722 transition count 1009
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 722 transition count 1009
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 718 transition count 998
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 718 transition count 998
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 715 transition count 988
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 715 transition count 988
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 712 transition count 985
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 712 transition count 985
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 709 transition count 975
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 709 transition count 975
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 707 transition count 966
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 707 transition count 966
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 705 transition count 964
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 705 transition count 964
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 703 transition count 955
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 703 transition count 955
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 701 transition count 946
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 701 transition count 946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 699 transition count 944
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 699 transition count 944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 697 transition count 935
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 697 transition count 935
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 695 transition count 926
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 695 transition count 926
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 693 transition count 924
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 693 transition count 924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 692 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 692 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 691 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 691 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 690 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 690 transition count 907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 689 transition count 899
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 689 transition count 899
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 688 transition count 891
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 688 transition count 891
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 687 transition count 890
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 687 transition count 890
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 686 transition count 882
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 686 transition count 882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 685 transition count 874
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 685 transition count 874
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 684 transition count 873
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 684 transition count 873
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 683 transition count 865
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 683 transition count 865
Applied a total of 100 rules in 362 ms. Remains 683 /733 variables (removed 50) and now considering 865/1027 (removed 162) transitions.
// Phase 1: matrix 865 rows 683 cols
[2024-05-20 14:49:11] [INFO ] Computed 71 invariants in 11 ms
[2024-05-20 14:49:11] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-20 14:49:11] [INFO ] Invariant cache hit.
[2024-05-20 14:49:13] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2743 ms to find 0 implicit places.
Running 864 sub problems to find dead transitions.
[2024-05-20 14:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 864 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/1548 variables, and 40 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 40/52 constraints, State Equation: 0/683 constraints, PredecessorRefiner: 864/864 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 864 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 2 (OVERLAPS) 1/683 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 864 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/683 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 864 unsolved
[2024-05-20 14:50:04] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 5 ms to minimize.
[2024-05-20 14:50:05] [INFO ] Deduced a trap composed of 220 places in 748 ms of which 7 ms to minimize.
[2024-05-20 14:50:06] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 4 ms to minimize.
[2024-05-20 14:50:06] [INFO ] Deduced a trap composed of 41 places in 313 ms of which 6 ms to minimize.
[2024-05-20 14:50:09] [INFO ] Deduced a trap composed of 131 places in 310 ms of which 6 ms to minimize.
[2024-05-20 14:50:11] [INFO ] Deduced a trap composed of 96 places in 321 ms of which 5 ms to minimize.
[2024-05-20 14:50:12] [INFO ] Deduced a trap composed of 43 places in 814 ms of which 11 ms to minimize.
[2024-05-20 14:50:13] [INFO ] Deduced a trap composed of 35 places in 672 ms of which 9 ms to minimize.
[2024-05-20 14:50:13] [INFO ] Deduced a trap composed of 22 places in 643 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/1548 variables, and 80 constraints, problems are : Problem set: 0 solved, 864 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 0/683 constraints, PredecessorRefiner: 0/864 constraints, Known Traps: 9/9 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 864 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Starting structural reductions in LTL mode, iteration 1 : 683/733 places, 865/1027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63637 ms. Remains : 683/733 places, 865/1027 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-06
Stuttering criterion allowed to conclude after 610 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-01b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLFireability-06 finished in 63893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 733 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 725 transition count 1012
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 725 transition count 1012
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 720 transition count 1007
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 720 transition count 1007
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 720 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 716 transition count 995
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 716 transition count 995
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 713 transition count 985
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 713 transition count 985
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 710 transition count 982
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 710 transition count 982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 707 transition count 972
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 707 transition count 972
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 705 transition count 963
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 705 transition count 963
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 703 transition count 961
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 703 transition count 961
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 701 transition count 952
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 701 transition count 952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 699 transition count 943
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 699 transition count 943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 697 transition count 941
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 697 transition count 941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 695 transition count 932
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 695 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 693 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 693 transition count 923
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 691 transition count 921
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 691 transition count 921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 690 transition count 913
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 690 transition count 913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 689 transition count 905
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 689 transition count 905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 688 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 688 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 687 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 687 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 686 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 686 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 685 transition count 887
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 685 transition count 887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 684 transition count 879
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 684 transition count 879
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 683 transition count 871
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 683 transition count 871
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 682 transition count 870
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 682 transition count 870
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 681 transition count 862
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 681 transition count 862
Applied a total of 105 rules in 565 ms. Remains 681 /733 variables (removed 52) and now considering 862/1027 (removed 165) transitions.
// Phase 1: matrix 862 rows 681 cols
[2024-05-20 14:50:15] [INFO ] Computed 71 invariants in 12 ms
[2024-05-20 14:50:15] [INFO ] Implicit Places using invariants in 777 ms returned []
[2024-05-20 14:50:15] [INFO ] Invariant cache hit.
[2024-05-20 14:50:18] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 3592 ms to find 0 implicit places.
Running 861 sub problems to find dead transitions.
[2024-05-20 14:50:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 13.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.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 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 3.0)
(s44 1.0)
(s45 6.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 6.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/1543 variables, and 40 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 40/53 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (OVERLAPS) 1/681 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/681 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-05-20 14:51:05] [INFO ] Deduced a trap composed of 142 places in 281 ms of which 5 ms to minimize.
[2024-05-20 14:51:06] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 6 ms to minimize.
[2024-05-20 14:51:06] [INFO ] Deduced a trap composed of 117 places in 734 ms of which 10 ms to minimize.
[2024-05-20 14:51:07] [INFO ] Deduced a trap composed of 87 places in 543 ms of which 7 ms to minimize.
[2024-05-20 14:51:10] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 4 ms to minimize.
[2024-05-20 14:51:10] [INFO ] Deduced a trap composed of 73 places in 321 ms of which 5 ms to minimize.
[2024-05-20 14:51:11] [INFO ] Deduced a trap composed of 85 places in 445 ms of which 7 ms to minimize.
[2024-05-20 14:51:11] [INFO ] Deduced a trap composed of 83 places in 419 ms of which 6 ms to minimize.
[2024-05-20 14:51:12] [INFO ] Deduced a trap composed of 95 places in 256 ms of which 4 ms to minimize.
[2024-05-20 14:51:12] [INFO ] Deduced a trap composed of 90 places in 490 ms of which 6 ms to minimize.
[2024-05-20 14:51:14] [INFO ] Deduced a trap composed of 116 places in 643 ms of which 10 ms to minimize.
[2024-05-20 14:51:14] [INFO ] Deduced a trap composed of 35 places in 635 ms of which 9 ms to minimize.
[2024-05-20 14:51:15] [INFO ] Deduced a trap composed of 26 places in 607 ms of which 8 ms to minimize.
[2024-05-20 14:51:16] [INFO ] Deduced a trap composed of 98 places in 769 ms of which 13 ms to minimize.
[2024-05-20 14:51:16] [INFO ] Deduced a trap composed of 35 places in 494 ms of which 6 ms to minimize.
[2024-05-20 14:51:17] [INFO ] Deduced a trap composed of 47 places in 386 ms of which 5 ms to minimize.
[2024-05-20 14:51:18] [INFO ] Deduced a trap composed of 105 places in 592 ms of which 9 ms to minimize.
[2024-05-20 14:51:18] [INFO ] Deduced a trap composed of 121 places in 472 ms of which 12 ms to minimize.
[2024-05-20 14:51:19] [INFO ] Deduced a trap composed of 27 places in 702 ms of which 10 ms to minimize.
SMT process timed out in 60762ms, After SMT, problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60781ms
Starting structural reductions in LTL mode, iteration 1 : 681/733 places, 862/1027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64942 ms. Remains : 681/733 places, 862/1027 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 546 ms.
Product exploration explored 100000 steps with 50000 reset in 416 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 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 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-01b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-01b-LTLFireability-07 finished in 66116 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((G(F(!p0))||(p1&&F(!p0))))))'
Support contains 2 out of 733 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 732 transition count 903
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 128 rules applied. Total rules applied 251 place count 609 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 254 place count 606 transition count 898
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 194 Pre rules applied. Total rules applied 254 place count 606 transition count 704
Deduced a syphon composed of 194 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 656 place count 398 transition count 704
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 667 place count 397 transition count 694
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 677 place count 387 transition count 694
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 677 place count 387 transition count 689
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 692 place count 377 transition count 689
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 692 place count 377 transition count 685
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 700 place count 373 transition count 685
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 706 place count 367 transition count 672
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 713 place count 366 transition count 672
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 713 place count 366 transition count 671
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 715 place count 365 transition count 671
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 719 place count 361 transition count 660
Iterating global reduction 5 with 4 rules applied. Total rules applied 723 place count 361 transition count 660
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 723 place count 361 transition count 659
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 725 place count 360 transition count 659
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 727 place count 358 transition count 650
Iterating global reduction 5 with 2 rules applied. Total rules applied 729 place count 358 transition count 650
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 730 place count 357 transition count 642
Iterating global reduction 5 with 1 rules applied. Total rules applied 731 place count 357 transition count 642
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 732 place count 356 transition count 634
Iterating global reduction 5 with 1 rules applied. Total rules applied 733 place count 356 transition count 634
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 734 place count 355 transition count 626
Iterating global reduction 5 with 1 rules applied. Total rules applied 735 place count 355 transition count 626
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 736 place count 354 transition count 618
Iterating global reduction 5 with 1 rules applied. Total rules applied 737 place count 354 transition count 618
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 738 place count 353 transition count 610
Iterating global reduction 5 with 1 rules applied. Total rules applied 739 place count 353 transition count 610
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 740 place count 352 transition count 602
Iterating global reduction 5 with 1 rules applied. Total rules applied 741 place count 352 transition count 602
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 742 place count 351 transition count 594
Iterating global reduction 5 with 1 rules applied. Total rules applied 743 place count 351 transition count 594
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 744 place count 350 transition count 586
Iterating global reduction 5 with 1 rules applied. Total rules applied 745 place count 350 transition count 586
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 746 place count 349 transition count 578
Iterating global reduction 5 with 1 rules applied. Total rules applied 747 place count 349 transition count 578
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 748 place count 348 transition count 570
Iterating global reduction 5 with 1 rules applied. Total rules applied 749 place count 348 transition count 570
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 750 place count 347 transition count 562
Iterating global reduction 5 with 1 rules applied. Total rules applied 751 place count 347 transition count 562
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 752 place count 346 transition count 554
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 346 transition count 554
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 754 place count 345 transition count 546
Iterating global reduction 5 with 1 rules applied. Total rules applied 755 place count 345 transition count 546
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 867 place count 289 transition count 490
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 870 place count 286 transition count 487
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 874 place count 285 transition count 487
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 876 place count 283 transition count 485
Iterating global reduction 5 with 2 rules applied. Total rules applied 878 place count 283 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 880 place count 283 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 881 place count 282 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 883 place count 281 transition count 489
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 885 place count 279 transition count 487
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 888 place count 277 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 889 place count 276 transition count 486
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 889 place count 276 transition count 483
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 7 rules applied. Total rules applied 896 place count 272 transition count 483
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 899 place count 269 transition count 483
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 899 place count 269 transition count 482
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 901 place count 268 transition count 482
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 909 place count 264 transition count 478
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 911 place count 262 transition count 476
Iterating global reduction 10 with 2 rules applied. Total rules applied 913 place count 262 transition count 476
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 914 place count 261 transition count 475
Iterating global reduction 10 with 1 rules applied. Total rules applied 915 place count 261 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 916 place count 261 transition count 474
Applied a total of 916 rules in 315 ms. Remains 261 /733 variables (removed 472) and now considering 474/1027 (removed 553) transitions.
// Phase 1: matrix 474 rows 261 cols
[2024-05-20 14:51:21] [INFO ] Computed 43 invariants in 4 ms
[2024-05-20 14:51:21] [INFO ] Implicit Places using invariants in 356 ms returned [1, 18, 19, 32, 49, 67, 87, 138, 139, 151, 152, 153, 171, 175, 193, 194, 195, 196]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 359 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/733 places, 474/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 243 transition count 446
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 215 transition count 446
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 56 place count 215 transition count 435
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 79 place count 203 transition count 435
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 91 place count 199 transition count 427
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 99 place count 191 transition count 427
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 188 transition count 424
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 188 transition count 424
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 108 place count 188 transition count 421
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 140 place count 172 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 171 transition count 407
Applied a total of 142 rules in 24 ms. Remains 171 /243 variables (removed 72) and now considering 407/474 (removed 67) transitions.
// Phase 1: matrix 407 rows 171 cols
[2024-05-20 14:51:21] [INFO ] Computed 20 invariants in 3 ms
[2024-05-20 14:51:21] [INFO ] Implicit Places using invariants in 214 ms returned [89, 95, 100, 168]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 218 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 167/733 places, 407/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 166 transition count 406
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 164 transition count 404
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 164 transition count 404
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 162 transition count 402
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 162 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 161 transition count 401
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 161 transition count 401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 160 transition count 400
Applied a total of 14 rules in 16 ms. Remains 160 /167 variables (removed 7) and now considering 400/407 (removed 7) transitions.
// Phase 1: matrix 400 rows 160 cols
[2024-05-20 14:51:21] [INFO ] Computed 16 invariants in 3 ms
[2024-05-20 14:51:21] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-20 14:51:21] [INFO ] Invariant cache hit.
[2024-05-20 14:51:22] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 160/733 places, 400/1027 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1632 ms. Remains : 160/733 places, 400/1027 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-09
Product exploration explored 100000 steps with 3340 reset in 299 ms.
Product exploration explored 100000 steps with 3402 reset in 281 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 97 ms :[p0, p0]
RANDOM walk for 553 steps (14 resets) in 5 ms. (92 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 147 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 88 ms :[p0, p0]
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Support contains 2 out of 160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-20 14:51:23] [INFO ] Invariant cache hit.
[2024-05-20 14:51:23] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-20 14:51:23] [INFO ] Invariant cache hit.
[2024-05-20 14:51:24] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2024-05-20 14:51:24] [INFO ] Redundant transitions in 13 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-20 14:51:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 2/160 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 14:51:31] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-05-20 14:51:32] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 2 ms to minimize.
[2024-05-20 14:51:32] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 3 ms to minimize.
[2024-05-20 14:51:33] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 14:51:36] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 400/560 variables, 160/181 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 181 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 2/160 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 390 unsolved
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 TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 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 TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 7 (OVERLAPS) 400/560 variables, 160/181 constraints. Problems are: Problem set: 224 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 166/347 constraints. Problems are: Problem set: 224 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 347 constraints, problems are : Problem set: 224 solved, 166 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 166/390 constraints, Known Traps: 5/5 constraints]
After SMT, in 60421ms problems are : Problem set: 224 solved, 166 unsolved
Search for dead transitions found 224 dead transitions in 60431ms
Found 224 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 224 transitions
Dead transitions reduction (with SMT) removed 224 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 176/400 transitions.
Ensure Unique test removed 30 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 130 transition count 146
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 100 transition count 146
Applied a total of 60 rules in 7 ms. Remains 100 /160 variables (removed 60) and now considering 146/176 (removed 30) transitions.
// Phase 1: matrix 146 rows 100 cols
[2024-05-20 14:52:24] [INFO ] Computed 14 invariants in 1 ms
[2024-05-20 14:52:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-20 14:52:24] [INFO ] Invariant cache hit.
[2024-05-20 14:52:25] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/160 places, 146/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61554 ms. Remains : 100/160 places, 146/400 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
RANDOM walk for 394 steps (22 resets) in 16 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 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 95 ms :[p0, p0]
Stuttering acceptance computed with spot in 93 ms :[p0, p0]
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Product exploration explored 100000 steps with 5263 reset in 119 ms.
Product exploration explored 100000 steps with 5331 reset in 139 ms.
Built C files in :
/tmp/ltsmin5302785629265255087
[2024-05-20 14:52:26] [INFO ] Computing symmetric may disable matrix : 146 transitions.
[2024-05-20 14:52:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:52:26] [INFO ] Computing symmetric may enable matrix : 146 transitions.
[2024-05-20 14:52:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:52:26] [INFO ] Computing Do-Not-Accords matrix : 146 transitions.
[2024-05-20 14:52:26] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:52:26] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5302785629265255087
Running compilation step : cd /tmp/ltsmin5302785629265255087;'/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 811 ms.
Running link step : cd /tmp/ltsmin5302785629265255087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5302785629265255087;'/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/stateBased16647802306998544941.hoa' '--buchi-type=spotba'
LTSmin run took 6947 ms.
FORMULA ASLink-PT-01b-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-01b-LTLFireability-09 finished in 73178 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 733 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 732 transition count 902
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 129 rules applied. Total rules applied 253 place count 608 transition count 897
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 257 place count 605 transition count 896
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 604 transition count 896
Performed 192 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 192 Pre rules applied. Total rules applied 258 place count 604 transition count 704
Deduced a syphon composed of 192 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 4 with 397 rules applied. Total rules applied 655 place count 399 transition count 704
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 11 rules applied. Total rules applied 666 place count 398 transition count 694
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 676 place count 388 transition count 694
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 676 place count 388 transition count 690
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 688 place count 380 transition count 690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 688 place count 380 transition count 687
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 694 place count 377 transition count 687
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 701 place count 370 transition count 673
Ensure Unique test removed 1 places
Iterating global reduction 6 with 8 rules applied. Total rules applied 709 place count 369 transition count 673
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 709 place count 369 transition count 672
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 711 place count 368 transition count 672
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 716 place count 363 transition count 660
Iterating global reduction 6 with 5 rules applied. Total rules applied 721 place count 363 transition count 660
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 721 place count 363 transition count 659
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 723 place count 362 transition count 659
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 725 place count 360 transition count 650
Iterating global reduction 6 with 2 rules applied. Total rules applied 727 place count 360 transition count 650
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 728 place count 359 transition count 642
Iterating global reduction 6 with 1 rules applied. Total rules applied 729 place count 359 transition count 642
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 730 place count 358 transition count 634
Iterating global reduction 6 with 1 rules applied. Total rules applied 731 place count 358 transition count 634
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 732 place count 357 transition count 626
Iterating global reduction 6 with 1 rules applied. Total rules applied 733 place count 357 transition count 626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 734 place count 356 transition count 618
Iterating global reduction 6 with 1 rules applied. Total rules applied 735 place count 356 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 736 place count 355 transition count 610
Iterating global reduction 6 with 1 rules applied. Total rules applied 737 place count 355 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 738 place count 354 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 739 place count 354 transition count 602
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 740 place count 353 transition count 594
Iterating global reduction 6 with 1 rules applied. Total rules applied 741 place count 353 transition count 594
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 742 place count 352 transition count 586
Iterating global reduction 6 with 1 rules applied. Total rules applied 743 place count 352 transition count 586
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 744 place count 351 transition count 578
Iterating global reduction 6 with 1 rules applied. Total rules applied 745 place count 351 transition count 578
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 746 place count 350 transition count 570
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 350 transition count 570
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 748 place count 349 transition count 562
Iterating global reduction 6 with 1 rules applied. Total rules applied 749 place count 349 transition count 562
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 750 place count 348 transition count 554
Iterating global reduction 6 with 1 rules applied. Total rules applied 751 place count 348 transition count 554
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 752 place count 347 transition count 546
Iterating global reduction 6 with 1 rules applied. Total rules applied 753 place count 347 transition count 546
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 119 rules applied. Total rules applied 872 place count 287 transition count 487
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 875 place count 284 transition count 484
Ensure Unique test removed 1 places
Iterating global reduction 6 with 4 rules applied. Total rules applied 879 place count 283 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 880 place count 283 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 881 place count 282 transition count 483
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 883 place count 280 transition count 481
Iterating global reduction 8 with 2 rules applied. Total rules applied 885 place count 280 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 887 place count 280 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 888 place count 279 transition count 479
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 889 place count 278 transition count 478
Iterating global reduction 10 with 1 rules applied. Total rules applied 890 place count 278 transition count 478
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 891 place count 277 transition count 477
Iterating global reduction 10 with 1 rules applied. Total rules applied 892 place count 277 transition count 477
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 894 place count 276 transition count 482
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 896 place count 274 transition count 480
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 899 place count 272 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 900 place count 271 transition count 479
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 900 place count 271 transition count 476
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 7 rules applied. Total rules applied 907 place count 267 transition count 476
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 910 place count 264 transition count 476
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 910 place count 264 transition count 475
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 912 place count 263 transition count 475
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 920 place count 259 transition count 471
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 922 place count 257 transition count 469
Iterating global reduction 13 with 2 rules applied. Total rules applied 924 place count 257 transition count 469
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 925 place count 256 transition count 468
Iterating global reduction 13 with 1 rules applied. Total rules applied 926 place count 256 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 927 place count 256 transition count 467
Applied a total of 927 rules in 197 ms. Remains 256 /733 variables (removed 477) and now considering 467/1027 (removed 560) transitions.
// Phase 1: matrix 467 rows 256 cols
[2024-05-20 14:52:34] [INFO ] Computed 44 invariants in 4 ms
[2024-05-20 14:52:34] [INFO ] Implicit Places using invariants in 361 ms returned [1, 18, 19, 31, 48, 66, 86, 129, 130, 141, 142, 153, 154, 155, 173, 194, 195, 196, 197]
[2024-05-20 14:52:34] [INFO ] Actually due to overlaps returned [173, 155, 48, 31, 153, 194, 154, 195, 1, 18, 196, 19, 66, 86, 141, 142, 197]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 363 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/733 places, 467/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 239 transition count 440
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 212 transition count 440
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 54 place count 212 transition count 429
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 77 place count 200 transition count 429
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 89 place count 196 transition count 421
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 97 place count 188 transition count 421
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 100 place count 185 transition count 418
Iterating global reduction 4 with 3 rules applied. Total rules applied 103 place count 185 transition count 418
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 106 place count 185 transition count 415
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 134 place count 171 transition count 401
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 138 place count 169 transition count 402
Applied a total of 138 rules in 20 ms. Remains 169 /239 variables (removed 70) and now considering 402/467 (removed 65) transitions.
// Phase 1: matrix 402 rows 169 cols
[2024-05-20 14:52:34] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 14:52:34] [INFO ] Implicit Places using invariants in 283 ms returned [88, 97, 98, 103, 166]
[2024-05-20 14:52:34] [INFO ] Actually due to overlaps returned [88, 97, 103, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 285 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 165/733 places, 402/1027 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 165 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 164 transition count 401
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 163 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 163 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 162 transition count 399
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 162 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 161 transition count 398
Applied a total of 8 rules in 12 ms. Remains 161 /165 variables (removed 4) and now considering 398/402 (removed 4) transitions.
// Phase 1: matrix 398 rows 161 cols
[2024-05-20 14:52:34] [INFO ] Computed 18 invariants in 3 ms
[2024-05-20 14:52:35] [INFO ] Implicit Places using invariants in 213 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 160/733 places, 398/1027 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1099 ms. Remains : 160/733 places, 398/1027 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-10
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLFireability-10 finished in 1158 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((X((p1 U X((p2||X(p2)))))||p0)))'
Support contains 5 out of 733 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 725 transition count 1012
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 725 transition count 1012
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 720 transition count 1007
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 720 transition count 1007
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 720 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 716 transition count 995
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 716 transition count 995
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 713 transition count 985
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 713 transition count 985
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 710 transition count 982
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 710 transition count 982
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 707 transition count 972
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 707 transition count 972
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 705 transition count 963
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 705 transition count 963
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 703 transition count 961
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 703 transition count 961
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 701 transition count 952
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 701 transition count 952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 699 transition count 943
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 699 transition count 943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 697 transition count 941
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 697 transition count 941
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 695 transition count 932
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 695 transition count 932
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 693 transition count 923
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 693 transition count 923
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 691 transition count 921
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 691 transition count 921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 690 transition count 913
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 690 transition count 913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 689 transition count 905
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 689 transition count 905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 688 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 688 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 687 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 687 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 686 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 686 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 685 transition count 887
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 685 transition count 887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 684 transition count 879
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 684 transition count 879
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 683 transition count 871
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 683 transition count 871
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 682 transition count 870
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 682 transition count 870
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 681 transition count 862
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 681 transition count 862
Applied a total of 105 rules in 335 ms. Remains 681 /733 variables (removed 52) and now considering 862/1027 (removed 165) transitions.
// Phase 1: matrix 862 rows 681 cols
[2024-05-20 14:52:35] [INFO ] Computed 71 invariants in 7 ms
[2024-05-20 14:52:36] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-20 14:52:36] [INFO ] Invariant cache hit.
[2024-05-20 14:52:38] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 3171 ms to find 0 implicit places.
Running 861 sub problems to find dead transitions.
[2024-05-20 14:52:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/1543 variables, and 40 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 40/53 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (OVERLAPS) 1/681 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/681 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-05-20 14:53:28] [INFO ] Deduced a trap composed of 142 places in 459 ms of which 7 ms to minimize.
[2024-05-20 14:53:29] [INFO ] Deduced a trap composed of 51 places in 402 ms of which 6 ms to minimize.
[2024-05-20 14:53:29] [INFO ] Deduced a trap composed of 117 places in 597 ms of which 9 ms to minimize.
[2024-05-20 14:53:30] [INFO ] Deduced a trap composed of 87 places in 560 ms of which 9 ms to minimize.
[2024-05-20 14:53:33] [INFO ] Deduced a trap composed of 104 places in 295 ms of which 5 ms to minimize.
[2024-05-20 14:53:34] [INFO ] Deduced a trap composed of 73 places in 514 ms of which 9 ms to minimize.
[2024-05-20 14:53:35] [INFO ] Deduced a trap composed of 85 places in 476 ms of which 9 ms to minimize.
[2024-05-20 14:53:35] [INFO ] Deduced a trap composed of 83 places in 484 ms of which 8 ms to minimize.
[2024-05-20 14:53:36] [INFO ] Deduced a trap composed of 95 places in 414 ms of which 6 ms to minimize.
[2024-05-20 14:53:37] [INFO ] Deduced a trap composed of 90 places in 398 ms of which 7 ms to minimize.
[2024-05-20 14:53:38] [INFO ] Deduced a trap composed of 116 places in 640 ms of which 10 ms to minimize.
[2024-05-20 14:53:38] [INFO ] Deduced a trap composed of 35 places in 515 ms of which 8 ms to minimize.
[2024-05-20 14:53:39] [INFO ] Deduced a trap composed of 26 places in 356 ms of which 6 ms to minimize.
SMT process timed out in 60608ms, After SMT, problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Starting structural reductions in LTL mode, iteration 1 : 681/733 places, 862/1027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64131 ms. Remains : 681/733 places, 862/1027 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 147 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-01b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLFireability-11 finished in 64413 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((p0 U p1)) U (p1||G(!p2)||G(p2))))'
Support contains 6 out of 733 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 733/733 places, 1027/1027 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 727 transition count 1014
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 727 transition count 1014
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 723 transition count 1010
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 723 transition count 1010
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 723 transition count 1009
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 720 transition count 999
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 720 transition count 999
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 717 transition count 989
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 717 transition count 989
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 714 transition count 986
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 714 transition count 986
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 711 transition count 976
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 711 transition count 976
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 709 transition count 967
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 709 transition count 967
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 707 transition count 965
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 707 transition count 965
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 705 transition count 956
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 705 transition count 956
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 703 transition count 947
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 703 transition count 947
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 701 transition count 945
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 701 transition count 945
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 699 transition count 936
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 699 transition count 936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 697 transition count 927
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 697 transition count 927
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 695 transition count 925
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 695 transition count 925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 694 transition count 917
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 694 transition count 917
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 693 transition count 909
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 693 transition count 909
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 692 transition count 908
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 692 transition count 908
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 691 transition count 900
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 691 transition count 900
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 690 transition count 892
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 690 transition count 892
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 689 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 689 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 688 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 688 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 687 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 687 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 686 transition count 874
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 686 transition count 874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 685 transition count 866
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 685 transition count 866
Applied a total of 97 rules in 581 ms. Remains 685 /733 variables (removed 48) and now considering 866/1027 (removed 161) transitions.
// Phase 1: matrix 866 rows 685 cols
[2024-05-20 14:53:40] [INFO ] Computed 71 invariants in 11 ms
[2024-05-20 14:53:40] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-20 14:53:40] [INFO ] Invariant cache hit.
[2024-05-20 14:53:42] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 2866 ms to find 0 implicit places.
Running 865 sub problems to find dead transitions.
[2024-05-20 14:53:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/684 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 684/1551 variables, and 40 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, Generalized P Invariants (flows): 40/53 constraints, State Equation: 0/685 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/684 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/684 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (OVERLAPS) 1/685 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/685 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-20 14:54:26] [INFO ] Deduced a trap composed of 56 places in 393 ms of which 6 ms to minimize.
[2024-05-20 14:54:27] [INFO ] Deduced a trap composed of 58 places in 298 ms of which 6 ms to minimize.
[2024-05-20 14:54:28] [INFO ] Deduced a trap composed of 63 places in 608 ms of which 10 ms to minimize.
[2024-05-20 14:54:29] [INFO ] Deduced a trap composed of 68 places in 699 ms of which 10 ms to minimize.
[2024-05-20 14:54:29] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 6 ms to minimize.
[2024-05-20 14:54:32] [INFO ] Deduced a trap composed of 100 places in 622 ms of which 10 ms to minimize.
[2024-05-20 14:54:32] [INFO ] Deduced a trap composed of 98 places in 690 ms of which 10 ms to minimize.
[2024-05-20 14:54:33] [INFO ] Deduced a trap composed of 244 places in 592 ms of which 10 ms to minimize.
[2024-05-20 14:54:34] [INFO ] Deduced a trap composed of 99 places in 653 ms of which 9 ms to minimize.
[2024-05-20 14:54:36] [INFO ] Deduced a trap composed of 256 places in 725 ms of which 10 ms to minimize.
[2024-05-20 14:54:37] [INFO ] Deduced a trap composed of 46 places in 784 ms of which 10 ms to minimize.
[2024-05-20 14:54:38] [INFO ] Deduced a trap composed of 35 places in 511 ms of which 6 ms to minimize.
[2024-05-20 14:54:39] [INFO ] Deduced a trap composed of 26 places in 634 ms of which 8 ms to minimize.
[2024-05-20 14:54:39] [INFO ] Deduced a trap composed of 17 places in 539 ms of which 8 ms to minimize.
[2024-05-20 14:54:40] [INFO ] Deduced a trap composed of 73 places in 552 ms of which 9 ms to minimize.
[2024-05-20 14:54:40] [INFO ] Deduced a trap composed of 45 places in 512 ms of which 8 ms to minimize.
[2024-05-20 14:54:41] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-20 14:54:42] [INFO ] Deduced a trap composed of 147 places in 492 ms of which 6 ms to minimize.
[2024-05-20 14:54:42] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 7 ms to minimize.
[2024-05-20 14:54:43] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/685 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 685/1551 variables, and 91 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/685 constraints, PredecessorRefiner: 0/865 constraints, Known Traps: 20/20 constraints]
After SMT, in 60475ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60495ms
Starting structural reductions in LTL mode, iteration 1 : 685/733 places, 866/1027 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63946 ms. Remains : 685/733 places, 866/1027 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, false, (AND (NOT p1) p2), (AND (NOT p1) (NOT p2)), (NOT p1), p2, (NOT p2)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3603 steps with 25 reset in 8 ms.
FORMULA ASLink-PT-01b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLFireability-13 finished in 64297 ms.
All properties solved by simple procedures.
Total runtime 434419 ms.

BK_STOP 1716216883837

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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