Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729100331.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-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729100331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 436K 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-04a-LTLCardinality-00
FORMULA_NAME ASLink-PT-04a-LTLCardinality-01
FORMULA_NAME ASLink-PT-04a-LTLCardinality-02
FORMULA_NAME ASLink-PT-04a-LTLCardinality-03
FORMULA_NAME ASLink-PT-04a-LTLCardinality-04
FORMULA_NAME ASLink-PT-04a-LTLCardinality-05
FORMULA_NAME ASLink-PT-04a-LTLCardinality-06
FORMULA_NAME ASLink-PT-04a-LTLCardinality-07
FORMULA_NAME ASLink-PT-04a-LTLCardinality-08
FORMULA_NAME ASLink-PT-04a-LTLCardinality-09
FORMULA_NAME ASLink-PT-04a-LTLCardinality-10
FORMULA_NAME ASLink-PT-04a-LTLCardinality-11
FORMULA_NAME ASLink-PT-04a-LTLCardinality-12
FORMULA_NAME ASLink-PT-04a-LTLCardinality-13
FORMULA_NAME ASLink-PT-04a-LTLCardinality-14
FORMULA_NAME ASLink-PT-04a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748576933147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 03:48:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 03:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:48:54] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-05-30 03:48:54] [INFO ] Transformed 1016 places.
[2025-05-30 03:48:54] [INFO ] Transformed 1554 transitions.
[2025-05-30 03:48:54] [INFO ] Found NUPN structural information;
[2025-05-30 03:48:54] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 992 transition count 1538
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 983 transition count 1501
Ensure Unique test removed 1 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 982 transition count 1501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 982 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 981 transition count 1491
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 981 transition count 1491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 980 transition count 1483
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 980 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 979 transition count 1475
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 979 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 978 transition count 1467
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 978 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 977 transition count 1459
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 977 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 976 transition count 1451
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 976 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 975 transition count 1443
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 975 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 974 transition count 1435
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 974 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 973 transition count 1427
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 973 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 972 transition count 1419
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 972 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 971 transition count 1411
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 971 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 970 transition count 1403
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 970 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 969 transition count 1395
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 969 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 968 transition count 1387
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 968 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 967 transition count 1379
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 967 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 966 transition count 1371
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 966 transition count 1371
Applied a total of 77 rules in 738 ms. Remains 966 /1016 variables (removed 50) and now considering 1371/1538 (removed 167) transitions.
// Phase 1: matrix 1371 rows 966 cols
[2025-05-30 03:48:55] [INFO ] Computed 169 invariants in 90 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:48:56] [INFO ] Implicit Places using invariants in 1060 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 445, 574, 590, 595, 596, 597, 615, 633, 762, 767, 779, 784, 785, 786, 804, 806, 809, 827, 828, 829, 830, 847, 855, 863, 869, 875, 881, 887, 895, 901, 907, 915]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 1096 ms to find 51 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 915/1016 places, 1371/1538 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 902 transition count 1358
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 902 transition count 1358
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 893 transition count 1349
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 893 transition count 1349
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 888 transition count 1344
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 888 transition count 1344
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 886 transition count 1342
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 886 transition count 1342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 884 transition count 1340
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 884 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 883 transition count 1339
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 883 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 882 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 882 transition count 1338
Applied a total of 66 rules in 150 ms. Remains 882 /915 variables (removed 33) and now considering 1338/1371 (removed 33) transitions.
// Phase 1: matrix 1338 rows 882 cols
[2025-05-30 03:48:56] [INFO ] Computed 118 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:48:57] [INFO ] Implicit Places using invariants in 559 ms returned []
[2025-05-30 03:48:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:48:59] [INFO ] Implicit Places using invariants and state equation in 2085 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 882/1016 places, 1338/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4647 ms. Remains : 882/1016 places, 1338/1538 transitions.
Support contains 29 out of 882 places after structural reductions.
[2025-05-30 03:48:59] [INFO ] Flatten gal took : 131 ms
[2025-05-30 03:48:59] [INFO ] Flatten gal took : 83 ms
[2025-05-30 03:48:59] [INFO ] Input system was already deterministic with 1338 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (299 resets) in 1109 ms. (36 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40001 steps (50 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 106 ms. (373 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (49 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
[2025-05-30 03:49:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 154/163 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 225/388 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 494/882 variables, 91/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1338/2220 variables, 882/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2220 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2220 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 1000 constraints, problems are : Problem set: 0 solved, 4 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 882/882 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 154/163 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 225/388 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 494/882 variables, 91/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1338/2220 variables, 882/1000 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2220 variables, 4/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2220 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2220 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 1004 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3815 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 882/882 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4792ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2047 ms.
Support contains 9 out of 882 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 882 transition count 1180
Reduce places removed 158 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 159 rules applied. Total rules applied 317 place count 724 transition count 1179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 318 place count 723 transition count 1179
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 318 place count 723 transition count 1067
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 35 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 259 rules applied. Total rules applied 577 place count 576 transition count 1067
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 595 place count 567 transition count 1058
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 604 place count 558 transition count 1058
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 604 place count 558 transition count 1043
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 634 place count 543 transition count 1043
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 640 place count 537 transition count 1037
Iterating global reduction 5 with 6 rules applied. Total rules applied 646 place count 537 transition count 1037
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 650 place count 537 transition count 1033
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 651 place count 536 transition count 1033
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 651 place count 536 transition count 1032
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 653 place count 535 transition count 1032
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 759 place count 482 transition count 979
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 763 place count 482 transition count 975
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 767 place count 478 transition count 975
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 8 with 16 rules applied. Total rules applied 783 place count 478 transition count 959
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 800 place count 461 transition count 959
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 803 place count 461 transition count 956
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 813 place count 461 transition count 956
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 815 place count 461 transition count 956
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 816 place count 461 transition count 955
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 817 place count 460 transition count 954
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 821 place count 456 transition count 954
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 821 place count 456 transition count 947
Deduced a syphon composed of 7 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 17 rules applied. Total rules applied 838 place count 446 transition count 947
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 841 place count 443 transition count 944
Iterating global reduction 10 with 3 rules applied. Total rules applied 844 place count 443 transition count 944
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 847 place count 443 transition count 941
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 848 place count 443 transition count 940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 849 place count 442 transition count 940
Applied a total of 849 rules in 337 ms. Remains 442 /882 variables (removed 440) and now considering 940/1338 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 442/882 places, 940/1338 transitions.
RANDOM walk for 40000 steps (725 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (188 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (178 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (184 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (183 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 532929 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :2 out of 4
Probabilistic random walk after 532929 steps, saw 117269 distinct states, run finished after 3005 ms. (steps per millisecond=177 ) properties seen :2
// Phase 1: matrix 940 rows 442 cols
[2025-05-30 03:49:10] [INFO ] Computed 66 invariants in 12 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/75 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 149/224 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/243 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 146/389 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/395 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/396 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/442 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 940/1382 variables, 442/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1382 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1382 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1382/1382 variables, and 508 constraints, problems are : Problem set: 0 solved, 2 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 61/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/75 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 149/224 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/243 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 146/389 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/395 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/396 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/442 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 940/1382 variables, 442/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1382 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1382 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1382 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1382/1382 variables, and 510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1136ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 284 ms.
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 939
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 441 transition count 939
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 441 transition count 938
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 440 transition count 938
Applied a total of 4 rules in 27 ms. Remains 440 /442 variables (removed 2) and now considering 938/940 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 440/442 places, 938/940 transitions.
RANDOM walk for 40000 steps (694 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (181 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (187 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 535839 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 2
Probabilistic random walk after 535839 steps, saw 117776 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
// Phase 1: matrix 938 rows 440 cols
[2025-05-30 03:49:15] [INFO ] Computed 66 invariants in 16 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/84 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/261 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/295 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 131/426 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/431 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/440 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 938/1378 variables, 440/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1378 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1378/1378 variables, and 506 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 79/84 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/93 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/261 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/295 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 131/426 variables, 27/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/431 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/432 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/440 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 938/1378 variables, 440/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1378 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1378 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1378 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1378/1378 variables, and 508 constraints, problems are : Problem set: 0 solved, 2 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1153ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 374 ms.
Support contains 5 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 938/938 transitions.
Applied a total of 0 rules in 23 ms. Remains 440 /440 variables (removed 0) and now considering 938/938 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 440/440 places, 938/938 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 938/938 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2025-05-30 03:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:17] [INFO ] Implicit Places using invariants in 365 ms returned [71, 88, 94, 97, 99, 100, 105, 106, 158, 167, 178, 184, 187, 191, 196, 197, 215, 272, 280, 286, 289, 290, 295, 296, 348, 365, 371, 374, 376, 377]
[2025-05-30 03:49:17] [INFO ] Actually due to overlaps returned [191, 290, 377, 215, 88, 94, 99, 178, 184, 365, 371, 376, 71, 100, 158, 167, 187, 272, 280, 286, 289, 348]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 368 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 418/440 places, 938/938 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 418 transition count 934
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 414 transition count 934
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 22 place count 400 transition count 920
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 400 transition count 920
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 395 transition count 915
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 395 transition count 915
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 394 transition count 914
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 394 transition count 914
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 68 place count 384 transition count 904
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 384 transition count 903
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 80 place count 384 transition count 892
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 91 place count 373 transition count 892
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 373 transition count 889
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 370 transition count 889
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 370 transition count 889
Applied a total of 98 rules in 116 ms. Remains 370 /418 variables (removed 48) and now considering 889/938 (removed 49) transitions.
// Phase 1: matrix 889 rows 370 cols
[2025-05-30 03:49:17] [INFO ] Computed 44 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:17] [INFO ] Implicit Places using invariants in 270 ms returned [88, 89, 165, 166, 241, 242]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 272 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 364/440 places, 889/938 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 889/889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 784 ms. Remains : 364/440 places, 889/938 transitions.
RANDOM walk for 40000 steps (718 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (210 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (217 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 424392 steps, run visited all 2 properties in 2282 ms. (steps per millisecond=185 )
Probabilistic random walk after 424392 steps, saw 256707 distinct states, run finished after 2286 ms. (steps per millisecond=185 ) properties seen :2
Computed a total of 1 stabilizing places and 1 stable transitions
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(G(p0)))'
Support contains 2 out of 882 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 881 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 880 transition count 1336
Applied a total of 4 rules in 64 ms. Remains 880 /882 variables (removed 2) and now considering 1336/1338 (removed 2) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2025-05-30 03:49:20] [INFO ] Computed 118 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:21] [INFO ] Implicit Places using invariants in 546 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 547 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/882 places, 1336/1338 transitions.
Applied a total of 0 rules in 22 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 879/882 places, 1336/1338 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-03
Product exploration explored 100000 steps with 690 reset in 323 ms.
Product exploration explored 100000 steps with 727 reset in 277 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (300 resets) in 367 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (56 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 379162 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 379162 steps, saw 134847 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
// Phase 1: matrix 1336 rows 879 cols
[2025-05-30 03:49:25] [INFO ] Computed 117 invariants in 18 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/477 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 402/879 variables, 80/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1336/2215 variables, 879/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2215 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2215 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2215/2215 variables, and 996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 879/879 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/477 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 402/879 variables, 80/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:49:26] [INFO ] Deduced a trap composed of 91 places in 196 ms of which 43 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/879 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1336/2215 variables, 879/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2215 variables, 1/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2215 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2215 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2215/2215 variables, and 998 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1763 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 879/879 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2358ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 879/879 places, 1336/1336 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 170 place count 879 transition count 1166
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 1 with 170 rules applied. Total rules applied 340 place count 709 transition count 1166
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 340 place count 709 transition count 1051
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 607 place count 557 transition count 1051
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 17 rules applied. Total rules applied 624 place count 549 transition count 1042
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 633 place count 540 transition count 1042
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 633 place count 540 transition count 1026
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 665 place count 524 transition count 1026
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 670 place count 519 transition count 1021
Iterating global reduction 4 with 5 rules applied. Total rules applied 675 place count 519 transition count 1021
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 679 place count 519 transition count 1017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 680 place count 518 transition count 1017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 680 place count 518 transition count 1016
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 682 place count 517 transition count 1016
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 784 place count 466 transition count 965
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 788 place count 466 transition count 961
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 792 place count 462 transition count 961
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 808 place count 462 transition count 945
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 825 place count 445 transition count 945
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 829 place count 445 transition count 941
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 842 place count 445 transition count 941
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 843 place count 444 transition count 940
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 847 place count 440 transition count 940
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 847 place count 440 transition count 932
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 867 place count 428 transition count 932
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 871 place count 424 transition count 928
Iterating global reduction 9 with 4 rules applied. Total rules applied 875 place count 424 transition count 928
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 879 place count 424 transition count 924
Applied a total of 879 rules in 157 ms. Remains 424 /879 variables (removed 455) and now considering 924/1336 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 424/879 places, 924/1336 transitions.
RANDOM walk for 40000 steps (711 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (192 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1020 steps, run visited all 1 properties in 6 ms. (steps per millisecond=170 )
Probabilistic random walk after 1020 steps, saw 955 distinct states, run finished after 6 ms. (steps per millisecond=170 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-04a-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-04a-LTLCardinality-03 finished in 7504 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' '!(G(F(p0)))'
Support contains 4 out of 882 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 881 transition count 1177
Reduce places removed 163 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 166 rules applied. Total rules applied 326 place count 718 transition count 1174
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 330 place count 715 transition count 1173
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 3 with 3 rules applied. Total rules applied 333 place count 713 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 712 transition count 1172
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 121 Pre rules applied. Total rules applied 334 place count 712 transition count 1051
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 37 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 5 with 279 rules applied. Total rules applied 613 place count 554 transition count 1051
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 5 with 27 rules applied. Total rules applied 640 place count 542 transition count 1036
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 655 place count 527 transition count 1036
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 655 place count 527 transition count 1019
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 689 place count 510 transition count 1019
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 698 place count 501 transition count 1010
Iterating global reduction 7 with 9 rules applied. Total rules applied 707 place count 501 transition count 1010
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 714 place count 501 transition count 1003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 715 place count 500 transition count 1003
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 715 place count 500 transition count 1002
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 717 place count 499 transition count 1002
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 9 with 98 rules applied. Total rules applied 815 place count 450 transition count 953
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 817 place count 450 transition count 953
Applied a total of 817 rules in 113 ms. Remains 450 /882 variables (removed 432) and now considering 953/1338 (removed 385) transitions.
// Phase 1: matrix 953 rows 450 cols
[2025-05-30 03:49:28] [INFO ] Computed 65 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:28] [INFO ] Implicit Places using invariants in 329 ms returned [72, 89, 95, 100, 159, 176, 182, 190, 216, 274, 282, 288, 294, 354, 371, 377, 382, 384, 447]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 330 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 431/882 places, 953/1338 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 431 transition count 948
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 426 transition count 948
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 17 place count 419 transition count 941
Iterating global reduction 2 with 7 rules applied. Total rules applied 24 place count 419 transition count 941
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 31 place count 412 transition count 934
Iterating global reduction 2 with 7 rules applied. Total rules applied 38 place count 412 transition count 934
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 408 transition count 930
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 408 transition count 930
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 66 place count 398 transition count 920
Applied a total of 66 rules in 84 ms. Remains 398 /431 variables (removed 33) and now considering 920/953 (removed 33) transitions.
// Phase 1: matrix 920 rows 398 cols
[2025-05-30 03:49:28] [INFO ] Computed 46 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:28] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-05-30 03:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:29] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 398/882 places, 920/1338 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1548 ms. Remains : 398/882 places, 920/1338 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-06
Product exploration explored 100000 steps with 1588 reset in 176 ms.
Product exploration explored 100000 steps with 1592 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (625 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (166 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 489583 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 489583 steps, saw 285065 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2025-05-30 03:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/100 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/104 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/109 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 224/333 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/339 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/398 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 920/1318 variables, 398/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/100 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:49:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/109 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 224/333 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/339 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 59/398 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 920/1318 variables, 398/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1318 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1318 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1318 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 446 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 770ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 920/920 transitions.
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 398 transition count 905
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 34 place count 383 transition count 901
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 383 transition count 889
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 58 place count 371 transition count 889
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 371 transition count 889
Applied a total of 60 rules in 49 ms. Remains 371 /398 variables (removed 27) and now considering 889/920 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 371/398 places, 889/920 transitions.
RANDOM walk for 40000 steps (738 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (204 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11346 steps, run visited all 1 properties in 77 ms. (steps per millisecond=147 )
Probabilistic random walk after 11346 steps, saw 7767 distinct states, run finished after 77 ms. (steps per millisecond=147 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 transitions.
Applied a total of 0 rules in 20 ms. Remains 398 /398 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2025-05-30 03:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:34] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-05-30 03:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:49:35] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:49:35] [INFO ] Redundant transitions in 53 ms returned []
Running 894 sub problems to find dead transitions.
[2025-05-30 03:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 1/398 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:50:02] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1318 variables, and 47 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 1/398 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:50:20] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:50:29] [INFO ] Deduced a trap composed of 98 places in 238 ms of which 57 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1318 variables, and 49 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 0/894 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61432 ms. Remains : 398/398 places, 920/920 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (604 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (169 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 491540 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 491540 steps, saw 286629 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2025-05-30 03:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/100 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/104 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/109 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 224/333 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/339 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/398 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 920/1318 variables, 398/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1318 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/100 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:50:39] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/109 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 224/333 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/339 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 59/398 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 920/1318 variables, 398/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1318 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1318 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1318 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 446 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 790ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 920/920 transitions.
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 398 transition count 905
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 34 place count 383 transition count 901
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 383 transition count 889
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 58 place count 371 transition count 889
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 371 transition count 889
Applied a total of 60 rules in 52 ms. Remains 371 /398 variables (removed 27) and now considering 889/920 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 371/398 places, 889/920 transitions.
RANDOM walk for 40000 steps (750 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (216 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11346 steps, run visited all 1 properties in 89 ms. (steps per millisecond=127 )
Probabilistic random walk after 11346 steps, saw 7767 distinct states, run finished after 89 ms. (steps per millisecond=127 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1581 reset in 193 ms.
Product exploration explored 100000 steps with 1601 reset in 188 ms.
Built C files in :
/tmp/ltsmin9117123111934220688
[2025-05-30 03:50:40] [INFO ] Computing symmetric may disable matrix : 920 transitions.
[2025-05-30 03:50:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:50:40] [INFO ] Computing symmetric may enable matrix : 920 transitions.
[2025-05-30 03:50:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:50:40] [INFO ] Computing Do-Not-Accords matrix : 920 transitions.
[2025-05-30 03:50:41] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:50:41] [INFO ] Built C files in 215ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9117123111934220688
Running compilation step : cd /tmp/ltsmin9117123111934220688;'/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 2695 ms.
Running link step : cd /tmp/ltsmin9117123111934220688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin9117123111934220688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15105006430596771543.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 920/920 transitions.
Applied a total of 0 rules in 10 ms. Remains 398 /398 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2025-05-30 03:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:50:56] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-05-30 03:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:50:56] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:50:57] [INFO ] Redundant transitions in 138 ms returned []
Running 894 sub problems to find dead transitions.
[2025-05-30 03:50:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 1/398 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:51:23] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 41 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1318 variables, and 47 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 3 (OVERLAPS) 1/398 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:51:41] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:51:50] [INFO ] Deduced a trap composed of 98 places in 241 ms of which 57 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1318 variables, and 49 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/398 constraints, PredecessorRefiner: 0/894 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60296ms problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61438 ms. Remains : 398/398 places, 920/920 transitions.
Built C files in :
/tmp/ltsmin17226914056487928977
[2025-05-30 03:51:57] [INFO ] Computing symmetric may disable matrix : 920 transitions.
[2025-05-30 03:51:57] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:51:57] [INFO ] Computing symmetric may enable matrix : 920 transitions.
[2025-05-30 03:51:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:51:57] [INFO ] Computing Do-Not-Accords matrix : 920 transitions.
[2025-05-30 03:51:57] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:51:57] [INFO ] Built C files in 188ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17226914056487928977
Running compilation step : cd /tmp/ltsmin17226914056487928977;'/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 2637 ms.
Running link step : cd /tmp/ltsmin17226914056487928977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17226914056487928977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4828697316902766014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 03:52:12] [INFO ] Flatten gal took : 44 ms
[2025-05-30 03:52:12] [INFO ] Flatten gal took : 45 ms
[2025-05-30 03:52:12] [INFO ] Time to serialize gal into /tmp/LTL11192294875433852856.gal : 7 ms
[2025-05-30 03:52:12] [INFO ] Time to serialize properties into /tmp/LTL8253136869932182605.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11192294875433852856.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8562735088319508021.hoa' '-atoms' '/tmp/LTL8253136869932182605.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8253136869932182605.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8562735088319508021.hoa
Detected timeout of ITS tools.
[2025-05-30 03:52:27] [INFO ] Flatten gal took : 36 ms
[2025-05-30 03:52:27] [INFO ] Flatten gal took : 35 ms
[2025-05-30 03:52:27] [INFO ] Time to serialize gal into /tmp/LTL3916492615424640315.gal : 8 ms
[2025-05-30 03:52:27] [INFO ] Time to serialize properties into /tmp/LTL10099704607630884148.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3916492615424640315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10099704607630884148.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p863==0)||(p373==1))||((p587==0)||(p500==1)))"))))
Formula 0 simplified : FG!"(((p863==0)||(p373==1))||((p587==0)||(p500==1)))"
Detected timeout of ITS tools.
[2025-05-30 03:52:42] [INFO ] Flatten gal took : 30 ms
[2025-05-30 03:52:42] [INFO ] Applying decomposition
[2025-05-30 03:52:42] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10597901170834064750.txt' '-o' '/tmp/graph10597901170834064750.bin' '-w' '/tmp/graph10597901170834064750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10597901170834064750.bin' '-l' '-1' '-v' '-w' '/tmp/graph10597901170834064750.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:52:43] [INFO ] Decomposing Gal with order
[2025-05-30 03:52:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:52:43] [INFO ] Removed a total of 1821 redundant transitions.
[2025-05-30 03:52:43] [INFO ] Flatten gal took : 105 ms
[2025-05-30 03:52:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 23 ms.
[2025-05-30 03:52:43] [INFO ] Time to serialize gal into /tmp/LTL12892111948446382669.gal : 10 ms
[2025-05-30 03:52:43] [INFO ] Time to serialize properties into /tmp/LTL16486751976162800690.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12892111948446382669.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16486751976162800690.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i8.u100.p863==0)||(i4.u46.p373==1))||((i5.u66.p587==0)||(i7.u64.p500==1)))"))))
Formula 0 simplified : FG!"(((i8.u100.p863==0)||(i4.u46.p373==1))||((i5.u66.p587==0)||(i7.u64.p500==1)))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04a-LTLCardinality-06 finished in 210394 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(X(F(p0))))&&(F(!p0) U (F(p1) U p2))))'
Support contains 6 out of 882 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 881 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 880 transition count 1336
Applied a total of 4 rules in 51 ms. Remains 880 /882 variables (removed 2) and now considering 1336/1338 (removed 2) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2025-05-30 03:52:58] [INFO ] Computed 118 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:52:58] [INFO ] Implicit Places using invariants in 534 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 535 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/882 places, 1336/1338 transitions.
Applied a total of 0 rules in 15 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 602 ms. Remains : 879/882 places, 1336/1338 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p1) p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 437 ms.
Product exploration explored 100000 steps with 25000 reset in 348 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p2), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (295 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8775 steps, run visited all 1 properties in 45 ms. (steps per millisecond=195 )
Probabilistic random walk after 8775 steps, saw 7065 distinct states, run finished after 45 ms. (steps per millisecond=195 ) properties seen :1
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p2), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 151 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 879 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 879/879 places, 1336/1336 transitions.
Applied a total of 0 rules in 18 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
// Phase 1: matrix 1336 rows 879 cols
[2025-05-30 03:53:00] [INFO ] Computed 117 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:53:01] [INFO ] Implicit Places using invariants in 542 ms returned []
[2025-05-30 03:53:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:53:02] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
Running 1335 sub problems to find dead transitions.
[2025-05-30 03:53:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/878 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 16.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 11.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 6.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 12.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 5.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 2.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 3.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 2.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 878/2215 variables, and 79 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 79/87 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/878 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 878/2215 variables, and 79 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, Generalized P Invariants (flows): 79/87 constraints, State Equation: 0/879 constraints, PredecessorRefiner: 0/1335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 1335 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Finished structural reductions in LTL mode , in 1 iterations and 62296 ms. Remains : 879/879 places, 1336/1336 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (273 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (54 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8775 steps, run visited all 1 properties in 45 ms. (steps per millisecond=195 )
Probabilistic random walk after 8775 steps, saw 7065 distinct states, run finished after 46 ms. (steps per millisecond=190 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 331 ms.
Product exploration explored 100000 steps with 25000 reset in 338 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 879 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 879/879 places, 1336/1336 transitions.
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 879 transition count 1336
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 63 Pre rules applied. Total rules applied 168 place count 879 transition count 1357
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 231 place count 879 transition count 1357
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 237 place count 876 transition count 1357
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 264 place count 849 transition count 1330
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 291 place count 849 transition count 1330
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 291 place count 849 transition count 1330
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 292 place count 849 transition count 1330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 293 place count 848 transition count 1329
Deduced a syphon composed of 209 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 848 transition count 1329
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 2 with 111 rules applied. Total rules applied 405 place count 848 transition count 1344
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 460 place count 793 transition count 1289
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 515 place count 793 transition count 1289
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 270 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 520 place count 793 transition count 1321
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 271 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 521 place count 793 transition count 1325
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 523 place count 791 transition count 1319
Deduced a syphon composed of 269 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 525 place count 791 transition count 1319
Deduced a syphon composed of 269 places in 1 ms
Applied a total of 525 rules in 285 ms. Remains 791 /879 variables (removed 88) and now considering 1319/1336 (removed 17) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:54:05] [INFO ] Redundant transitions in 22 ms returned []
Running 1318 sub problems to find dead transitions.
// Phase 1: matrix 1319 rows 791 cols
[2025-05-30 03:54:05] [INFO ] Computed 114 invariants in 13 ms
[2025-05-30 03:54:05] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/2110 variables, and 78 constraints, problems are : Problem set: 0 solved, 1318 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 78/81 constraints, State Equation: 0/791 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1318/1318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1318 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/790 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1318 unsolved
SMT process timed out in 60370ms, After SMT, problems are : Problem set: 0 solved, 1318 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Starting structural reductions in SI_LTL mode, iteration 1 : 791/879 places, 1319/1336 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60695 ms. Remains : 791/879 places, 1319/1336 transitions.
Built C files in :
/tmp/ltsmin15955565255541152220
[2025-05-30 03:55:05] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15955565255541152220
Running compilation step : cd /tmp/ltsmin15955565255541152220;'/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 2371 ms.
Running link step : cd /tmp/ltsmin15955565255541152220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15955565255541152220;'/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/stateBased5313304053868157904.hoa' '--buchi-type=spotba'
LTSmin run took 370 ms.
FORMULA ASLink-PT-04a-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-04a-LTLCardinality-07 finished in 130318 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 G(p1)) U p0))'
Support contains 3 out of 882 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 881 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 881 transition count 1337
Applied a total of 2 rules in 56 ms. Remains 881 /882 variables (removed 1) and now considering 1337/1338 (removed 1) transitions.
// Phase 1: matrix 1337 rows 881 cols
[2025-05-30 03:55:08] [INFO ] Computed 118 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:09] [INFO ] Implicit Places using invariants in 532 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 535 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 880/882 places, 1337/1338 transitions.
Applied a total of 0 rules in 16 ms. Remains 880 /880 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 607 ms. Remains : 880/882 places, 1337/1338 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 25362 steps with 4593 reset in 92 ms.
FORMULA ASLink-PT-04a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-10 finished in 973 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' '!(((G(p1)||p0) U G(!p1)))'
Support contains 2 out of 882 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 881 transition count 1178
Reduce places removed 163 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 167 rules applied. Total rules applied 326 place count 718 transition count 1174
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 331 place count 714 transition count 1173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 713 transition count 1173
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 332 place count 713 transition count 1051
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 612 place count 555 transition count 1051
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 642 place count 542 transition count 1034
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 659 place count 525 transition count 1034
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 659 place count 525 transition count 1018
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 691 place count 509 transition count 1018
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 701 place count 499 transition count 1008
Iterating global reduction 6 with 10 rules applied. Total rules applied 711 place count 499 transition count 1008
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 6 with 8 rules applied. Total rules applied 719 place count 499 transition count 1000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 720 place count 498 transition count 1000
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 720 place count 498 transition count 999
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 722 place count 497 transition count 999
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 8 with 100 rules applied. Total rules applied 822 place count 447 transition count 949
Applied a total of 822 rules in 61 ms. Remains 447 /882 variables (removed 435) and now considering 949/1338 (removed 389) transitions.
// Phase 1: matrix 949 rows 447 cols
[2025-05-30 03:55:09] [INFO ] Computed 65 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:09] [INFO ] Implicit Places using invariants in 305 ms returned [72, 89, 95, 103, 162, 180, 186, 191, 193, 219, 254, 275, 283, 289, 291, 351, 368, 374, 379, 381, 444]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 308 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/882 places, 949/1338 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 426 transition count 944
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 421 transition count 944
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 17 place count 414 transition count 937
Iterating global reduction 2 with 7 rules applied. Total rules applied 24 place count 414 transition count 937
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 31 place count 407 transition count 930
Iterating global reduction 2 with 7 rules applied. Total rules applied 38 place count 407 transition count 930
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 403 transition count 926
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 403 transition count 926
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 392 transition count 915
Applied a total of 68 rules in 42 ms. Remains 392 /426 variables (removed 34) and now considering 915/949 (removed 34) transitions.
// Phase 1: matrix 915 rows 392 cols
[2025-05-30 03:55:10] [INFO ] Computed 44 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:10] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-05-30 03:55:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:11] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/882 places, 915/1338 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1494 ms. Remains : 392/882 places, 915/1338 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, (NOT p1), p1, true]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-11
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-11 finished in 1640 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' '!(F(G((X(X(X(F(p1))))||p0))))'
Support contains 4 out of 882 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 881 transition count 1180
Reduce places removed 161 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 165 rules applied. Total rules applied 322 place count 720 transition count 1176
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 328 place count 716 transition count 1174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 330 place count 714 transition count 1174
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 330 place count 714 transition count 1052
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 281 rules applied. Total rules applied 611 place count 555 transition count 1052
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 29 rules applied. Total rules applied 640 place count 542 transition count 1036
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 656 place count 526 transition count 1036
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 656 place count 526 transition count 1019
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 690 place count 509 transition count 1019
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 700 place count 499 transition count 1009
Iterating global reduction 6 with 10 rules applied. Total rules applied 710 place count 499 transition count 1009
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 6 with 7 rules applied. Total rules applied 717 place count 499 transition count 1002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 718 place count 498 transition count 1002
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 718 place count 498 transition count 1001
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 720 place count 497 transition count 1001
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 816 place count 449 transition count 953
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 818 place count 449 transition count 953
Applied a total of 818 rules in 74 ms. Remains 449 /882 variables (removed 433) and now considering 953/1338 (removed 385) transitions.
// Phase 1: matrix 953 rows 449 cols
[2025-05-30 03:55:11] [INFO ] Computed 64 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:11] [INFO ] Implicit Places using invariants in 313 ms returned [72, 90, 96, 101, 160, 177, 183, 188, 190, 216, 251, 272, 280, 286, 288, 348, 366, 372, 377, 381, 445]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 315 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/882 places, 953/1338 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 428 transition count 948
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 423 transition count 948
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 18 place count 415 transition count 940
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 415 transition count 940
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 34 place count 407 transition count 932
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 407 transition count 932
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 403 transition count 928
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 403 transition count 928
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 392 transition count 917
Applied a total of 72 rules in 41 ms. Remains 392 /428 variables (removed 36) and now considering 917/953 (removed 36) transitions.
// Phase 1: matrix 917 rows 392 cols
[2025-05-30 03:55:11] [INFO ] Computed 43 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:11] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-05-30 03:55:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:12] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 392/882 places, 917/1338 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1371 ms. Remains : 392/882 places, 917/1338 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-12
Product exploration explored 100000 steps with 1610 reset in 208 ms.
Stack based approach found an accepted trace after 27939 steps with 434 reset with depth 58 and stack size 58 in 62 ms.
FORMULA ASLink-PT-04a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-12 finished in 1731 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&&G(p1)&&X(X(G(p2))))))'
Support contains 6 out of 882 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Applied a total of 0 rules in 20 ms. Remains 882 /882 variables (removed 0) and now considering 1338/1338 (removed 0) transitions.
// Phase 1: matrix 1338 rows 882 cols
[2025-05-30 03:55:12] [INFO ] Computed 118 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:13] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-05-30 03:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:15] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 2609 ms to find 0 implicit places.
Running 1337 sub problems to find dead transitions.
[2025-05-30 03:55: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/881 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/2220 variables, and 85 constraints, problems are : Problem set: 0 solved, 1337 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 85/91 constraints, State Equation: 0/882 constraints, PredecessorRefiner: 1337/1337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 1337 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 16)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 11)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 7)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 8)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 12)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 2)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 3)
(s201 1)
(s202 1)
(s203 1)
(s204 2)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 16)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 8)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 18)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 7)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 5)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 2)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 3)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 3)
(s382 1)
(s383 2)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 0)
(s411 0)
(s412 1)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 16)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 11)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 7)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 5)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 2)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 2)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 3)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 0)
(s592 1)
(s593 0)
(s594 1)
(s595 0)
(s596 1)
(s597 0)
(s598 1)
(s599 1)
(s600 1)
(s601 0)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 9)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 11)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 7)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 6)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 10)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 32)
(s729 1)
(s730 16)
(s731 1)
(s732 1)
(s733 16)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 0)
(s739 1)
(s740 1)
(s741 1)
(s742 0)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 10)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 0)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 881/2220 variables, and 85 constraints, problems are : Problem set: 0 solved, 1337 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 85/91 constraints, State Equation: 0/882 constraints, PredecessorRefiner: 0/1337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 1337 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in LTL mode , in 1 iterations and 62981 ms. Remains : 882/882 places, 1338/1338 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-13 finished in 63219 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&&F(G(p1)))))'
Support contains 3 out of 882 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 882/882 places, 1338/1338 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 881 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 880 transition count 1336
Applied a total of 4 rules in 54 ms. Remains 880 /882 variables (removed 2) and now considering 1336/1338 (removed 2) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2025-05-30 03:56:16] [INFO ] Computed 118 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:16] [INFO ] Implicit Places using invariants in 549 ms returned [408]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 550 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/882 places, 1336/1338 transitions.
Applied a total of 0 rules in 18 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 623 ms. Remains : 879/882 places, 1336/1338 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLCardinality-15
Stuttering criterion allowed to conclude after 430 steps with 1 reset in 3 ms.
FORMULA ASLink-PT-04a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLCardinality-15 finished in 772 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' '!(G(F(p0)))'
[2025-05-30 03:56:17] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17134704498233838908
[2025-05-30 03:56:17] [INFO ] Computing symmetric may disable matrix : 1338 transitions.
[2025-05-30 03:56:17] [INFO ] Applying decomposition
[2025-05-30 03:56:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:56:17] [INFO ] Computing symmetric may enable matrix : 1338 transitions.
[2025-05-30 03:56:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:56:17] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17645523419724478874.txt' '-o' '/tmp/graph17645523419724478874.bin' '-w' '/tmp/graph17645523419724478874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17645523419724478874.bin' '-l' '-1' '-v' '-w' '/tmp/graph17645523419724478874.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:56:17] [INFO ] Decomposing Gal with order
[2025-05-30 03:56:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:56:17] [INFO ] Removed a total of 1831 redundant transitions.
[2025-05-30 03:56:17] [INFO ] Flatten gal took : 78 ms
[2025-05-30 03:56:17] [INFO ] Computing Do-Not-Accords matrix : 1338 transitions.
[2025-05-30 03:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 22 ms.
[2025-05-30 03:56:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality1896589310086477066.gal : 10 ms
[2025-05-30 03:56:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality3521633712057818981.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1896589310086477066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3521633712057818981.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
[2025-05-30 03:56:17] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:56:17] [INFO ] Built C files in 370ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17134704498233838908
Running compilation step : cd /tmp/ltsmin17134704498233838908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((G(F("(((i16.i1.u238.p863==0)||(i6.i0.u82.p373==1))||((i11.u171.p587==0)||(i7.u143.p500==1)))"))))
Formula 0 simplified : FG!"(((i16.i1.u238.p863==0)||(i6.i0.u82.p373==1))||((i11.u171.p587==0)||(i7.u143.p500==1)))"
Compilation finished in 4674 ms.
Running link step : cd /tmp/ltsmin17134704498233838908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin17134704498233838908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 04:18:44] [INFO ] Applying decomposition
[2025-05-30 04:18:44] [INFO ] Flatten gal took : 104 ms
[2025-05-30 04:18:44] [INFO ] Decomposing Gal with order
[2025-05-30 04:18:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:18:45] [INFO ] Removed a total of 1519 redundant transitions.
[2025-05-30 04:18:45] [INFO ] Flatten gal took : 246 ms
[2025-05-30 04:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 562 labels/synchronizations in 82 ms.
[2025-05-30 04:18:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality7149370862080601238.gal : 27 ms
[2025-05-30 04:18:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality9566130038700069238.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7149370862080601238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9566130038700069238.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u145.p863==0)||(i13.i7.u211.p373==1))||((i21.u100.p587==0)||(i21.i1.u189.p500==1)))"))))
Formula 0 simplified : FG!"(((u145.p863==0)||(i13.i7.u211.p373==1))||((i21.u100.p587==0)||(i21.i1.u189.p500==1)))"
Reverse transition relation is NOT exact ! Due to transitions t798, t995, t1000, t1001, t1004, t1009, t1021, t1030, t1083, t1106, t1159, t1182, t1232, t125...722
Computing Next relation with stutter on 1.48321e+11 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
19899 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,199.07,2429400,1,0,5.8782e+06,13612,2576,5.4549e+06,517,58340,7228441
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-04a-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2263391 ms.

BK_STOP 1748579197804

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-04a"
export BK_EXAMINATION="LTLCardinality"
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-04a, examination is LTLCardinality"
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-174853729100331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;