Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 940K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 516K 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-05a-LTLCardinality-00
FORMULA_NAME ASLink-PT-05a-LTLCardinality-01
FORMULA_NAME ASLink-PT-05a-LTLCardinality-02
FORMULA_NAME ASLink-PT-05a-LTLCardinality-03
FORMULA_NAME ASLink-PT-05a-LTLCardinality-04
FORMULA_NAME ASLink-PT-05a-LTLCardinality-05
FORMULA_NAME ASLink-PT-05a-LTLCardinality-06
FORMULA_NAME ASLink-PT-05a-LTLCardinality-07
FORMULA_NAME ASLink-PT-05a-LTLCardinality-08
FORMULA_NAME ASLink-PT-05a-LTLCardinality-09
FORMULA_NAME ASLink-PT-05a-LTLCardinality-10
FORMULA_NAME ASLink-PT-05a-LTLCardinality-11
FORMULA_NAME ASLink-PT-05a-LTLCardinality-12
FORMULA_NAME ASLink-PT-05a-LTLCardinality-13
FORMULA_NAME ASLink-PT-05a-LTLCardinality-14
FORMULA_NAME ASLink-PT-05a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748582620135

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-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 05:23:41] [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 05:23:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 05:23:41] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-05-30 05:23:41] [INFO ] Transformed 1211 places.
[2025-05-30 05:23:41] [INFO ] Transformed 1827 transitions.
[2025-05-30 05:23:41] [INFO ] Found NUPN structural information;
[2025-05-30 05:23:41] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 244 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 4 formulas.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
FORMULA ASLink-PT-05a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 1211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1181 transition count 1808
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 1171 transition count 1765
Ensure Unique test removed 1 places
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 1170 transition count 1765
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 1170 transition count 1763
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1169 transition count 1755
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1169 transition count 1755
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1168 transition count 1747
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1168 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1167 transition count 1739
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1167 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1166 transition count 1731
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1166 transition count 1731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1165 transition count 1723
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1165 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1164 transition count 1715
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1164 transition count 1715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1163 transition count 1707
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1163 transition count 1707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1162 transition count 1699
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1162 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1161 transition count 1691
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1161 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1160 transition count 1683
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1160 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1159 transition count 1675
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1159 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1158 transition count 1667
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1158 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1157 transition count 1659
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1157 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1156 transition count 1651
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1156 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1155 transition count 1643
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1155 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1154 transition count 1635
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1154 transition count 1635
Applied a total of 85 rules in 1077 ms. Remains 1154 /1211 variables (removed 57) and now considering 1635/1808 (removed 173) transitions.
// Phase 1: matrix 1635 rows 1154 cols
[2025-05-30 05:23:42] [INFO ] Computed 201 invariants in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:44] [INFO ] Implicit Places using invariants in 1451 ms returned [1, 19, 20, 23, 33, 51, 69, 214, 219, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 597, 615, 633, 762, 778, 783, 784, 785, 803, 821, 950, 955, 967, 972, 973, 974, 992, 994, 997, 1015, 1016, 1017, 1018, 1035, 1043, 1051, 1057, 1063, 1069, 1075, 1083, 1089, 1095, 1103]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1486 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1097/1211 places, 1635/1808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1084 transition count 1622
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1084 transition count 1622
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1074 transition count 1612
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1074 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1069 transition count 1607
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1069 transition count 1607
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1067 transition count 1605
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1067 transition count 1605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1065 transition count 1603
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1065 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1064 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1064 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1063 transition count 1601
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1063 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1062 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1062 transition count 1600
Applied a total of 70 rules in 277 ms. Remains 1062 /1097 variables (removed 35) and now considering 1600/1635 (removed 35) transitions.
// Phase 1: matrix 1600 rows 1062 cols
[2025-05-30 05:23:44] [INFO ] Computed 144 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:45] [INFO ] Implicit Places using invariants in 839 ms returned []
[2025-05-30 05:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:47] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned []
Implicit Place search using SMT with State Equation took 2872 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1062/1211 places, 1600/1808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5727 ms. Remains : 1062/1211 places, 1600/1808 transitions.
Support contains 15 out of 1062 places after structural reductions.
[2025-05-30 05:23:47] [INFO ] Flatten gal took : 142 ms
[2025-05-30 05:23:47] [INFO ] Flatten gal took : 87 ms
[2025-05-30 05:23:48] [INFO ] Input system was already deterministic with 1600 transitions.
RANDOM walk for 40000 steps (249 resets) in 1183 ms. (33 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (35 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (35 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
[2025-05-30 05:23:48] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 439/449 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 613/1062 variables, 108/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1062 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2662 variables, 1062/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2662 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2662 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2662/2662 variables, and 1206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 1062/1062 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 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 439/449 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 613/1062 variables, 108/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1062 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2662 variables, 1062/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2662 variables, 2/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2662 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2662 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2662/2662 variables, and 1208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 1062/1062 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3016ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1294 ms.
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 1062 transition count 1398
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 860 transition count 1398
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 404 place count 860 transition count 1262
Deduced a syphon composed of 136 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 317 rules applied. Total rules applied 721 place count 679 transition count 1262
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 22 rules applied. Total rules applied 743 place count 670 transition count 1249
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 756 place count 657 transition count 1249
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 756 place count 657 transition count 1233
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 788 place count 641 transition count 1233
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 793 place count 636 transition count 1228
Iterating global reduction 4 with 5 rules applied. Total rules applied 798 place count 636 transition count 1228
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 802 place count 636 transition count 1224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 803 place count 635 transition count 1224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 803 place count 635 transition count 1223
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 805 place count 634 transition count 1223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 4 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 923 place count 575 transition count 1164
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 928 place count 575 transition count 1159
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 933 place count 570 transition count 1159
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 955 place count 570 transition count 1137
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 978 place count 547 transition count 1137
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 982 place count 547 transition count 1133
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 998 place count 547 transition count 1133
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 1000 place count 547 transition count 1133
Applied a total of 1000 rules in 357 ms. Remains 547 /1062 variables (removed 515) and now considering 1133/1600 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 547/1062 places, 1133/1600 transitions.
RANDOM walk for 40000 steps (573 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (110 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 504210 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :1 out of 2
Probabilistic random walk after 504210 steps, saw 112584 distinct states, run finished after 3005 ms. (steps per millisecond=167 ) properties seen :1
// Phase 1: matrix 1133 rows 547 cols
[2025-05-30 05:23:56] [INFO ] Computed 89 invariants in 12 ms
[2025-05-30 05:23:56] [INFO ] State equation strengthened by 30 read => feed constraints.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/130 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/493 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/547 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1133/1680 variables, 547/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1680 variables, 30/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1680 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1680 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1680/1680 variables, and 666 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 547/547 constraints, ReadFeed: 30/30 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 45.0 s and query timeout 4500.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) 24/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/130 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/493 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/547 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1133/1680 variables, 547/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1680 variables, 30/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1680 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1680 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1680 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1680/1680 variables, and 667 constraints, problems are : Problem set: 0 solved, 1 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 547/547 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1133ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1133/1133 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 546 transition count 1132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 540 transition count 1132
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 7 place count 540 transition count 1118
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 40 place count 521 transition count 1118
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 516 transition count 1113
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 516 transition count 1113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 55 place count 516 transition count 1108
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 516 transition count 1107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 515 transition count 1107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 515 transition count 1106
Applied a total of 58 rules in 95 ms. Remains 515 /547 variables (removed 32) and now considering 1106/1133 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 515/547 places, 1106/1133 transitions.
RANDOM walk for 40000 steps (680 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (151 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1925 steps, run visited all 1 properties in 7 ms. (steps per millisecond=275 )
Probabilistic random walk after 1925 steps, saw 1817 distinct states, run finished after 11 ms. (steps per millisecond=175 ) properties seen :1
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)&&(F(p1)||X(G(p2))))))'
Support contains 5 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 28 ms. Remains 1062 /1062 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
// Phase 1: matrix 1600 rows 1062 cols
[2025-05-30 05:23:58] [INFO ] Computed 144 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:58] [INFO ] Implicit Places using invariants in 617 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 619 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1061/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 29 ms. Remains 1061 /1061 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 678 ms. Remains : 1061/1062 places, 1600/1600 transitions.
Stuttering acceptance computed with spot in 345 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-01
Product exploration explored 100000 steps with 603 reset in 351 ms.
Product exploration explored 100000 steps with 624 reset in 309 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 p0 p1 p2), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (234 resets) in 390 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (40 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 306745 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 306745 steps, saw 115326 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
// Phase 1: matrix 1600 rows 1061 cols
[2025-05-30 05:24:03] [INFO ] Computed 143 invariants in 17 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) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 484/492 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 569/1061 variables, 106/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2661 variables, 1061/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2661 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2661 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2661/2661 variables, and 1204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1061/1061 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) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 484/492 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 569/1061 variables, 106/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2661 variables, 1061/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2661 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2661 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2661 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2661/2661 variables, and 1205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1061/1061 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 159 ms.
Support contains 2 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1061 transition count 1395
Reduce places removed 205 places and 0 transitions.
Iterating post reduction 1 with 205 rules applied. Total rules applied 410 place count 856 transition count 1395
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 410 place count 856 transition count 1254
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 2 with 327 rules applied. Total rules applied 737 place count 670 transition count 1254
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 2 with 18 rules applied. Total rules applied 755 place count 661 transition count 1245
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 764 place count 652 transition count 1245
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 764 place count 652 transition count 1225
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 804 place count 632 transition count 1225
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 809 place count 627 transition count 1220
Iterating global reduction 4 with 5 rules applied. Total rules applied 814 place count 627 transition count 1220
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 818 place count 627 transition count 1216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 819 place count 626 transition count 1216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 819 place count 626 transition count 1215
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 821 place count 625 transition count 1215
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 939 place count 566 transition count 1156
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 944 place count 566 transition count 1151
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 949 place count 561 transition count 1151
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 970 place count 561 transition count 1130
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 992 place count 539 transition count 1130
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 997 place count 539 transition count 1125
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1013 place count 539 transition count 1125
Applied a total of 1013 rules in 197 ms. Remains 539 /1061 variables (removed 522) and now considering 1125/1600 (removed 475) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 539/1061 places, 1125/1600 transitions.
RANDOM walk for 40000 steps (585 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (117 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6062 steps, run visited all 1 properties in 20 ms. (steps per millisecond=303 )
Probabilistic random walk after 6062 steps, saw 5698 distinct states, run finished after 20 ms. (steps per millisecond=303 ) properties seen :1
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 11 factoid took 146 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-05a-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLCardinality-01 finished in 7633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((X(X(p0))&&(p1 U (p2||G(p1))))||X(X(G(p0))))))'
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 32 ms. Remains 1062 /1062 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
// Phase 1: matrix 1600 rows 1062 cols
[2025-05-30 05:24:05] [INFO ] Computed 144 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:06] [INFO ] Implicit Places using invariants in 669 ms returned [191]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 671 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1061/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 29 ms. Remains 1061 /1061 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 733 ms. Remains : 1061/1062 places, 1600/1600 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-02
Product exploration explored 100000 steps with 25009 reset in 523 ms.
Product exploration explored 100000 steps with 24997 reset in 539 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 p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) p1)), (X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 141 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (229 resets) in 260 ms. (153 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (39 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
// Phase 1: matrix 1600 rows 1061 cols
[2025-05-30 05:24:08] [INFO ] Computed 143 invariants in 13 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) 132/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/566 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/1061 variables, 101/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2661 variables, 1061/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2661 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2661 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2661/2661 variables, and 1204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1061/1061 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) 132/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/566 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/1061 variables, 101/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2661 variables, 1061/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2661 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2661 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2661 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2661/2661 variables, and 1205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1061/1061 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1717ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 1061 transition count 1396
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 857 transition count 1396
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 135 Pre rules applied. Total rules applied 408 place count 857 transition count 1261
Deduced a syphon composed of 135 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 315 rules applied. Total rules applied 723 place count 677 transition count 1261
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 22 rules applied. Total rules applied 745 place count 668 transition count 1248
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 758 place count 655 transition count 1248
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 758 place count 655 transition count 1232
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 790 place count 639 transition count 1232
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 795 place count 634 transition count 1227
Iterating global reduction 4 with 5 rules applied. Total rules applied 800 place count 634 transition count 1227
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 804 place count 634 transition count 1223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 805 place count 633 transition count 1223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 805 place count 633 transition count 1222
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 807 place count 632 transition count 1222
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 927 place count 572 transition count 1162
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 932 place count 572 transition count 1157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 937 place count 567 transition count 1157
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 958 place count 567 transition count 1136
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 980 place count 545 transition count 1136
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 984 place count 545 transition count 1132
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1000 place count 545 transition count 1132
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 1002 place count 545 transition count 1132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1003 place count 544 transition count 1131
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1009 place count 538 transition count 1131
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1009 place count 538 transition count 1117
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 33 rules applied. Total rules applied 1042 place count 519 transition count 1117
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1047 place count 514 transition count 1112
Iterating global reduction 9 with 5 rules applied. Total rules applied 1052 place count 514 transition count 1112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1057 place count 514 transition count 1107
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1058 place count 514 transition count 1106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1059 place count 513 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1060 place count 513 transition count 1105
Applied a total of 1060 rules in 253 ms. Remains 513 /1061 variables (removed 548) and now considering 1105/1600 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 513/1061 places, 1105/1600 transitions.
RANDOM walk for 40000 steps (657 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (144 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1925 steps, run visited all 1 properties in 7 ms. (steps per millisecond=275 )
Probabilistic random walk after 1925 steps, saw 1817 distinct states, run finished after 7 ms. (steps per millisecond=275 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) p1)), (X (AND (NOT p2) p1 p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p0))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 19 factoid took 495 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 336 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 1061 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1061/1061 places, 1600/1600 transitions.
Applied a total of 0 rules in 33 ms. Remains 1061 /1061 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2025-05-30 05:24:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:12] [INFO ] Implicit Places using invariants in 671 ms returned []
[2025-05-30 05:24:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:14] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2821 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2025-05-30 05:24:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/2661 variables, and 98 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 98/106 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2661 variables, and 98 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 98/106 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 0/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 60631ms
Finished structural reductions in LTL mode , in 1 iterations and 63498 ms. Remains : 1061/1061 places, 1600/1600 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (AND p1 (NOT p2) p0)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 168 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (250 resets) in 144 ms. (275 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (34 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2025-05-30 05:25:15] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/566 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/1061 variables, 101/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2661 variables, 1061/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2661 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2661 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2661/2661 variables, and 1204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1061/1061 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) 132/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 432/566 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/1061 variables, 101/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1061 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1600/2661 variables, 1061/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2661 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2661 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2661 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2661/2661 variables, and 1205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 1061/1061 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1935ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 2 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 1061 transition count 1396
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 857 transition count 1396
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 135 Pre rules applied. Total rules applied 408 place count 857 transition count 1261
Deduced a syphon composed of 135 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 315 rules applied. Total rules applied 723 place count 677 transition count 1261
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 2 with 22 rules applied. Total rules applied 745 place count 668 transition count 1248
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 758 place count 655 transition count 1248
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 758 place count 655 transition count 1232
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 790 place count 639 transition count 1232
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 795 place count 634 transition count 1227
Iterating global reduction 4 with 5 rules applied. Total rules applied 800 place count 634 transition count 1227
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 804 place count 634 transition count 1223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 805 place count 633 transition count 1223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 805 place count 633 transition count 1222
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 807 place count 632 transition count 1222
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 927 place count 572 transition count 1162
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 932 place count 572 transition count 1157
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 937 place count 567 transition count 1157
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 958 place count 567 transition count 1136
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 980 place count 545 transition count 1136
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 984 place count 545 transition count 1132
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1000 place count 545 transition count 1132
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 1002 place count 545 transition count 1132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1003 place count 544 transition count 1131
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1009 place count 538 transition count 1131
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 1009 place count 538 transition count 1117
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 33 rules applied. Total rules applied 1042 place count 519 transition count 1117
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1047 place count 514 transition count 1112
Iterating global reduction 9 with 5 rules applied. Total rules applied 1052 place count 514 transition count 1112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1057 place count 514 transition count 1107
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1058 place count 514 transition count 1106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1059 place count 513 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1060 place count 513 transition count 1105
Applied a total of 1060 rules in 231 ms. Remains 513 /1061 variables (removed 548) and now considering 1105/1600 (removed 495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 513/1061 places, 1105/1600 transitions.
RANDOM walk for 40000 steps (634 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (132 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1925 steps, run visited all 1 properties in 9 ms. (steps per millisecond=213 )
Probabilistic random walk after 1925 steps, saw 1817 distinct states, run finished after 9 ms. (steps per millisecond=213 ) properties seen :1
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (AND p1 (NOT p2) p0)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X (AND p1 (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p0))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p2), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 19 factoid took 472 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 336 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25102 reset in 428 ms.
Product exploration explored 100000 steps with 24989 reset in 439 ms.
Applying partial POR strategy [false, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 1061 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1061/1061 places, 1600/1600 transitions.
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1061 transition count 1600
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 75 Pre rules applied. Total rules applied 201 place count 1061 transition count 1621
Deduced a syphon composed of 276 places in 2 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 276 place count 1061 transition count 1621
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 283 place count 1057 transition count 1621
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 316 place count 1024 transition count 1588
Deduced a syphon composed of 248 places in 3 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 349 place count 1024 transition count 1588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 349 place count 1024 transition count 1588
Deduced a syphon composed of 249 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 350 place count 1024 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 351 place count 1023 transition count 1587
Deduced a syphon composed of 248 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 1023 transition count 1587
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 374 places in 2 ms
Iterating global reduction 2 with 126 rules applied. Total rules applied 478 place count 1023 transition count 1605
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 540 place count 961 transition count 1543
Deduced a syphon composed of 312 places in 2 ms
Iterating global reduction 2 with 62 rules applied. Total rules applied 602 place count 961 transition count 1543
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 317 places in 2 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 607 place count 961 transition count 1575
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 318 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 608 place count 961 transition count 1579
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 610 place count 959 transition count 1573
Deduced a syphon composed of 316 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 612 place count 959 transition count 1573
Deduced a syphon composed of 316 places in 2 ms
Applied a total of 612 rules in 437 ms. Remains 959 /1061 variables (removed 102) and now considering 1573/1600 (removed 27) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 05:25:21] [INFO ] Redundant transitions in 108 ms returned []
Running 1572 sub problems to find dead transitions.
// Phase 1: matrix 1573 rows 959 cols
[2025-05-30 05:25:21] [INFO ] Computed 139 invariants in 14 ms
[2025-05-30 05:25:21] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/2532 variables, and 95 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 95/102 constraints, State Equation: 0/959 constraints, ReadFeed: 0/23 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 95/95 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 958/2532 variables, and 95 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 95/102 constraints, State Equation: 0/959 constraints, ReadFeed: 0/23 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60549ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Starting structural reductions in SI_LTL mode, iteration 1 : 959/1061 places, 1573/1600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61114 ms. Remains : 959/1061 places, 1573/1600 transitions.
Built C files in :
/tmp/ltsmin7455718808146125867
[2025-05-30 05:26:22] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7455718808146125867
Running compilation step : cd /tmp/ltsmin7455718808146125867;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7455718808146125867;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7455718808146125867;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1061 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1061/1061 places, 1600/1600 transitions.
Applied a total of 0 rules in 28 ms. Remains 1061 /1061 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
// Phase 1: matrix 1600 rows 1061 cols
[2025-05-30 05:26:25] [INFO ] Computed 143 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:25] [INFO ] Implicit Places using invariants in 672 ms returned []
[2025-05-30 05:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:28] [INFO ] Implicit Places using invariants and state equation in 2092 ms returned []
Implicit Place search using SMT with State Equation took 2766 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2025-05-30 05:26:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/2661 variables, and 98 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 98/106 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2661 variables, and 98 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 98/106 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 0/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 60468ms
Finished structural reductions in LTL mode , in 1 iterations and 63267 ms. Remains : 1061/1061 places, 1600/1600 transitions.
Built C files in :
/tmp/ltsmin14046881824972064942
[2025-05-30 05:27:28] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14046881824972064942
Running compilation step : cd /tmp/ltsmin14046881824972064942;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14046881824972064942;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14046881824972064942;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 05:27:31] [INFO ] Flatten gal took : 60 ms
[2025-05-30 05:27:31] [INFO ] Flatten gal took : 59 ms
[2025-05-30 05:27:31] [INFO ] Time to serialize gal into /tmp/LTL12631977372906814695.gal : 16 ms
[2025-05-30 05:27:31] [INFO ] Time to serialize properties into /tmp/LTL4438242316512559802.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12631977372906814695.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16364887677351621733.hoa' '-atoms' '/tmp/LTL4438242316512559802.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...319
Loading property file /tmp/LTL4438242316512559802.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16364887677351621733.hoa
Detected timeout of ITS tools.
[2025-05-30 05:27:46] [INFO ] Flatten gal took : 54 ms
[2025-05-30 05:27:47] [INFO ] Flatten gal took : 51 ms
[2025-05-30 05:27:47] [INFO ] Time to serialize gal into /tmp/LTL9921571205306704952.gal : 9 ms
[2025-05-30 05:27:47] [INFO ] Time to serialize properties into /tmp/LTL10982580725698752468.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9921571205306704952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10982580725698752468.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 : !(((X(X("((p749==0)||(p228==1))")))U((X(X(G("((p749==0)||(p228==1))"))))||((X(X("((p749==0)||(p228==1))")))&&(("(p936!=1)")U(("((p220=...196
Formula 0 simplified : XX!"((p749==0)||(p228==1))" R (XXF!"((p749==0)||(p228==1))" & (XX!"((p749==0)||(p228==1))" | (!"(p936!=1)" M !"((p220==1)&&(p936!=1)...160
Detected timeout of ITS tools.
[2025-05-30 05:28:02] [INFO ] Flatten gal took : 46 ms
[2025-05-30 05:28:02] [INFO ] Applying decomposition
[2025-05-30 05:28:02] [INFO ] Flatten gal took : 47 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/graph17451700041633509350.txt' '-o' '/tmp/graph17451700041633509350.bin' '-w' '/tmp/graph17451700041633509350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17451700041633509350.bin' '-l' '-1' '-v' '-w' '/tmp/graph17451700041633509350.weights' '-q' '0' '-e' '0.001'
[2025-05-30 05:28:02] [INFO ] Decomposing Gal with order
[2025-05-30 05:28:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:28:02] [INFO ] Removed a total of 2187 redundant transitions.
[2025-05-30 05:28:02] [INFO ] Flatten gal took : 158 ms
[2025-05-30 05:28:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 35 ms.
[2025-05-30 05:28:02] [INFO ] Time to serialize gal into /tmp/LTL3880954468400284188.gal : 18 ms
[2025-05-30 05:28:02] [INFO ] Time to serialize properties into /tmp/LTL4298064249095506499.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/LTL3880954468400284188.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4298064249095506499.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...254
Read 1 LTL properties
Checking formula 0 : !(((X(X("((i10.i0.u211.p749==0)||(i0.i4.u63.p228==1))")))U((X(X(G("((i10.i0.u211.p749==0)||(i0.i4.u63.p228==1))"))))||((X(X("((i10.i0....308
Formula 0 simplified : XX!"((i10.i0.u211.p749==0)||(i0.i4.u63.p228==1))" R (XXF!"((i10.i0.u211.p749==0)||(i0.i4.u63.p228==1))" & (XX!"((i10.i0.u211.p749==0...260
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05a-LTLCardinality-02 finished in 252147 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||X(F((p1&&F(p2)))))))'
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 35 ms. Remains 1062 /1062 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
// Phase 1: matrix 1600 rows 1062 cols
[2025-05-30 05:28:17] [INFO ] Computed 144 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:18] [INFO ] Implicit Places using invariants in 675 ms returned [191, 211]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 677 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 33 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 745 ms. Remains : 1060/1062 places, 1600/1600 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-07
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-07 finished in 941 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(F(p0)))))'
Support contains 2 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 34 ms. Remains 1062 /1062 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
[2025-05-30 05:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:19] [INFO ] Implicit Places using invariants in 660 ms returned [191, 211]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 662 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1062 places, 1600/1600 transitions.
Applied a total of 0 rules in 31 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 727 ms. Remains : 1060/1062 places, 1600/1600 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-12
Product exploration explored 100000 steps with 762 reset in 262 ms.
Product exploration explored 100000 steps with 724 reset in 288 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 81 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2597 steps (15 resets) in 13 ms. (185 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1059 transition count 1394
Reduce places removed 209 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 213 rules applied. Total rules applied 418 place count 850 transition count 1390
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 424 place count 846 transition count 1388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 427 place count 843 transition count 1388
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 149 Pre rules applied. Total rules applied 427 place count 843 transition count 1239
Deduced a syphon composed of 149 places in 1 ms
Ensure Unique test removed 44 places
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 769 place count 650 transition count 1239
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 34 rules applied. Total rules applied 803 place count 635 transition count 1220
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 822 place count 616 transition count 1220
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 822 place count 616 transition count 1200
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 862 place count 596 transition count 1200
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 872 place count 586 transition count 1190
Iterating global reduction 6 with 10 rules applied. Total rules applied 882 place count 586 transition count 1190
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 891 place count 586 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 892 place count 585 transition count 1181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 892 place count 585 transition count 1180
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 894 place count 584 transition count 1180
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 110 rules applied. Total rules applied 1004 place count 529 transition count 1125
Applied a total of 1004 rules in 88 ms. Remains 529 /1060 variables (removed 531) and now considering 1125/1600 (removed 475) transitions.
// Phase 1: matrix 1125 rows 529 cols
[2025-05-30 05:28:20] [INFO ] Computed 78 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:21] [INFO ] Implicit Places using invariants in 384 ms returned [72, 90, 96, 101, 160, 177, 183, 188, 190, 250, 267, 273, 278, 280, 340, 357, 363, 371, 373, 433, 450, 456, 461, 463, 526]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 385 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1060 places, 1125/1600 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 504 transition count 1124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 503 transition count 1124
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 494 transition count 1115
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 494 transition count 1115
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 485 transition count 1106
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 485 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 480 transition count 1101
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 480 transition count 1101
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 470 transition count 1091
Applied a total of 68 rules in 66 ms. Remains 470 /504 variables (removed 34) and now considering 1091/1125 (removed 34) transitions.
// Phase 1: matrix 1091 rows 470 cols
[2025-05-30 05:28:21] [INFO ] Computed 53 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:21] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-05-30 05:28:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:22] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 470/1060 places, 1091/1600 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1665 ms. Remains : 470/1060 places, 1091/1600 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 120 steps (2 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1704 reset in 209 ms.
Product exploration explored 100000 steps with 1660 reset in 222 ms.
Built C files in :
/tmp/ltsmin16876764289603020606
[2025-05-30 05:28:23] [INFO ] Computing symmetric may disable matrix : 1091 transitions.
[2025-05-30 05:28:23] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:28:23] [INFO ] Computing symmetric may enable matrix : 1091 transitions.
[2025-05-30 05:28:23] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:28:23] [INFO ] Computing Do-Not-Accords matrix : 1091 transitions.
[2025-05-30 05:28:23] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:28:23] [INFO ] Built C files in 295ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16876764289603020606
Running compilation step : cd /tmp/ltsmin16876764289603020606;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16876764289603020606;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16876764289603020606;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 1091/1091 transitions.
Applied a total of 0 rules in 20 ms. Remains 470 /470 variables (removed 0) and now considering 1091/1091 (removed 0) transitions.
[2025-05-30 05:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:26] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-05-30 05:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:27] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 05:28:27] [INFO ] Redundant transitions in 15 ms returned []
Running 1060 sub problems to find dead transitions.
[2025-05-30 05:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/469 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1060 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 1060 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31516 ms. Remains : 470/470 places, 1091/1091 transitions.
Built C files in :
/tmp/ltsmin9178976763211577431
[2025-05-30 05:28:58] [INFO ] Computing symmetric may disable matrix : 1091 transitions.
[2025-05-30 05:28:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:28:58] [INFO ] Computing symmetric may enable matrix : 1091 transitions.
[2025-05-30 05:28:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:28:58] [INFO ] Computing Do-Not-Accords matrix : 1091 transitions.
[2025-05-30 05:28:58] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:28:58] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9178976763211577431
Running compilation step : cd /tmp/ltsmin9178976763211577431;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9178976763211577431;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9178976763211577431;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 05:29:01] [INFO ] Flatten gal took : 32 ms
[2025-05-30 05:29:01] [INFO ] Flatten gal took : 33 ms
[2025-05-30 05:29:01] [INFO ] Time to serialize gal into /tmp/LTL8043345156827009295.gal : 6 ms
[2025-05-30 05:29:01] [INFO ] Time to serialize properties into /tmp/LTL6603193830623416303.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/LTL8043345156827009295.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12882190957867899473.hoa' '-atoms' '/tmp/LTL6603193830623416303.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/LTL6603193830623416303.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12882190957867899473.hoa
Detected timeout of ITS tools.
[2025-05-30 05:29:16] [INFO ] Flatten gal took : 31 ms
[2025-05-30 05:29:16] [INFO ] Flatten gal took : 31 ms
[2025-05-30 05:29:16] [INFO ] Time to serialize gal into /tmp/LTL12629515362575717742.gal : 6 ms
[2025-05-30 05:29:16] [INFO ] Time to serialize properties into /tmp/LTL13907582293202246585.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/LTL12629515362575717742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13907582293202246585.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...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p767==0)||(p95==1))")))&&("((p767==0)||(p95==1))"))))
Formula 0 simplified : X(!"((p767==0)||(p95==1))" | FG!"((p767==0)||(p95==1))")
Detected timeout of ITS tools.
[2025-05-30 05:29:31] [INFO ] Flatten gal took : 32 ms
[2025-05-30 05:29:31] [INFO ] Applying decomposition
[2025-05-30 05:29:31] [INFO ] Flatten gal took : 33 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/graph13164630708047261330.txt' '-o' '/tmp/graph13164630708047261330.bin' '-w' '/tmp/graph13164630708047261330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13164630708047261330.bin' '-l' '-1' '-v' '-w' '/tmp/graph13164630708047261330.weights' '-q' '0' '-e' '0.001'
[2025-05-30 05:29:31] [INFO ] Decomposing Gal with order
[2025-05-30 05:29:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:29:31] [INFO ] Removed a total of 2172 redundant transitions.
[2025-05-30 05:29:31] [INFO ] Flatten gal took : 63 ms
[2025-05-30 05:29:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 17 ms.
[2025-05-30 05:29:32] [INFO ] Time to serialize gal into /tmp/LTL12215240793257175684.gal : 7 ms
[2025-05-30 05:29:32] [INFO ] Time to serialize properties into /tmp/LTL1707892521883702242.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/LTL12215240793257175684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1707892521883702242.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...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i7.u81.p767==0)||(i1.u23.p95==1))")))&&("((i7.u81.p767==0)||(i1.u23.p95==1))"))))
Formula 0 simplified : X(!"((i7.u81.p767==0)||(i1.u23.p95==1))" | FG!"((i7.u81.p767==0)||(i1.u23.p95==1))")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-05a-LTLCardinality-12 finished in 88365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((X(X(p0))&&(p1 U (p2||G(p1))))||X(X(G(p0))))))'
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(F(p0)))))'
[2025-05-30 05:29:47] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17839832968690858660
[2025-05-30 05:29:47] [INFO ] Too many transitions (1600) to apply POR reductions. Disabling POR matrices.
[2025-05-30 05:29:47] [INFO ] Applying decomposition
[2025-05-30 05:29:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17839832968690858660
Running compilation step : cd /tmp/ltsmin17839832968690858660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-05-30 05:29:47] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17175562996320643977.txt' '-o' '/tmp/graph17175562996320643977.bin' '-w' '/tmp/graph17175562996320643977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17175562996320643977.bin' '-l' '-1' '-v' '-w' '/tmp/graph17175562996320643977.weights' '-q' '0' '-e' '0.001'
[2025-05-30 05:29:47] [INFO ] Decomposing Gal with order
[2025-05-30 05:29:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:29:47] [INFO ] Removed a total of 2171 redundant transitions.
[2025-05-30 05:29:47] [INFO ] Flatten gal took : 74 ms
[2025-05-30 05:29:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 12 ms.
[2025-05-30 05:29:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality14169834296648457990.gal : 24 ms
[2025-05-30 05:29:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality18445002477325033413.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/LTLCardinality14169834296648457990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18445002477325033413.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...278
Read 2 LTL properties
Checking formula 0 : !(((X(X("((i12.i1.u213.p749==0)||(i3.i1.u63.p228==1))")))U(((X(X("((i12.i1.u213.p749==0)||(i3.i1.u63.p228==1))")))&&(("(i14.i0.u261.p9...308
Formula 0 simplified : XX!"((i12.i1.u213.p749==0)||(i3.i1.u63.p228==1))" R (XXF!"((i12.i1.u213.p749==0)||(i3.i1.u63.p228==1))" & (XX!"((i12.i1.u213.p749==0...260
Compilation finished in 3101 ms.
Running link step : cd /tmp/ltsmin17839832968690858660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17839832968690858660;'/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' '--ltl' '(X(X((LTLAPp0==true))) U ((X(X((LTLAPp0==true)))&&((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))||X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 115188 ms.
FORMULA ASLink-PT-05a-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17839832968690858660;'/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' '--ltl' 'X(((LTLAPp3==true)&&[](<>((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 414644 ms.
FORMULA ASLink-PT-05a-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 899188 ms.

BK_STOP 1748583520578

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-05a"
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-05a, 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-174853729100347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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