Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000292.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
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 r002-tall-174853729000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 293K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml 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 1748566533792

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 202505121319
[2025-05-30 00:55:35] [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]
[2025-05-30 00:55:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:55:35] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-05-30 00:55:35] [INFO ] Transformed 846 places.
[2025-05-30 00:55:35] [INFO ] Transformed 1148 transitions.
[2025-05-30 00:55:35] [INFO ] Found NUPN structural information;
[2025-05-30 00:55:35] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ASLink-PT-01b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-09 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 40 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 1078
Iterating global reduction 1 with 16 rules applied. Total rules applied 129 place count 782 transition count 1078
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 1073
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 778 transition count 1069
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 778 transition count 1069
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 145 place count 775 transition count 1066
Iterating global reduction 2 with 3 rules applied. Total rules applied 148 place count 775 transition count 1066
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 773 transition count 1064
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 773 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 771 transition count 1062
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 771 transition count 1062
Applied a total of 156 rules in 352 ms. Remains 771 /846 variables (removed 75) and now considering 1062/1148 (removed 86) transitions.
// Phase 1: matrix 1062 rows 771 cols
[2025-05-30 00:55:35] [INFO ] Computed 82 invariants in 56 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:55:36] [INFO ] Implicit Places using invariants in 798 ms returned [603, 614, 625, 633, 641, 649, 657, 668, 676, 684, 695]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 833 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 760/846 places, 1062/1148 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 749 transition count 1051
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 749 transition count 1051
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 740 transition count 1042
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 740 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 734 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 734 transition count 1036
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 730 transition count 1032
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 730 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 728 transition count 1030
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 728 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 726 transition count 1028
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 726 transition count 1028
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 724 transition count 1026
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 724 transition count 1026
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 722 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 722 transition count 1024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 721 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 721 transition count 1023
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 720 transition count 1022
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 720 transition count 1022
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 719 transition count 1021
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 719 transition count 1021
Applied a total of 82 rules in 380 ms. Remains 719 /760 variables (removed 41) and now considering 1021/1062 (removed 41) transitions.
// Phase 1: matrix 1021 rows 719 cols
[2025-05-30 00:55:37] [INFO ] Computed 71 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:55:37] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-05-30 00:55:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:55:39] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2079 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 719/846 places, 1021/1148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3659 ms. Remains : 719/846 places, 1021/1148 transitions.
Support contains 40 out of 719 places after structural reductions.
[2025-05-30 00:55:39] [INFO ] Flatten gal took : 95 ms
[2025-05-30 00:55:39] [INFO ] Flatten gal took : 57 ms
[2025-05-30 00:55:39] [INFO ] Input system was already deterministic with 1021 transitions.
Support contains 38 out of 719 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (242 resets) in 1292 ms. (30 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40003 steps (68 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (72 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (66 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (67 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (63 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (70 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (67 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (67 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
[2025-05-30 00:55:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 323/337 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (OVERLAPS) 116/453 variables, 16/28 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:55:40] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 254/707 variables, 39/68 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:55:41] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 52 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/707 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 12/719 variables, 4/73 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1021/1740 variables, 719/792 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:55:43] [INFO ] Deduced a trap composed of 79 places in 277 ms of which 61 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1740 variables, 1/793 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1740 variables, 0/793 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1740 variables, 0/793 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1740/1740 variables, and 793 constraints, problems are : Problem set: 1 solved, 7 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 234/244 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 132/376 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 312/688 variables, 43/67 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 31/719 variables, 6/73 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:55:45] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 1/75 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/719 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 12 (OVERLAPS) 1021/1740 variables, 719/794 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1740 variables, 3/797 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1740 variables, 0/797 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1740 variables, 0/797 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Int declared 1740/1740 variables, and 797 constraints, problems are : Problem set: 5 solved, 3 unsolved in 3840 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8002ms problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1021/1021 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 719 transition count 905
Reduce places removed 116 places and 0 transitions.
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 1 with 118 rules applied. Total rules applied 234 place count 603 transition count 903
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 238 place count 602 transition count 900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 240 place count 600 transition count 900
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 190 Pre rules applied. Total rules applied 240 place count 600 transition count 710
Deduced a syphon composed of 190 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 4 with 394 rules applied. Total rules applied 634 place count 396 transition count 710
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 645 place count 395 transition count 700
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 655 place count 385 transition count 700
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 655 place count 385 transition count 695
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 6 with 15 rules applied. Total rules applied 670 place count 375 transition count 695
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 670 place count 375 transition count 691
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 678 place count 371 transition count 691
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 683 place count 366 transition count 678
Iterating global reduction 6 with 5 rules applied. Total rules applied 688 place count 366 transition count 678
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 688 place count 366 transition count 676
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 692 place count 364 transition count 676
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 695 place count 361 transition count 666
Iterating global reduction 6 with 3 rules applied. Total rules applied 698 place count 361 transition count 666
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 699 place count 360 transition count 658
Iterating global reduction 6 with 1 rules applied. Total rules applied 700 place count 360 transition count 658
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 701 place count 359 transition count 650
Iterating global reduction 6 with 1 rules applied. Total rules applied 702 place count 359 transition count 650
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 703 place count 358 transition count 642
Iterating global reduction 6 with 1 rules applied. Total rules applied 704 place count 358 transition count 642
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 705 place count 357 transition count 634
Iterating global reduction 6 with 1 rules applied. Total rules applied 706 place count 357 transition count 634
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 707 place count 356 transition count 626
Iterating global reduction 6 with 1 rules applied. Total rules applied 708 place count 356 transition count 626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 709 place count 355 transition count 618
Iterating global reduction 6 with 1 rules applied. Total rules applied 710 place count 355 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 711 place count 354 transition count 610
Iterating global reduction 6 with 1 rules applied. Total rules applied 712 place count 354 transition count 610
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 713 place count 353 transition count 602
Iterating global reduction 6 with 1 rules applied. Total rules applied 714 place count 353 transition count 602
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 715 place count 352 transition count 594
Iterating global reduction 6 with 1 rules applied. Total rules applied 716 place count 352 transition count 594
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 717 place count 351 transition count 586
Iterating global reduction 6 with 1 rules applied. Total rules applied 718 place count 351 transition count 586
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 719 place count 350 transition count 578
Iterating global reduction 6 with 1 rules applied. Total rules applied 720 place count 350 transition count 578
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 721 place count 349 transition count 570
Iterating global reduction 6 with 1 rules applied. Total rules applied 722 place count 349 transition count 570
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 723 place count 348 transition count 562
Iterating global reduction 6 with 1 rules applied. Total rules applied 724 place count 348 transition count 562
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 725 place count 347 transition count 554
Iterating global reduction 6 with 1 rules applied. Total rules applied 726 place count 347 transition count 554
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 727 place count 346 transition count 546
Iterating global reduction 6 with 1 rules applied. Total rules applied 728 place count 346 transition count 546
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 850 place count 284 transition count 486
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 854 place count 280 transition count 482
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 859 place count 279 transition count 482
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 860 place count 279 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 861 place count 278 transition count 481
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 861 place count 278 transition count 480
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 863 place count 277 transition count 480
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 865 place count 275 transition count 478
Iterating global reduction 8 with 2 rules applied. Total rules applied 867 place count 275 transition count 478
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 869 place count 275 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 870 place count 274 transition count 476
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 10 with 2 rules applied. Total rules applied 872 place count 273 transition count 481
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 874 place count 273 transition count 479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 876 place count 271 transition count 479
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 877 place count 271 transition count 479
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 878 place count 270 transition count 478
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 11 with 3 rules applied. Total rules applied 881 place count 268 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 882 place count 267 transition count 477
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 3 Pre rules applied. Total rules applied 882 place count 267 transition count 474
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 13 with 7 rules applied. Total rules applied 889 place count 263 transition count 474
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 13 with 2 rules applied. Total rules applied 891 place count 261 transition count 474
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 891 place count 261 transition count 473
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 893 place count 260 transition count 473
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 899 place count 257 transition count 470
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 900 place count 256 transition count 469
Iterating global reduction 14 with 1 rules applied. Total rules applied 901 place count 256 transition count 469
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 902 place count 256 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 903 place count 255 transition count 468
Applied a total of 903 rules in 329 ms. Remains 255 /719 variables (removed 464) and now considering 468/1021 (removed 553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 255/719 places, 468/1021 transitions.
RANDOM walk for 40000 steps (863 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33186 steps (298 resets) in 69 ms. (474 steps per ms) remains 0/1 properties
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
FORMULA ASLink-PT-01b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 26 stabilizing places and 26 stable transitions
FORMULA ASLink-PT-01b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1021/1021 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 713 transition count 1007
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 713 transition count 1007
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 709 transition count 1003
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 709 transition count 1003
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 709 transition count 1002
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 706 transition count 992
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 706 transition count 992
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 704 transition count 990
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 704 transition count 990
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 702 transition count 981
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 702 transition count 981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 701 transition count 973
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 701 transition count 973
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 700 transition count 972
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 700 transition count 972
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 699 transition count 964
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 699 transition count 964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 698 transition count 956
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 698 transition count 956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 697 transition count 955
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 697 transition count 955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 696 transition count 947
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 696 transition count 947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 695 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 695 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 694 transition count 938
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 694 transition count 938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 693 transition count 930
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 693 transition count 930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 692 transition count 922
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 692 transition count 922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 691 transition count 921
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 691 transition count 921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 690 transition count 913
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 690 transition count 913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 689 transition count 905
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 689 transition count 905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 688 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 688 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 687 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 687 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 686 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 686 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 685 transition count 887
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 685 transition count 887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 684 transition count 879
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 684 transition count 879
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 683 transition count 871
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 683 transition count 871
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 682 transition count 870
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 682 transition count 870
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 681 transition count 862
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 681 transition count 862
Applied a total of 77 rules in 416 ms. Remains 681 /719 variables (removed 38) and now considering 862/1021 (removed 159) transitions.
// Phase 1: matrix 862 rows 681 cols
[2025-05-30 00:55:49] [INFO ] Computed 71 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:55:50] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-05-30 00:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:55:51] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Running 861 sub problems to find dead transitions.
[2025-05-30 00:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/1543 variables, and 71 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:39] [INFO ] Deduced a trap composed of 83 places in 293 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:39] [INFO ] Deduced a trap composed of 89 places in 288 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:40] [INFO ] Deduced a trap composed of 86 places in 171 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:40] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:40] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:41] [INFO ] Deduced a trap composed of 58 places in 299 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:41] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:41] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:43] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:43] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:44] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:44] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:44] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:44] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:45] [INFO ] Deduced a trap composed of 68 places in 205 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:45] [INFO ] Deduced a trap composed of 71 places in 621 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:46] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:47] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:47] [INFO ] Deduced a trap composed of 89 places in 253 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:56:48] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/1543 variables, and 91 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 0/861 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in LTL mode, iteration 1 : 681/719 places, 862/1021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62459 ms. Remains : 681/719 places, 862/1021 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 273 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 40 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-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-01b-LTLFireability-00 finished in 63453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (!p1||G(p2)))))'
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1021/1021 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 713 transition count 1007
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 713 transition count 1007
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 710 transition count 1004
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 710 transition count 1004
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 710 transition count 1003
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 708 transition count 1001
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 708 transition count 1001
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 707 transition count 1000
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 707 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 706 transition count 999
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 706 transition count 999
Applied a total of 27 rules in 152 ms. Remains 706 /719 variables (removed 13) and now considering 999/1021 (removed 22) transitions.
// Phase 1: matrix 999 rows 706 cols
[2025-05-30 00:56:52] [INFO ] Computed 71 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:56:53] [INFO ] Implicit Places using invariants in 599 ms returned []
[2025-05-30 00:56:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:56:55] [INFO ] Implicit Places using invariants and state equation in 1568 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
Running 998 sub problems to find dead transitions.
[2025-05-30 00:56:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/705 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 998 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/705 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 998 unsolved
SMT process timed out in 30446ms, After SMT, problems are : Problem set: 0 solved, 998 unsolved
Search for dead transitions found 0 dead transitions in 30457ms
Starting structural reductions in LTL mode, iteration 1 : 706/719 places, 999/1021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32826 ms. Remains : 706/719 places, 999/1021 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 249 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 : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 28 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-01b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-01b-LTLFireability-03 finished in 33695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(X((X(X(p1)) U ((!p2&&X(X(p1)))||X(X(G(p1)))))) U (X(G((X(X(p1)) U ((!p2&&X(X(p1)))||X(X(G(p1)))))))||(!p2&&X((X(X(p1)) U ((!p2&&X(X(p1)))||X(X(G(p1))))))))))))'
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1021/1021 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 713 transition count 1007
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 713 transition count 1007
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 709 transition count 1003
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 709 transition count 1003
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 709 transition count 1002
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 706 transition count 992
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 706 transition count 992
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 704 transition count 990
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 704 transition count 990
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 702 transition count 981
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 702 transition count 981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 701 transition count 973
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 701 transition count 973
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 700 transition count 972
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 700 transition count 972
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 699 transition count 964
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 699 transition count 964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 698 transition count 956
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 698 transition count 956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 697 transition count 955
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 697 transition count 955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 696 transition count 947
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 696 transition count 947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 695 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 695 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 694 transition count 938
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 694 transition count 938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 693 transition count 930
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 693 transition count 930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 692 transition count 922
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 692 transition count 922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 691 transition count 921
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 691 transition count 921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 690 transition count 913
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 690 transition count 913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 689 transition count 905
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 689 transition count 905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 688 transition count 904
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 688 transition count 904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 687 transition count 896
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 687 transition count 896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 686 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 686 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 685 transition count 887
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 685 transition count 887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 684 transition count 879
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 684 transition count 879
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 683 transition count 871
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 683 transition count 871
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 682 transition count 870
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 682 transition count 870
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 681 transition count 862
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 681 transition count 862
Applied a total of 77 rules in 481 ms. Remains 681 /719 variables (removed 38) and now considering 862/1021 (removed 159) transitions.
// Phase 1: matrix 862 rows 681 cols
[2025-05-30 00:57:26] [INFO ] Computed 71 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:57:27] [INFO ] Implicit Places using invariants in 441 ms returned []
[2025-05-30 00:57:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:57:28] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
Running 861 sub problems to find dead transitions.
[2025-05-30 00:57:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/1543 variables, and 71 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:17] [INFO ] Deduced a trap composed of 83 places in 281 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:17] [INFO ] Deduced a trap composed of 89 places in 260 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:18] [INFO ] Deduced a trap composed of 58 places in 296 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:19] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:19] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 89 places in 176 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:21] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:22] [INFO ] Deduced a trap composed of 83 places in 198 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:22] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:23] [INFO ] Deduced a trap composed of 61 places in 269 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:23] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:23] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:24] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:24] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:25] [INFO ] Deduced a trap composed of 89 places in 233 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:58:25] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 861 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 681/1543 variables, and 91 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 0/861 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 681/719 places, 862/1021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62482 ms. Remains : 681/719 places, 862/1021 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-05
Product exploration explored 100000 steps with 20000 reset in 167 ms.
Product exploration explored 100000 steps with 20000 reset in 145 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 : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 111 ms. Reduced automaton from 12 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 7586 steps (43 resets) in 23 ms. (316 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 681 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 681/681 places, 862/862 transitions.
Applied a total of 0 rules in 14 ms. Remains 681 /681 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2025-05-30 00:58:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:58:30] [INFO ] Implicit Places using invariants in 384 ms returned []
[2025-05-30 00:58:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:58:32] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
Running 861 sub problems to find dead transitions.
[2025-05-30 00:58:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/1543 variables, and 71 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:20] [INFO ] Deduced a trap composed of 83 places in 252 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:20] [INFO ] Deduced a trap composed of 89 places in 258 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:21] [INFO ] Deduced a trap composed of 86 places in 162 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:21] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:21] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:22] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:22] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:22] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:24] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:24] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:24] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:25] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:25] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:25] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:26] [INFO ] Deduced a trap composed of 68 places in 211 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:26] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:27] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:27] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:28] [INFO ] Deduced a trap composed of 89 places in 231 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:28] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:32] [INFO ] Deduced a trap composed of 80 places in 273 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:32] [INFO ] Deduced a trap composed of 93 places in 291 ms of which 66 ms to minimize.
SMT process timed out in 60385ms, After SMT, problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Finished structural reductions in LTL mode , in 1 iterations and 62222 ms. Remains : 681/681 places, 862/862 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 2871 steps (20 resets) in 8 ms. (319 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 154 ms.
Product exploration explored 100000 steps with 20000 reset in 164 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 1 out of 681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 681/681 places, 862/862 transitions.
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 681 transition count 862
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 681 transition count 861
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 112 place count 681 transition count 910
Deduced a syphon composed of 234 places in 1 ms
Iterating global reduction 2 with 123 rules applied. Total rules applied 235 place count 681 transition count 910
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 288 place count 628 transition count 857
Deduced a syphon composed of 181 places in 1 ms
Iterating global reduction 2 with 53 rules applied. Total rules applied 341 place count 628 transition count 857
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 341 place count 628 transition count 858
Deduced a syphon composed of 182 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 628 transition count 858
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 2 with 119 rules applied. Total rules applied 461 place count 628 transition count 859
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 516 place count 573 transition count 802
Deduced a syphon composed of 250 places in 1 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 571 place count 573 transition count 802
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 573 place count 571 transition count 799
Deduced a syphon composed of 250 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 575 place count 571 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 577 place count 571 transition count 797
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 260 places in 1 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 587 place count 571 transition count 838
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 592 place count 566 transition count 826
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 597 place count 566 transition count 826
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 256 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 598 place count 566 transition count 828
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 599 place count 565 transition count 826
Deduced a syphon composed of 255 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 600 place count 565 transition count 826
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 600 rules in 333 ms. Remains 565 /681 variables (removed 116) and now considering 826/862 (removed 36) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 00:59:35] [INFO ] Redundant transitions in 64 ms returned []
Running 825 sub problems to find dead transitions.
// Phase 1: matrix 826 rows 565 cols
[2025-05-30 00:59:35] [INFO ] Computed 71 invariants in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 2 (OVERLAPS) 1/565 variables, 17/65 constraints. Problems are: Problem set: 0 solved, 825 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 825 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:02] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:03] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:03] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 21 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:03] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 23 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:03] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:04] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 25 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:04] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 8 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:04] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 11 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:04] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:04] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 14 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:04] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 12 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:05] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 19 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:05] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 16 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:05] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:05] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 17 ms to minimize.
SMT process timed out in 30476ms, After SMT, problems are : Problem set: 48 solved, 777 unsolved
Search for dead transitions found 48 dead transitions in 30479ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 565/681 places, 778/862 transitions.
Graph (complete) has 1826 edges and 565 vertex of which 521 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Discarding 44 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 520 transition count 777
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 520 transition count 777
Deduced a syphon composed of 210 places in 1 ms
Applied a total of 3 rules in 30 ms. Remains 520 /565 variables (removed 45) and now considering 777/778 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 520/681 places, 777/862 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30942 ms. Remains : 520/681 places, 777/862 transitions.
Built C files in :
/tmp/ltsmin9837180436948374532
[2025-05-30 01:00:05] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9837180436948374532
Running compilation step : cd /tmp/ltsmin9837180436948374532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1561 ms.
Running link step : cd /tmp/ltsmin9837180436948374532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin9837180436948374532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6375376678586896973.hoa' '--buchi-type=spotba'
LTSmin run took 298 ms.
FORMULA ASLink-PT-01b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-01b-LTLFireability-05 finished in 161315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((X(X(p0))&&(!p1 U (p2||G(!p1))))||X(X(G(p0))))))'
Support contains 4 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1021/1021 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 714 transition count 1016
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 714 transition count 1016
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 711 transition count 1013
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 711 transition count 1013
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 711 transition count 1012
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 709 transition count 1010
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 709 transition count 1010
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 708 transition count 1009
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 708 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 707 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 707 transition count 1008
Applied a total of 25 rules in 82 ms. Remains 707 /719 variables (removed 12) and now considering 1008/1021 (removed 13) transitions.
// Phase 1: matrix 1008 rows 707 cols
[2025-05-30 01:00:07] [INFO ] Computed 71 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:08] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-05-30 01:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:10] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
Running 1007 sub problems to find dead transitions.
[2025-05-30 01:00:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/1715 variables, and 43 constraints, problems are : Problem set: 0 solved, 1007 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 43/55 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 1007/1007 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1007 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/706 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/706 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 2 (OVERLAPS) 1/707 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/707 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:02] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:02] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:02] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 86 places in 172 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 89 places in 226 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:05] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:05] [INFO ] Deduced a trap composed of 63 places in 284 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:06] [INFO ] Deduced a trap composed of 77 places in 273 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:06] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:06] [INFO ] Deduced a trap composed of 71 places in 250 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:07] [INFO ] Deduced a trap composed of 96 places in 226 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:07] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:08] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:08] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:09] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:09] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:10] [INFO ] Deduced a trap composed of 89 places in 269 ms of which 58 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/1715 variables, and 88 constraints, problems are : Problem set: 0 solved, 1007 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 0/707 constraints, PredecessorRefiner: 0/1007 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 1007 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 707/719 places, 1008/1021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62620 ms. Remains : 707/719 places, 1008/1021 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (NOT p0), true, (AND (NOT p0) (NOT p2) p1), (AND p0 (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLFireability-10 finished in 62953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(p1)))'
Support contains 1 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1021/1021 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 714 transition count 1008
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 714 transition count 1008
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 710 transition count 1004
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 710 transition count 1004
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 710 transition count 1003
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 707 transition count 993
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 707 transition count 993
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 705 transition count 991
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 705 transition count 991
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 703 transition count 982
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 703 transition count 982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 702 transition count 974
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 702 transition count 974
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 701 transition count 973
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 701 transition count 973
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 700 transition count 965
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 700 transition count 965
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 699 transition count 957
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 699 transition count 957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 698 transition count 956
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 698 transition count 956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 697 transition count 948
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 697 transition count 948
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 696 transition count 940
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 696 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 695 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 695 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 694 transition count 931
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 694 transition count 931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 693 transition count 923
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 693 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 692 transition count 922
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 692 transition count 922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 691 transition count 914
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 691 transition count 914
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 690 transition count 906
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 690 transition count 906
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 689 transition count 905
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 689 transition count 905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 688 transition count 897
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 688 transition count 897
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 687 transition count 889
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 687 transition count 889
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 686 transition count 888
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 686 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 685 transition count 880
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 685 transition count 880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 684 transition count 872
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 684 transition count 872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 683 transition count 871
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 683 transition count 871
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 682 transition count 863
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 682 transition count 863
Applied a total of 75 rules in 352 ms. Remains 682 /719 variables (removed 37) and now considering 863/1021 (removed 158) transitions.
// Phase 1: matrix 863 rows 682 cols
[2025-05-30 01:01:10] [INFO ] Computed 71 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:01:11] [INFO ] Implicit Places using invariants in 397 ms returned []
[2025-05-30 01:01:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:01:12] [INFO ] Implicit Places using invariants and state equation in 1365 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
Running 862 sub problems to find dead transitions.
[2025-05-30 01:01:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/681 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/681 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 1/682 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/682 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/1545 variables, and 71 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 0/682 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/681 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/681 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (OVERLAPS) 1/682 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/682 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:00] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:00] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:01] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:01] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:03] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:04] [INFO ] Deduced a trap composed of 83 places in 227 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:04] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:04] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:05] [INFO ] Deduced a trap composed of 83 places in 180 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:05] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:05] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:06] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:06] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:06] [INFO ] Deduced a trap composed of 80 places in 256 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:07] [INFO ] Deduced a trap composed of 89 places in 307 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:07] [INFO ] Deduced a trap composed of 93 places in 262 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:08] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:10] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/682 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 92 places in 224 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/1545 variables, and 93 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 0/682 constraints, PredecessorRefiner: 0/862 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 682/719 places, 863/1021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62315 ms. Remains : 682/719 places, 863/1021 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : ASLink-PT-01b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 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 62525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1)) U (p1||G(!p2)||G(p2))))'
Support contains 6 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 1021/1021 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 715 transition count 1009
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 715 transition count 1009
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 712 transition count 1006
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 712 transition count 1006
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 712 transition count 1005
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 710 transition count 996
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 710 transition count 996
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 708 transition count 994
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 708 transition count 994
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 706 transition count 985
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 706 transition count 985
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 705 transition count 977
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 705 transition count 977
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 704 transition count 976
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 704 transition count 976
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 703 transition count 968
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 703 transition count 968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 702 transition count 960
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 702 transition count 960
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 701 transition count 959
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 701 transition count 959
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 700 transition count 951
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 700 transition count 951
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 699 transition count 943
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 699 transition count 943
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 698 transition count 942
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 698 transition count 942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 697 transition count 934
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 697 transition count 934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 696 transition count 926
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 696 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 695 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 695 transition count 925
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 694 transition count 917
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 694 transition count 917
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 693 transition count 909
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 693 transition count 909
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 692 transition count 908
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 692 transition count 908
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 691 transition count 900
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 691 transition count 900
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 690 transition count 892
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 690 transition count 892
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 689 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 689 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 688 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 688 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 687 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 687 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 686 transition count 874
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 686 transition count 874
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 685 transition count 866
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 685 transition count 866
Applied a total of 69 rules in 325 ms. Remains 685 /719 variables (removed 34) and now considering 866/1021 (removed 155) transitions.
// Phase 1: matrix 866 rows 685 cols
[2025-05-30 01:02:13] [INFO ] Computed 71 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:13] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-05-30 01:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:15] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
Running 865 sub problems to find dead transitions.
[2025-05-30 01:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 685/1551 variables, and 71 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/685 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:04] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:04] [INFO ] Deduced a trap composed of 179 places in 324 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:05] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:05] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:06] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:07] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:07] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:08] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:08] [INFO ] Deduced a trap composed of 91 places in 279 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:09] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:09] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:09] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:10] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:10] [INFO ] Deduced a trap composed of 82 places in 264 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:11] [INFO ] Deduced a trap composed of 89 places in 306 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:11] [INFO ] Deduced a trap composed of 92 places in 296 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:11] [INFO ] Deduced a trap composed of 95 places in 267 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:12] [INFO ] Deduced a trap composed of 133 places in 275 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:12] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:14] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 24 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 30026 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 685/719 places, 866/1021 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62255 ms. Remains : 685/719 places, 866/1021 transitions.
Stuttering acceptance computed with spot in 267 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 2152 steps with 13 reset in 9 ms.
FORMULA ASLink-PT-01b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLFireability-13 finished in 62554 ms.
All properties solved by simple procedures.
Total runtime 460648 ms.

BK_STOP 1748566995700

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-5832"
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 r002-tall-174853729000292"
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.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 ;