About the Execution of ITS-Tools for FunctionPointer-PT-c032
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ?F??T??T?T?T??T? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400146.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 FunctionPointer-PT-c032, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c032-CTLFireability-2023-12
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2023-13
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2023-14
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2023-15
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-00
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-01
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-02
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-03
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-04
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-05
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-06
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-07
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-08
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-09
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-10
FORMULA_NAME FunctionPointer-PT-c032-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748866521233
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 12:15:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 12:15:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:15:24] [INFO ] Load time of PNML (sax parser for PT used): 990 ms
[2025-06-02 12:15:25] [INFO ] Transformed 2826 places.
[2025-06-02 12:15:25] [INFO ] Transformed 8960 transitions.
[2025-06-02 12:15:25] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1253 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 1198 places in 74 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 291 places :
Symmetric choice reduction at 1 with 291 rule applications. Total rules 308 place count 1320 transition count 3798
Iterating global reduction 1 with 291 rules applied. Total rules applied 599 place count 1320 transition count 3798
Ensure Unique test removed 426 transitions
Reduce isomorphic transitions removed 426 transitions.
Iterating post reduction 1 with 426 rules applied. Total rules applied 1025 place count 1320 transition count 3372
Discarding 146 places :
Symmetric choice reduction at 2 with 146 rule applications. Total rules 1171 place count 1174 transition count 3080
Iterating global reduction 2 with 146 rules applied. Total rules applied 1317 place count 1174 transition count 3080
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 1413 place count 1174 transition count 2984
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1427 place count 1160 transition count 2956
Iterating global reduction 3 with 14 rules applied. Total rules applied 1441 place count 1160 transition count 2956
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1455 place count 1146 transition count 2928
Iterating global reduction 3 with 14 rules applied. Total rules applied 1469 place count 1146 transition count 2928
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1483 place count 1132 transition count 2900
Iterating global reduction 3 with 14 rules applied. Total rules applied 1497 place count 1132 transition count 2900
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1511 place count 1118 transition count 2872
Iterating global reduction 3 with 14 rules applied. Total rules applied 1525 place count 1118 transition count 2872
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1539 place count 1104 transition count 2844
Iterating global reduction 3 with 14 rules applied. Total rules applied 1553 place count 1104 transition count 2844
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1566 place count 1091 transition count 2818
Iterating global reduction 3 with 13 rules applied. Total rules applied 1579 place count 1091 transition count 2818
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1592 place count 1078 transition count 2792
Iterating global reduction 3 with 13 rules applied. Total rules applied 1605 place count 1078 transition count 2792
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1648 place count 1035 transition count 2634
Iterating global reduction 3 with 43 rules applied. Total rules applied 1691 place count 1035 transition count 2634
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1738 place count 988 transition count 2446
Iterating global reduction 3 with 47 rules applied. Total rules applied 1785 place count 988 transition count 2446
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 1830 place count 943 transition count 2332
Iterating global reduction 3 with 45 rules applied. Total rules applied 1875 place count 943 transition count 2332
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1919 place count 899 transition count 2244
Iterating global reduction 3 with 44 rules applied. Total rules applied 1963 place count 899 transition count 2244
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2007 place count 855 transition count 2156
Iterating global reduction 3 with 44 rules applied. Total rules applied 2051 place count 855 transition count 2156
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 2095 place count 811 transition count 2068
Iterating global reduction 3 with 44 rules applied. Total rules applied 2139 place count 811 transition count 2068
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2181 place count 769 transition count 1984
Iterating global reduction 3 with 42 rules applied. Total rules applied 2223 place count 769 transition count 1984
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2234 place count 758 transition count 1962
Iterating global reduction 3 with 11 rules applied. Total rules applied 2245 place count 758 transition count 1962
Applied a total of 2245 rules in 2061 ms. Remains 758 /1628 variables (removed 870) and now considering 1962/5962 (removed 4000) transitions.
[2025-06-02 12:15:27] [INFO ] Flow matrix only has 1327 transitions (discarded 635 similar events)
// Phase 1: matrix 1327 rows 758 cols
[2025-06-02 12:15:27] [INFO ] Computed 2 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:29] [INFO ] Implicit Places using invariants in 1580 ms returned []
[2025-06-02 12:15:29] [INFO ] Flow matrix only has 1327 transitions (discarded 635 similar events)
[2025-06-02 12:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:15:30] [INFO ] State equation strengthened by 325 read => feed constraints.
[2025-06-02 12:15:42] [INFO ] Implicit Places using invariants and state equation in 13193 ms returned []
Implicit Place search using SMT with State Equation took 14841 ms to find 0 implicit places.
Running 1960 sub problems to find dead transitions.
[2025-06-02 12:15:42] [INFO ] Flow matrix only has 1327 transitions (discarded 635 similar events)
[2025-06-02 12:15:42] [INFO ] Invariant cache hit.
[2025-06-02 12:15:42] [INFO ] State equation strengthened by 325 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/758 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1960 unsolved
SMT process timed out in 35798ms, After SMT, problems are : Problem set: 0 solved, 1960 unsolved
Search for dead transitions found 0 dead transitions in 35846ms
Starting structural reductions in LTL mode, iteration 1 : 758/1628 places, 1962/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52795 ms. Remains : 758/1628 places, 1962/5962 transitions.
Support contains 40 out of 758 places after structural reductions.
[2025-06-02 12:16:18] [INFO ] Flatten gal took : 332 ms
[2025-06-02 12:16:19] [INFO ] Flatten gal took : 215 ms
[2025-06-02 12:16:19] [INFO ] Input system was already deterministic with 1962 transitions.
Support contains 36 out of 758 places (down from 40) after GAL structural reductions.
RANDOM walk for 40012 steps (8 resets) in 3527 ms. (11 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 48 ms. (81 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
[2025-06-02 12:16:20] [INFO ] Flow matrix only has 1327 transitions (discarded 635 similar events)
[2025-06-02 12:16:20] [INFO ] Invariant cache hit.
[2025-06-02 12:16:20] [INFO ] State equation strengthened by 325 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 381/412 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 37/449 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1475 variables, 449/451 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 259/710 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1475 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 8 (OVERLAPS) 507/1982 variables, 211/921 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1982 variables, 66/987 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1982 variables, 0/987 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 102/2084 variables, 97/1084 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2084 variables, 0/1084 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 1/2085 variables, 1/1085 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2085 variables, 0/1085 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2085/2085 variables, and 1085 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 758/758 constraints, ReadFeed: 325/325 constraints, PredecessorRefiner: 18/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 382/409 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 38/447 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1022/1469 variables, 447/449 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1469 variables, 259/708 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:28] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 1/709 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1469 variables, 0/709 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 506/1975 variables, 209/918 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1975 variables, 66/984 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1975/2085 variables, and 999 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 656/758 constraints, ReadFeed: 325/325 constraints, PredecessorRefiner: 17/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10368ms problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 751 transition count 1948
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 751 transition count 1948
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 746 transition count 1936
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 746 transition count 1936
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 741 transition count 1918
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 741 transition count 1918
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 737 transition count 1906
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 737 transition count 1906
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 733 transition count 1898
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 733 transition count 1898
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 730 transition count 1892
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 730 transition count 1892
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 727 transition count 1886
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 727 transition count 1886
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 724 transition count 1880
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 724 transition count 1880
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 722 transition count 1876
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 722 transition count 1876
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 100 place count 722 transition count 1848
Applied a total of 100 rules in 911 ms. Remains 722 /758 variables (removed 36) and now considering 1848/1962 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 722/758 places, 1848/1962 transitions.
RANDOM walk for 40024 steps (8 resets) in 403 ms. (99 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
[2025-06-02 12:16:32] [INFO ] Flow matrix only has 1250 transitions (discarded 598 similar events)
// Phase 1: matrix 1250 rows 722 cols
[2025-06-02 12:16:32] [INFO ] Computed 2 invariants in 24 ms
[2025-06-02 12:16:32] [INFO ] State equation strengthened by 309 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 382/405 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 32/437 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 982/1419 variables, 437/439 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 243/682 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 456/1875 variables, 193/875 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1875 variables, 66/941 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1875 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 96/1971 variables, 91/1032 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1971 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/1972 variables, 1/1033 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/1972 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1972/1972 variables, and 1033 constraints, problems are : Problem set: 0 solved, 15 unsolved in 6338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 722/722 constraints, ReadFeed: 309/309 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 382/405 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 32/437 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 982/1419 variables, 437/439 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 243/682 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:41] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 456/1875 variables, 193/876 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1875 variables, 66/942 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1875 variables, 14/956 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:46] [INFO ] Deduced a trap composed of 131 places in 401 ms of which 23 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1875 variables, 1/957 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:53] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:53] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:53] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:16:53] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1875 variables, 4/961 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1875 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 96/1971 variables, 91/1052 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:06] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:06] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:06] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:07] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:07] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:07] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:07] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:07] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:08] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:08] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:08] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:09] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:09] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1971 variables, 13/1065 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:12] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:12] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1971 variables, 2/1067 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1971 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 1/1972 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1972/1972 variables, and 1068 constraints, problems are : Problem set: 0 solved, 15 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 722/722 constraints, ReadFeed: 309/309 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 51499ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 722 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 722/722 places, 1848/1848 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 719 transition count 1842
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 719 transition count 1842
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 716 transition count 1834
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 716 transition count 1834
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 713 transition count 1826
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 713 transition count 1826
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 710 transition count 1820
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 710 transition count 1820
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 708 transition count 1816
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 708 transition count 1816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 706 transition count 1812
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 706 transition count 1812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 704 transition count 1808
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 704 transition count 1808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 702 transition count 1804
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 702 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 701 transition count 1802
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 701 transition count 1802
Applied a total of 42 rules in 566 ms. Remains 701 /722 variables (removed 21) and now considering 1802/1848 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 701/722 places, 1802/1848 transitions.
RANDOM walk for 40050 steps (8 resets) in 644 ms. (62 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (20 resets) in 112 ms. (354 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 89 ms. (444 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 80 ms. (493 steps per ms) remains 7/9 properties
[2025-06-02 12:17:24] [INFO ] Flow matrix only has 1217 transitions (discarded 585 similar events)
// Phase 1: matrix 1217 rows 701 cols
[2025-06-02 12:17:25] [INFO ] Computed 2 invariants in 14 ms
[2025-06-02 12:17:25] [INFO ] State equation strengthened by 302 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 615/625 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1062/1687 variables, 533/543 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 302/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 62/1749 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1749 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 159/1908 variables, 151/998 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1908 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/1918 variables, 7/1005 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1918 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1918 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1918/1918 variables, and 1005 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 701/701 constraints, ReadFeed: 302/302 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 615/625 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1062/1687 variables, 533/543 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1687 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1687 variables, 302/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1687 variables, 7/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1687 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 62/1749 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:31] [INFO ] Deduced a trap composed of 131 places in 234 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1749 variables, 1/855 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:32] [INFO ] Deduced a trap along path composed of 3 places in 108 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:32] [INFO ] Deduced a trap along path composed of 3 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:32] [INFO ] Deduced a trap along path composed of 3 places in 84 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:32] [INFO ] Deduced a trap along path composed of 3 places in 85 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:32] [INFO ] Deduced a trap along path composed of 3 places in 77 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:32] [INFO ] Deduced a trap along path composed of 3 places in 79 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:33] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:33] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:33] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:33] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:33] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:33] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:33] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:34] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:34] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:34] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:34] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:34] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:34] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:34] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1749 variables, 20/875 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:35] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:35] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:35] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:36] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:37] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:37] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:37] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:37] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:37] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1749 variables, 17/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1749 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 159/1908 variables, 151/1043 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:41] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:41] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1908 variables, 2/1045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:43] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1908 variables, 1/1046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:45] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1908 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1908 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 10/1918 variables, 7/1054 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1918 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/1918 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1918/1918 variables, and 1054 constraints, problems are : Problem set: 0 solved, 7 unsolved in 23533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 701/701 constraints, ReadFeed: 302/302 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 41/41 constraints]
After SMT, in 26621ms problems are : Problem set: 0 solved, 7 unsolved
Finished Parikh walk after 16870 steps, including 70 resets, run visited all 1 properties in 76 ms. (steps per millisecond=221 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 760 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2025-06-02 12:17:52] [INFO ] Flatten gal took : 90 ms
[2025-06-02 12:17:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-c032-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 12:17:52] [INFO ] Flatten gal took : 103 ms
[2025-06-02 12:17:52] [INFO ] Input system was already deterministic with 1962 transitions.
Support contains 29 out of 758 places (down from 32) after GAL structural reductions.
Computed a total of 192 stabilizing places and 512 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 735 transition count 1908
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 735 transition count 1908
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 735 transition count 1902
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 716 transition count 1852
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 716 transition count 1852
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 109 place count 697 transition count 1790
Iterating global reduction 1 with 19 rules applied. Total rules applied 128 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 147 place count 678 transition count 1734
Iterating global reduction 1 with 19 rules applied. Total rules applied 166 place count 678 transition count 1734
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 184 place count 660 transition count 1696
Iterating global reduction 1 with 18 rules applied. Total rules applied 202 place count 660 transition count 1696
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 218 place count 644 transition count 1664
Iterating global reduction 1 with 16 rules applied. Total rules applied 234 place count 644 transition count 1664
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 249 place count 629 transition count 1634
Iterating global reduction 1 with 15 rules applied. Total rules applied 264 place count 629 transition count 1634
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 277 place count 616 transition count 1608
Iterating global reduction 1 with 13 rules applied. Total rules applied 290 place count 616 transition count 1608
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 299 place count 607 transition count 1590
Iterating global reduction 1 with 9 rules applied. Total rules applied 308 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 309 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 310 place count 606 transition count 1588
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 312 place count 606 transition count 1586
Applied a total of 312 rules in 753 ms. Remains 606 /758 variables (removed 152) and now considering 1586/1962 (removed 376) transitions.
[2025-06-02 12:17:53] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
// Phase 1: matrix 1060 rows 606 cols
[2025-06-02 12:17:53] [INFO ] Computed 2 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:54] [INFO ] Implicit Places using invariants in 613 ms returned []
[2025-06-02 12:17:54] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:54] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-02 12:17:58] [INFO ] Implicit Places using invariants and state equation in 4436 ms returned []
Implicit Place search using SMT with State Equation took 5055 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:17:58] [INFO ] Redundant transitions in 162 ms returned []
Running 1584 sub problems to find dead transitions.
[2025-06-02 12:17:58] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:17:58] [INFO ] Invariant cache hit.
[2025-06-02 12:17:58] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1666 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
(s469 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 3)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 1)
(s116 1)
(s117 0)
(s118 0)
(s119 1)
(s120 1)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/1666 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 0/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63178ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 63183ms
Starting structural reductions in SI_CTL mode, iteration 1 : 606/758 places, 1586/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69167 ms. Remains : 606/758 places, 1586/1962 transitions.
[2025-06-02 12:19:02] [INFO ] Flatten gal took : 50 ms
[2025-06-02 12:19:02] [INFO ] Flatten gal took : 58 ms
[2025-06-02 12:19:02] [INFO ] Input system was already deterministic with 1586 transitions.
RANDOM walk for 40066 steps (8 resets) in 293 ms. (136 steps per ms) remains 1/1 properties
[2025-06-02 12:19:02] [INFO ] Flatten gal took : 85 ms
BEST_FIRST walk for 40002 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2025-06-02 12:19:02] [INFO ] Flatten gal took : 71 ms
[2025-06-02 12:19:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8476064518324967846.gal : 44 ms
[2025-06-02 12:19:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12212523597745169597.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8476064518324967846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12212523597745169597.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12212523597745169597.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1955
Interrupted probabilistic random walk after 311066 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 311066 steps, saw 201913 distinct states, run finished after 3008 ms. (steps per millisecond=103 ) properties seen :0
[2025-06-02 12:19:05] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:19:05] [INFO ] Invariant cache hit.
[2025-06-02 12:19:05] [INFO ] State equation strengthened by 264 read => feed constraints.
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) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1520 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1521 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1521 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1521 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 131/1652 variables, 129/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 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) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1955 after 1.16025e+06
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1520 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:08] [INFO ] Deduced a trap along path composed of 3 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:08] [INFO ] Deduced a trap along path composed of 3 places in 90 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:08] [INFO ] Deduced a trap along path composed of 3 places in 87 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:09] [INFO ] Deduced a trap along path composed of 3 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:09] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:09] [INFO ] Deduced a trap along path composed of 3 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:09] [INFO ] Deduced a trap along path composed of 3 places in 79 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:09] [INFO ] Deduced a trap along path composed of 3 places in 83 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:09] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:10] [INFO ] Deduced a trap along path composed of 3 places in 73 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:10] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:10] [INFO ] Deduced a trap along path composed of 3 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:10] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:10] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:10] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:11] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:11] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:11] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:11] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:11] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1520 variables, 20/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:11] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/1666 variables, and 755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 468/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 21/21 constraints]
After SMT, in 6315ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 108 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 606/606 places, 1586/1586 transitions.
RANDOM walk for 400051 steps (8 resets) in 4618 ms. (86 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2025-06-02 12:19:13] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:19:13] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-02 12:19:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 12:19:13] [INFO ] After 376ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 12:19:13] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-02 12:19:13] [INFO ] After 79ms SMT Verify possible using 264 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 12:19:13] [INFO ] After 154ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 12:19:13] [INFO ] After 733ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:19:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-02 12:19:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 12:19:14] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 12:19:14] [INFO ] After 92ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 12:19:14] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 12:19:14] [INFO ] After 681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000043 steps (8 resets) in 12325 ms. (324 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7674 ms. (521 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.16025e+06 after 3.062e+10
Interrupted probabilistic random walk after 1695785 steps, run timeout after 15001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 1695785 steps, saw 1100602 distinct states, run finished after 15001 ms. (steps per millisecond=113 ) properties seen :0
[2025-06-02 12:19:35] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:19:35] [INFO ] Invariant cache hit.
[2025-06-02 12:19:35] [INFO ] State equation strengthened by 264 read => feed constraints.
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) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1520 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1521 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1521 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1521 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 131/1652 variables, 129/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 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) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1520 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:38] [INFO ] Deduced a trap along path composed of 3 places in 71 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:38] [INFO ] Deduced a trap along path composed of 3 places in 89 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:38] [INFO ] Deduced a trap along path composed of 3 places in 86 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:38] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:39] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:39] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:39] [INFO ] Deduced a trap along path composed of 3 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:39] [INFO ] Deduced a trap along path composed of 3 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:39] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:39] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:40] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:40] [INFO ] Deduced a trap along path composed of 3 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:40] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:40] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:40] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:40] [INFO ] Deduced a trap along path composed of 3 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:41] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:41] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:41] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:41] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1520 variables, 20/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:41] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:41] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:41] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:42] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:43] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:43] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:43] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:43] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:43] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1520 variables, 18/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1520 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1521 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1521 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:43] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1521 variables, 1/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:19:44] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1521 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1521 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 131/1652 variables, 129/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1652 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1660 variables, 4/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1660 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1666 variables, 4/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1666 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1666 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 913 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 39/39 constraints]
After SMT, in 10908ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10369 steps, including 43 resets, run visited all 1 properties in 43 ms. (steps per millisecond=241 )
FORMULA FunctionPointer-PT-c032-CTLFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 44 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 735 transition count 1908
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 735 transition count 1908
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 735 transition count 1904
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 69 place count 716 transition count 1854
Iterating global reduction 1 with 19 rules applied. Total rules applied 88 place count 716 transition count 1854
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 107 place count 697 transition count 1792
Iterating global reduction 1 with 19 rules applied. Total rules applied 126 place count 697 transition count 1792
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 145 place count 678 transition count 1736
Iterating global reduction 1 with 19 rules applied. Total rules applied 164 place count 678 transition count 1736
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 181 place count 661 transition count 1700
Iterating global reduction 1 with 17 rules applied. Total rules applied 198 place count 661 transition count 1700
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 214 place count 645 transition count 1668
Iterating global reduction 1 with 16 rules applied. Total rules applied 230 place count 645 transition count 1668
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 245 place count 630 transition count 1638
Iterating global reduction 1 with 15 rules applied. Total rules applied 260 place count 630 transition count 1638
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 273 place count 617 transition count 1612
Iterating global reduction 1 with 13 rules applied. Total rules applied 286 place count 617 transition count 1612
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 295 place count 608 transition count 1594
Iterating global reduction 1 with 9 rules applied. Total rules applied 304 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 305 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 306 place count 607 transition count 1592
Applied a total of 306 rules in 260 ms. Remains 607 /758 variables (removed 151) and now considering 1592/1962 (removed 370) transitions.
[2025-06-02 12:19:46] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2025-06-02 12:19:46] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:47] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2025-06-02 12:19:47] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2025-06-02 12:19:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:47] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-02 12:19:51] [INFO ] Implicit Places using invariants and state equation in 4183 ms returned []
Implicit Place search using SMT with State Equation took 5190 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2025-06-02 12:19:51] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2025-06-02 12:19:51] [INFO ] Invariant cache hit.
[2025-06-02 12:19:51] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 607/1670 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/1670 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/607 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 0/1590 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63553ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 63561ms
Starting structural reductions in LTL mode, iteration 1 : 607/758 places, 1592/1962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69018 ms. Remains : 607/758 places, 1592/1962 transitions.
[2025-06-02 12:20:55] [INFO ] Flatten gal took : 50 ms
[2025-06-02 12:20:55] [INFO ] Flatten gal took : 54 ms
[2025-06-02 12:20:55] [INFO ] Input system was already deterministic with 1592 transitions.
[2025-06-02 12:20:55] [INFO ] Flatten gal took : 54 ms
[2025-06-02 12:20:55] [INFO ] Flatten gal took : 52 ms
[2025-06-02 12:20:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9432890674983402804.gal : 16 ms
[2025-06-02 12:20:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3805468548656248298.ctl : 6 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9432890674983402804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3805468548656248298.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:21:25] [INFO ] Flatten gal took : 49 ms
[2025-06-02 12:21:25] [INFO ] Applying decomposition
[2025-06-02 12:21:25] [INFO ] Flatten gal took : 50 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/graph2256135914837509216.txt' '-o' '/tmp/graph2256135914837509216.bin' '-w' '/tmp/graph2256135914837509216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2256135914837509216.bin' '-l' '-1' '-v' '-w' '/tmp/graph2256135914837509216.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:21:25] [INFO ] Decomposing Gal with order
[2025-06-02 12:21:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:21:26] [INFO ] Removed a total of 2638 redundant transitions.
[2025-06-02 12:21:26] [INFO ] Flatten gal took : 237 ms
[2025-06-02 12:21:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1166 labels/synchronizations in 145 ms.
[2025-06-02 12:21:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5991415372077579647.gal : 22 ms
[2025-06-02 12:21:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11772958520661404297.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5991415372077579647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11772958520661404297.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 735 transition count 1910
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 735 transition count 1910
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 735 transition count 1904
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 717 transition count 1856
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 717 transition count 1856
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 106 place count 699 transition count 1796
Iterating global reduction 1 with 18 rules applied. Total rules applied 124 place count 699 transition count 1796
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 142 place count 681 transition count 1742
Iterating global reduction 1 with 18 rules applied. Total rules applied 160 place count 681 transition count 1742
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 177 place count 664 transition count 1706
Iterating global reduction 1 with 17 rules applied. Total rules applied 194 place count 664 transition count 1706
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 209 place count 649 transition count 1676
Iterating global reduction 1 with 15 rules applied. Total rules applied 224 place count 649 transition count 1676
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 239 place count 634 transition count 1646
Iterating global reduction 1 with 15 rules applied. Total rules applied 254 place count 634 transition count 1646
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 267 place count 621 transition count 1620
Iterating global reduction 1 with 13 rules applied. Total rules applied 280 place count 621 transition count 1620
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 289 place count 612 transition count 1602
Iterating global reduction 1 with 9 rules applied. Total rules applied 298 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 299 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 300 place count 611 transition count 1600
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 304 place count 611 transition count 1596
Applied a total of 304 rules in 674 ms. Remains 611 /758 variables (removed 147) and now considering 1596/1962 (removed 366) transitions.
[2025-06-02 12:21:57] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 611 cols
[2025-06-02 12:21:57] [INFO ] Computed 2 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:58] [INFO ] Implicit Places using invariants in 952 ms returned []
[2025-06-02 12:21:58] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2025-06-02 12:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 12:22:02] [INFO ] Implicit Places using invariants and state equation in 4532 ms returned []
Implicit Place search using SMT with State Equation took 5492 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:22:03] [INFO ] Redundant transitions in 158 ms returned []
Running 1594 sub problems to find dead transitions.
[2025-06-02 12:22:03] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2025-06-02 12:22:03] [INFO ] Invariant cache hit.
[2025-06-02 12:22:03] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1678 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 5)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/1678 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1594 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63446ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 63455ms
Starting structural reductions in SI_CTL mode, iteration 1 : 611/758 places, 1596/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69793 ms. Remains : 611/758 places, 1596/1962 transitions.
[2025-06-02 12:23:06] [INFO ] Flatten gal took : 59 ms
[2025-06-02 12:23:06] [INFO ] Flatten gal took : 76 ms
[2025-06-02 12:23:06] [INFO ] Input system was already deterministic with 1596 transitions.
[2025-06-02 12:23:06] [INFO ] Flatten gal took : 77 ms
[2025-06-02 12:23:06] [INFO ] Flatten gal took : 70 ms
[2025-06-02 12:23:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1281006060849799179.gal : 18 ms
[2025-06-02 12:23:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12510666461379070113.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1281006060849799179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12510666461379070113.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:23:37] [INFO ] Flatten gal took : 36 ms
[2025-06-02 12:23:37] [INFO ] Applying decomposition
[2025-06-02 12:23:37] [INFO ] Flatten gal took : 36 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/graph1653924488868906062.txt' '-o' '/tmp/graph1653924488868906062.bin' '-w' '/tmp/graph1653924488868906062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1653924488868906062.bin' '-l' '-1' '-v' '-w' '/tmp/graph1653924488868906062.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:23:37] [INFO ] Decomposing Gal with order
[2025-06-02 12:23:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:23:37] [INFO ] Removed a total of 2648 redundant transitions.
[2025-06-02 12:23:37] [INFO ] Flatten gal took : 119 ms
[2025-06-02 12:23:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1079 labels/synchronizations in 126 ms.
[2025-06-02 12:23:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7927229521659516343.gal : 19 ms
[2025-06-02 12:23:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6588039234365200131.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7927229521659516343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6588039234365200131.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 736 transition count 1910
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 736 transition count 1910
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 736 transition count 1904
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 719 transition count 1862
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 719 transition count 1862
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 101 place count 702 transition count 1808
Iterating global reduction 1 with 17 rules applied. Total rules applied 118 place count 702 transition count 1808
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 135 place count 685 transition count 1756
Iterating global reduction 1 with 17 rules applied. Total rules applied 152 place count 685 transition count 1756
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 168 place count 669 transition count 1722
Iterating global reduction 1 with 16 rules applied. Total rules applied 184 place count 669 transition count 1722
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 198 place count 655 transition count 1694
Iterating global reduction 1 with 14 rules applied. Total rules applied 212 place count 655 transition count 1694
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 225 place count 642 transition count 1668
Iterating global reduction 1 with 13 rules applied. Total rules applied 238 place count 642 transition count 1668
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 249 place count 631 transition count 1646
Iterating global reduction 1 with 11 rules applied. Total rules applied 260 place count 631 transition count 1646
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 269 place count 622 transition count 1628
Iterating global reduction 1 with 9 rules applied. Total rules applied 278 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 279 place count 621 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 280 place count 621 transition count 1626
Applied a total of 280 rules in 265 ms. Remains 621 /758 variables (removed 137) and now considering 1626/1962 (removed 336) transitions.
[2025-06-02 12:24:07] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
// Phase 1: matrix 1086 rows 621 cols
[2025-06-02 12:24:07] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:08] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2025-06-02 12:24:08] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
[2025-06-02 12:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:09] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-02 12:24:13] [INFO ] Implicit Places using invariants and state equation in 4103 ms returned []
Implicit Place search using SMT with State Equation took 5160 ms to find 0 implicit places.
Running 1624 sub problems to find dead transitions.
[2025-06-02 12:24:13] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
[2025-06-02 12:24:13] [INFO ] Invariant cache hit.
[2025-06-02 12:24:13] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
SMT process timed out in 33688ms, After SMT, problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 33696ms
Starting structural reductions in LTL mode, iteration 1 : 621/758 places, 1626/1962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39127 ms. Remains : 621/758 places, 1626/1962 transitions.
[2025-06-02 12:24:46] [INFO ] Flatten gal took : 52 ms
[2025-06-02 12:24:46] [INFO ] Flatten gal took : 63 ms
[2025-06-02 12:24:47] [INFO ] Input system was already deterministic with 1626 transitions.
[2025-06-02 12:24:47] [INFO ] Flatten gal took : 61 ms
[2025-06-02 12:24:47] [INFO ] Flatten gal took : 60 ms
[2025-06-02 12:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7571286527218495562.gal : 10 ms
[2025-06-02 12:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3733719958057463326.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7571286527218495562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3733719958057463326.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:25:17] [INFO ] Flatten gal took : 38 ms
[2025-06-02 12:25:17] [INFO ] Applying decomposition
[2025-06-02 12:25:17] [INFO ] Flatten gal took : 38 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/graph14783288461385907065.txt' '-o' '/tmp/graph14783288461385907065.bin' '-w' '/tmp/graph14783288461385907065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14783288461385907065.bin' '-l' '-1' '-v' '-w' '/tmp/graph14783288461385907065.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:25:17] [INFO ] Decomposing Gal with order
[2025-06-02 12:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:25:17] [INFO ] Removed a total of 2702 redundant transitions.
[2025-06-02 12:25:17] [INFO ] Flatten gal took : 95 ms
[2025-06-02 12:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1186 labels/synchronizations in 43 ms.
[2025-06-02 12:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5370449419516931176.gal : 12 ms
[2025-06-02 12:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability9334078170978097969.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5370449419516931176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9334078170978097969.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 735 transition count 1908
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 735 transition count 1908
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 735 transition count 1902
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 716 transition count 1852
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 716 transition count 1852
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 109 place count 697 transition count 1790
Iterating global reduction 1 with 19 rules applied. Total rules applied 128 place count 697 transition count 1790
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 147 place count 678 transition count 1734
Iterating global reduction 1 with 19 rules applied. Total rules applied 166 place count 678 transition count 1734
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 184 place count 660 transition count 1696
Iterating global reduction 1 with 18 rules applied. Total rules applied 202 place count 660 transition count 1696
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 218 place count 644 transition count 1664
Iterating global reduction 1 with 16 rules applied. Total rules applied 234 place count 644 transition count 1664
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 249 place count 629 transition count 1634
Iterating global reduction 1 with 15 rules applied. Total rules applied 264 place count 629 transition count 1634
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 277 place count 616 transition count 1608
Iterating global reduction 1 with 13 rules applied. Total rules applied 290 place count 616 transition count 1608
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 299 place count 607 transition count 1590
Iterating global reduction 1 with 9 rules applied. Total rules applied 308 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 309 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 310 place count 606 transition count 1588
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 312 place count 606 transition count 1586
Applied a total of 312 rules in 439 ms. Remains 606 /758 variables (removed 152) and now considering 1586/1962 (removed 376) transitions.
[2025-06-02 12:25:48] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
// Phase 1: matrix 1060 rows 606 cols
[2025-06-02 12:25:48] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:49] [INFO ] Implicit Places using invariants in 825 ms returned []
[2025-06-02 12:25:49] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:25:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:49] [INFO ] State equation strengthened by 264 read => feed constraints.
[2025-06-02 12:25:53] [INFO ] Implicit Places using invariants and state equation in 4347 ms returned []
Implicit Place search using SMT with State Equation took 5180 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:25:53] [INFO ] Redundant transitions in 93 ms returned []
Running 1584 sub problems to find dead transitions.
[2025-06-02 12:25:53] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:25:53] [INFO ] Invariant cache hit.
[2025-06-02 12:25:53] [INFO ] State equation strengthened by 264 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1666 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/1666 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 0/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63516ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 63521ms
Starting structural reductions in SI_CTL mode, iteration 1 : 606/758 places, 1586/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69247 ms. Remains : 606/758 places, 1586/1962 transitions.
[2025-06-02 12:26:57] [INFO ] Flatten gal took : 31 ms
[2025-06-02 12:26:57] [INFO ] Flatten gal took : 36 ms
[2025-06-02 12:26:57] [INFO ] Input system was already deterministic with 1586 transitions.
[2025-06-02 12:26:57] [INFO ] Flatten gal took : 61 ms
RANDOM walk for 40042 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2025-06-02 12:26:57] [INFO ] Flatten gal took : 41 ms
[2025-06-02 12:26:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15481887303094005947.gal : 6 ms
[2025-06-02 12:26:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5415876084315567505.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15481887303094005947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5415876084315567505.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5415876084315567505.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1955
Interrupted probabilistic random walk after 317582 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 1
Probabilistic random walk after 317582 steps, saw 206140 distinct states, run finished after 3004 ms. (steps per millisecond=105 ) properties seen :0
[2025-06-02 12:27:00] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2025-06-02 12:27:00] [INFO ] Invariant cache hit.
[2025-06-02 12:27:00] [INFO ] State equation strengthened by 264 read => feed constraints.
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) 268/270 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1330 variables, 402/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1330 variables, 200/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1392 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1392 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1393 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1393 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1393 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 259/1652 variables, 193/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1652 variables, 64/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1955 after 1.16025e+06
At refinement iteration 18 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1410 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 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) 268/270 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1330 variables, 402/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1330 variables, 200/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1330 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:02] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:02] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1330 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1330 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/1392 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:03] [INFO ] Deduced a trap along path composed of 3 places in 146 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:03] [INFO ] Deduced a trap along path composed of 3 places in 110 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:03] [INFO ] Deduced a trap along path composed of 3 places in 107 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:03] [INFO ] Deduced a trap along path composed of 3 places in 102 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:03] [INFO ] Deduced a trap along path composed of 3 places in 98 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:27:07] [INFO ] Deduced a trap along path composed of 3 places in 3300 ms of which 23 ms to minimize.
SMT process timed out in 6979ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 60655 steps, including 801 resets, run visited all 1 properties in 169 ms. (steps per millisecond=358 )
FORMULA FunctionPointer-PT-c032-CTLFireability-2025-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 170 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 734 transition count 1906
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 734 transition count 1906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 734 transition count 1900
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 715 transition count 1850
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 715 transition count 1850
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 111 place count 696 transition count 1788
Iterating global reduction 1 with 19 rules applied. Total rules applied 130 place count 696 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 149 place count 677 transition count 1732
Iterating global reduction 1 with 19 rules applied. Total rules applied 168 place count 677 transition count 1732
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 186 place count 659 transition count 1694
Iterating global reduction 1 with 18 rules applied. Total rules applied 204 place count 659 transition count 1694
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 220 place count 643 transition count 1662
Iterating global reduction 1 with 16 rules applied. Total rules applied 236 place count 643 transition count 1662
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 251 place count 628 transition count 1632
Iterating global reduction 1 with 15 rules applied. Total rules applied 266 place count 628 transition count 1632
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 279 place count 615 transition count 1606
Iterating global reduction 1 with 13 rules applied. Total rules applied 292 place count 615 transition count 1606
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 301 place count 606 transition count 1588
Iterating global reduction 1 with 9 rules applied. Total rules applied 310 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 311 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 312 place count 605 transition count 1586
Applied a total of 312 rules in 257 ms. Remains 605 /758 variables (removed 153) and now considering 1586/1962 (removed 376) transitions.
[2025-06-02 12:27:07] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2025-06-02 12:27:07] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:27:08] [INFO ] Implicit Places using invariants in 747 ms returned []
[2025-06-02 12:27:08] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2025-06-02 12:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:27:09] [INFO ] State equation strengthened by 262 read => feed constraints.
[2025-06-02 12:27:13] [INFO ] Implicit Places using invariants and state equation in 4490 ms returned []
Implicit Place search using SMT with State Equation took 5242 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2025-06-02 12:27:13] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2025-06-02 12:27:13] [INFO ] Invariant cache hit.
[2025-06-02 12:27:13] [INFO ] State equation strengthened by 262 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 0/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63892ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 63896ms
Starting structural reductions in LTL mode, iteration 1 : 605/758 places, 1586/1962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69400 ms. Remains : 605/758 places, 1586/1962 transitions.
[2025-06-02 12:28:16] [INFO ] Flatten gal took : 53 ms
[2025-06-02 12:28:17] [INFO ] Flatten gal took : 62 ms
[2025-06-02 12:28:17] [INFO ] Input system was already deterministic with 1586 transitions.
[2025-06-02 12:28:17] [INFO ] Flatten gal took : 62 ms
[2025-06-02 12:28:17] [INFO ] Flatten gal took : 62 ms
[2025-06-02 12:28:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9683291788564324319.gal : 10 ms
[2025-06-02 12:28:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11456838890603826706.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9683291788564324319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11456838890603826706.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:28:47] [INFO ] Flatten gal took : 42 ms
[2025-06-02 12:28:47] [INFO ] Applying decomposition
[2025-06-02 12:28:47] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4937801393076273976.txt' '-o' '/tmp/graph4937801393076273976.bin' '-w' '/tmp/graph4937801393076273976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4937801393076273976.bin' '-l' '-1' '-v' '-w' '/tmp/graph4937801393076273976.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:28:47] [INFO ] Decomposing Gal with order
[2025-06-02 12:28:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:28:47] [INFO ] Removed a total of 2627 redundant transitions.
[2025-06-02 12:28:47] [INFO ] Flatten gal took : 166 ms
[2025-06-02 12:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1125 labels/synchronizations in 65 ms.
[2025-06-02 12:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1005880745712360724.gal : 18 ms
[2025-06-02 12:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12097113851653293563.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1005880745712360724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12097113851653293563.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 738 transition count 1916
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 738 transition count 1916
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 738 transition count 1910
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 61 place count 723 transition count 1870
Iterating global reduction 1 with 15 rules applied. Total rules applied 76 place count 723 transition count 1870
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 91 place count 708 transition count 1822
Iterating global reduction 1 with 15 rules applied. Total rules applied 106 place count 708 transition count 1822
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 120 place count 694 transition count 1782
Iterating global reduction 1 with 14 rules applied. Total rules applied 134 place count 694 transition count 1782
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 147 place count 681 transition count 1754
Iterating global reduction 1 with 13 rules applied. Total rules applied 160 place count 681 transition count 1754
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 171 place count 670 transition count 1732
Iterating global reduction 1 with 11 rules applied. Total rules applied 182 place count 670 transition count 1732
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 192 place count 660 transition count 1712
Iterating global reduction 1 with 10 rules applied. Total rules applied 202 place count 660 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 211 place count 651 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 220 place count 651 transition count 1694
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 226 place count 645 transition count 1682
Iterating global reduction 1 with 6 rules applied. Total rules applied 232 place count 645 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 233 place count 644 transition count 1680
Iterating global reduction 1 with 1 rules applied. Total rules applied 234 place count 644 transition count 1680
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 242 place count 644 transition count 1672
Applied a total of 242 rules in 810 ms. Remains 644 /758 variables (removed 114) and now considering 1672/1962 (removed 290) transitions.
[2025-06-02 12:29:18] [INFO ] Flow matrix only has 1121 transitions (discarded 551 similar events)
// Phase 1: matrix 1121 rows 644 cols
[2025-06-02 12:29:18] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:19] [INFO ] Implicit Places using invariants in 735 ms returned []
[2025-06-02 12:29:19] [INFO ] Flow matrix only has 1121 transitions (discarded 551 similar events)
[2025-06-02 12:29:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:20] [INFO ] State equation strengthened by 277 read => feed constraints.
[2025-06-02 12:29:23] [INFO ] Implicit Places using invariants and state equation in 3551 ms returned []
Implicit Place search using SMT with State Equation took 4288 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:29:23] [INFO ] Redundant transitions in 56 ms returned []
Running 1670 sub problems to find dead transitions.
[2025-06-02 12:29:23] [INFO ] Flow matrix only has 1121 transitions (discarded 551 similar events)
[2025-06-02 12:29:23] [INFO ] Invariant cache hit.
[2025-06-02 12:29:23] [INFO ] State equation strengthened by 277 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 13.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 644/1765 variables, and 2 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/644 constraints, ReadFeed: 0/277 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1670 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/1765 variables, and 2 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/644 constraints, ReadFeed: 0/277 constraints, PredecessorRefiner: 0/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63951ms problems are : Problem set: 0 solved, 1670 unsolved
Search for dead transitions found 0 dead transitions in 63955ms
Starting structural reductions in SI_CTL mode, iteration 1 : 644/758 places, 1672/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69119 ms. Remains : 644/758 places, 1672/1962 transitions.
[2025-06-02 12:30:27] [INFO ] Flatten gal took : 53 ms
[2025-06-02 12:30:27] [INFO ] Flatten gal took : 63 ms
[2025-06-02 12:30:27] [INFO ] Input system was already deterministic with 1672 transitions.
[2025-06-02 12:30:27] [INFO ] Flatten gal took : 63 ms
[2025-06-02 12:30:27] [INFO ] Flatten gal took : 65 ms
[2025-06-02 12:30:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17918958001542819774.gal : 17 ms
[2025-06-02 12:30:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17163731059044523365.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17918958001542819774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17163731059044523365.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:30:57] [INFO ] Flatten gal took : 64 ms
[2025-06-02 12:30:57] [INFO ] Applying decomposition
[2025-06-02 12:30:57] [INFO ] Flatten gal took : 62 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/graph4204694598524159796.txt' '-o' '/tmp/graph4204694598524159796.bin' '-w' '/tmp/graph4204694598524159796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4204694598524159796.bin' '-l' '-1' '-v' '-w' '/tmp/graph4204694598524159796.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:30:57] [INFO ] Decomposing Gal with order
[2025-06-02 12:30:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:30:58] [INFO ] Removed a total of 2788 redundant transitions.
[2025-06-02 12:30:58] [INFO ] Flatten gal took : 170 ms
[2025-06-02 12:30:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1318 labels/synchronizations in 67 ms.
[2025-06-02 12:30:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17468127497650035875.gal : 12 ms
[2025-06-02 12:30:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15420096375686082245.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17468127497650035875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15420096375686082245.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 737 transition count 1912
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 737 transition count 1912
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 737 transition count 1906
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 721 transition count 1864
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 721 transition count 1864
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 96 place count 705 transition count 1812
Iterating global reduction 1 with 16 rules applied. Total rules applied 112 place count 705 transition count 1812
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 128 place count 689 transition count 1764
Iterating global reduction 1 with 16 rules applied. Total rules applied 144 place count 689 transition count 1764
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 159 place count 674 transition count 1732
Iterating global reduction 1 with 15 rules applied. Total rules applied 174 place count 674 transition count 1732
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 188 place count 660 transition count 1704
Iterating global reduction 1 with 14 rules applied. Total rules applied 202 place count 660 transition count 1704
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 215 place count 647 transition count 1678
Iterating global reduction 1 with 13 rules applied. Total rules applied 228 place count 647 transition count 1678
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 239 place count 636 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 250 place count 636 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 258 place count 628 transition count 1640
Iterating global reduction 1 with 8 rules applied. Total rules applied 266 place count 628 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 267 place count 627 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 268 place count 627 transition count 1638
Applied a total of 268 rules in 249 ms. Remains 627 /758 variables (removed 131) and now considering 1638/1962 (removed 324) transitions.
[2025-06-02 12:31:28] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
// Phase 1: matrix 1096 rows 627 cols
[2025-06-02 12:31:28] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:29] [INFO ] Implicit Places using invariants in 745 ms returned []
[2025-06-02 12:31:29] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
[2025-06-02 12:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:31:29] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 12:31:32] [INFO ] Implicit Places using invariants and state equation in 3111 ms returned []
Implicit Place search using SMT with State Equation took 3858 ms to find 0 implicit places.
Running 1636 sub problems to find dead transitions.
[2025-06-02 12:31:32] [INFO ] Flow matrix only has 1096 transitions (discarded 542 similar events)
[2025-06-02 12:31:32] [INFO ] Invariant cache hit.
[2025-06-02 12:31:32] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 627/1723 variables, and 2 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/627 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1636 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/627 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/627 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 9)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/1723 variables, and 2 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/627 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 0/1636 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64224ms problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 64227ms
Starting structural reductions in LTL mode, iteration 1 : 627/758 places, 1638/1962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68340 ms. Remains : 627/758 places, 1638/1962 transitions.
[2025-06-02 12:32:36] [INFO ] Flatten gal took : 53 ms
[2025-06-02 12:32:36] [INFO ] Flatten gal took : 64 ms
[2025-06-02 12:32:36] [INFO ] Input system was already deterministic with 1638 transitions.
[2025-06-02 12:32:37] [INFO ] Flatten gal took : 61 ms
[2025-06-02 12:32:37] [INFO ] Flatten gal took : 61 ms
[2025-06-02 12:32:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3348968678294054271.gal : 10 ms
[2025-06-02 12:32:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4731027393340268332.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3348968678294054271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4731027393340268332.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:33:07] [INFO ] Flatten gal took : 62 ms
[2025-06-02 12:33:07] [INFO ] Applying decomposition
[2025-06-02 12:33:07] [INFO ] Flatten gal took : 61 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/graph14527392006991950064.txt' '-o' '/tmp/graph14527392006991950064.bin' '-w' '/tmp/graph14527392006991950064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14527392006991950064.bin' '-l' '-1' '-v' '-w' '/tmp/graph14527392006991950064.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:33:07] [INFO ] Decomposing Gal with order
[2025-06-02 12:33:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:33:07] [INFO ] Removed a total of 2724 redundant transitions.
[2025-06-02 12:33:07] [INFO ] Flatten gal took : 71 ms
[2025-06-02 12:33:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1155 labels/synchronizations in 40 ms.
[2025-06-02 12:33:07] [INFO ] Time to serialize gal into /tmp/CTLFireability7834621969427989899.gal : 11 ms
[2025-06-02 12:33:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1351753037597281685.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7834621969427989899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1351753037597281685.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 734 transition count 1906
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 734 transition count 1906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 734 transition count 1900
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 715 transition count 1850
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 715 transition count 1850
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 111 place count 696 transition count 1788
Iterating global reduction 1 with 19 rules applied. Total rules applied 130 place count 696 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 149 place count 677 transition count 1732
Iterating global reduction 1 with 19 rules applied. Total rules applied 168 place count 677 transition count 1732
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 186 place count 659 transition count 1694
Iterating global reduction 1 with 18 rules applied. Total rules applied 204 place count 659 transition count 1694
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 220 place count 643 transition count 1662
Iterating global reduction 1 with 16 rules applied. Total rules applied 236 place count 643 transition count 1662
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 251 place count 628 transition count 1632
Iterating global reduction 1 with 15 rules applied. Total rules applied 266 place count 628 transition count 1632
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 279 place count 615 transition count 1606
Iterating global reduction 1 with 13 rules applied. Total rules applied 292 place count 615 transition count 1606
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 301 place count 606 transition count 1588
Iterating global reduction 1 with 9 rules applied. Total rules applied 310 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 311 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 312 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 314 place count 605 transition count 1584
Applied a total of 314 rules in 514 ms. Remains 605 /758 variables (removed 153) and now considering 1584/1962 (removed 378) transitions.
[2025-06-02 12:33:38] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2025-06-02 12:33:38] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:33:39] [INFO ] Implicit Places using invariants in 887 ms returned []
[2025-06-02 12:33:39] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2025-06-02 12:33:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:33:39] [INFO ] State equation strengthened by 262 read => feed constraints.
[2025-06-02 12:33:47] [INFO ] Implicit Places using invariants and state equation in 8127 ms returned []
Implicit Place search using SMT with State Equation took 9018 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:33:47] [INFO ] Redundant transitions in 52 ms returned []
Running 1582 sub problems to find dead transitions.
[2025-06-02 12:33:47] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2025-06-02 12:33:47] [INFO ] Invariant cache hit.
[2025-06-02 12:33:47] [INFO ] State equation strengthened by 262 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 0/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63669ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 63673ms
Starting structural reductions in SI_CTL mode, iteration 1 : 605/758 places, 1584/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73266 ms. Remains : 605/758 places, 1584/1962 transitions.
[2025-06-02 12:34:51] [INFO ] Flatten gal took : 51 ms
[2025-06-02 12:34:51] [INFO ] Flatten gal took : 60 ms
[2025-06-02 12:34:51] [INFO ] Input system was already deterministic with 1584 transitions.
RANDOM walk for 40068 steps (8 resets) in 327 ms. (122 steps per ms) remains 1/1 properties
[2025-06-02 12:34:51] [INFO ] Flatten gal took : 110 ms
BEST_FIRST walk for 40004 steps (19 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
[2025-06-02 12:34:51] [INFO ] Flatten gal took : 67 ms
[2025-06-02 12:34:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9282506135269188956.gal : 10 ms
[2025-06-02 12:34:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2184607408134582729.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9282506135269188956.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2184607408134582729.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2184607408134582729.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1955
Interrupted probabilistic random walk after 326222 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326222 steps, saw 211751 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 12:34:54] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2025-06-02 12:34:54] [INFO ] Invariant cache hit.
[2025-06-02 12:34:54] [INFO ] State equation strengthened by 262 read => feed constraints.
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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 706/1091 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 65/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 336/1427 variables, 68/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1427 variables, 129/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1427 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/1641 variables, 141/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1641 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1641 variables, 68/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1641 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/1648 variables, 3/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 706/1091 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 65/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 336/1427 variables, 68/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1427 variables, 129/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1427 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1427 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/1641 variables, 141/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1641 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1641 variables, 68/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1955 after 1.16025e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:56] [INFO ] Deduced a trap composed of 131 places in 275 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1641 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:56] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:34:56] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1641 variables, 2/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1641 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/1648 variables, 3/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1648 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1656 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1656 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1662 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1662 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1662 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2922 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3708ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1899 steps, including 27 resets, run visited all 1 properties in 22 ms. (steps per millisecond=86 )
FORMULA FunctionPointer-PT-c032-CTLFireability-2025-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 24 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 734 transition count 1906
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 734 transition count 1906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 734 transition count 1900
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 715 transition count 1850
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 715 transition count 1850
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 111 place count 696 transition count 1788
Iterating global reduction 1 with 19 rules applied. Total rules applied 130 place count 696 transition count 1788
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 148 place count 678 transition count 1736
Iterating global reduction 1 with 18 rules applied. Total rules applied 166 place count 678 transition count 1736
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 183 place count 661 transition count 1700
Iterating global reduction 1 with 17 rules applied. Total rules applied 200 place count 661 transition count 1700
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 215 place count 646 transition count 1670
Iterating global reduction 1 with 15 rules applied. Total rules applied 230 place count 646 transition count 1670
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 244 place count 632 transition count 1642
Iterating global reduction 1 with 14 rules applied. Total rules applied 258 place count 632 transition count 1642
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 270 place count 620 transition count 1618
Iterating global reduction 1 with 12 rules applied. Total rules applied 282 place count 620 transition count 1618
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 290 place count 612 transition count 1602
Iterating global reduction 1 with 8 rules applied. Total rules applied 298 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 299 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 300 place count 611 transition count 1600
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 304 place count 611 transition count 1596
Applied a total of 304 rules in 456 ms. Remains 611 /758 variables (removed 147) and now considering 1596/1962 (removed 366) transitions.
[2025-06-02 12:34:58] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 611 cols
[2025-06-02 12:34:58] [INFO ] Computed 2 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:34:59] [INFO ] Implicit Places using invariants in 961 ms returned []
[2025-06-02 12:34:59] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2025-06-02 12:34:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:35:00] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 12:35:03] [INFO ] Implicit Places using invariants and state equation in 3593 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:35:03] [INFO ] Redundant transitions in 52 ms returned []
Running 1594 sub problems to find dead transitions.
[2025-06-02 12:35:03] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2025-06-02 12:35:03] [INFO ] Invariant cache hit.
[2025-06-02 12:35:03] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
SMT process timed out in 33739ms, After SMT, problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 33742ms
Starting structural reductions in SI_CTL mode, iteration 1 : 611/758 places, 1596/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38814 ms. Remains : 611/758 places, 1596/1962 transitions.
[2025-06-02 12:35:37] [INFO ] Flatten gal took : 57 ms
[2025-06-02 12:35:37] [INFO ] Flatten gal took : 67 ms
[2025-06-02 12:35:37] [INFO ] Input system was already deterministic with 1596 transitions.
[2025-06-02 12:35:37] [INFO ] Flatten gal took : 63 ms
[2025-06-02 12:35:37] [INFO ] Flatten gal took : 65 ms
[2025-06-02 12:35:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15780659159198002415.gal : 10 ms
[2025-06-02 12:35:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1440504247664654104.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15780659159198002415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1440504247664654104.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:36:07] [INFO ] Flatten gal took : 39 ms
[2025-06-02 12:36:07] [INFO ] Applying decomposition
[2025-06-02 12:36:07] [INFO ] Flatten gal took : 41 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/graph12624214389059099061.txt' '-o' '/tmp/graph12624214389059099061.bin' '-w' '/tmp/graph12624214389059099061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12624214389059099061.bin' '-l' '-1' '-v' '-w' '/tmp/graph12624214389059099061.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:36:07] [INFO ] Decomposing Gal with order
[2025-06-02 12:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:36:07] [INFO ] Removed a total of 2644 redundant transitions.
[2025-06-02 12:36:07] [INFO ] Flatten gal took : 84 ms
[2025-06-02 12:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1109 labels/synchronizations in 48 ms.
[2025-06-02 12:36:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4637571651607595921.gal : 15 ms
[2025-06-02 12:36:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17162152359726328450.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4637571651607595921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17162152359726328450.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 735 transition count 1908
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 735 transition count 1908
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 735 transition count 1902
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 70 place count 717 transition count 1854
Iterating global reduction 1 with 18 rules applied. Total rules applied 88 place count 717 transition count 1854
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 106 place count 699 transition count 1794
Iterating global reduction 1 with 18 rules applied. Total rules applied 124 place count 699 transition count 1794
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 142 place count 681 transition count 1740
Iterating global reduction 1 with 18 rules applied. Total rules applied 160 place count 681 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 178 place count 663 transition count 1702
Iterating global reduction 1 with 18 rules applied. Total rules applied 196 place count 663 transition count 1702
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 212 place count 647 transition count 1670
Iterating global reduction 1 with 16 rules applied. Total rules applied 228 place count 647 transition count 1670
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 243 place count 632 transition count 1640
Iterating global reduction 1 with 15 rules applied. Total rules applied 258 place count 632 transition count 1640
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 271 place count 619 transition count 1614
Iterating global reduction 1 with 13 rules applied. Total rules applied 284 place count 619 transition count 1614
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 293 place count 610 transition count 1596
Iterating global reduction 1 with 9 rules applied. Total rules applied 302 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 303 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 304 place count 609 transition count 1594
Applied a total of 304 rules in 243 ms. Remains 609 /758 variables (removed 149) and now considering 1594/1962 (removed 368) transitions.
[2025-06-02 12:36:38] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
// Phase 1: matrix 1065 rows 609 cols
[2025-06-02 12:36:38] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:39] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2025-06-02 12:36:39] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2025-06-02 12:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:36:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 12:36:43] [INFO ] Implicit Places using invariants and state equation in 4405 ms returned []
Implicit Place search using SMT with State Equation took 5442 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2025-06-02 12:36:43] [INFO ] Flow matrix only has 1065 transitions (discarded 529 similar events)
[2025-06-02 12:36:43] [INFO ] Invariant cache hit.
[2025-06-02 12:36:43] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1674 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/1674 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63959ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 63962ms
Starting structural reductions in LTL mode, iteration 1 : 609/758 places, 1594/1962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69653 ms. Remains : 609/758 places, 1594/1962 transitions.
[2025-06-02 12:37:47] [INFO ] Flatten gal took : 51 ms
[2025-06-02 12:37:47] [INFO ] Flatten gal took : 60 ms
[2025-06-02 12:37:47] [INFO ] Input system was already deterministic with 1594 transitions.
[2025-06-02 12:37:47] [INFO ] Flatten gal took : 59 ms
[2025-06-02 12:37:47] [INFO ] Flatten gal took : 60 ms
[2025-06-02 12:37:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12193041830034312901.gal : 10 ms
[2025-06-02 12:37:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6439928130766841587.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12193041830034312901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6439928130766841587.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:38:17] [INFO ] Flatten gal took : 35 ms
[2025-06-02 12:38:17] [INFO ] Applying decomposition
[2025-06-02 12:38:18] [INFO ] Flatten gal took : 36 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/graph656077903584754404.txt' '-o' '/tmp/graph656077903584754404.bin' '-w' '/tmp/graph656077903584754404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph656077903584754404.bin' '-l' '-1' '-v' '-w' '/tmp/graph656077903584754404.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:38:18] [INFO ] Decomposing Gal with order
[2025-06-02 12:38:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:38:18] [INFO ] Removed a total of 2638 redundant transitions.
[2025-06-02 12:38:18] [INFO ] Flatten gal took : 63 ms
[2025-06-02 12:38:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1182 labels/synchronizations in 43 ms.
[2025-06-02 12:38:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17822920580877663837.gal : 9 ms
[2025-06-02 12:38:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6524912059325785818.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17822920580877663837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6524912059325785818.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 736 transition count 1912
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 736 transition count 1912
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 736 transition count 1908
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 718 transition count 1862
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 718 transition count 1862
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 700 transition count 1802
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 700 transition count 1802
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 138 place count 682 transition count 1748
Iterating global reduction 1 with 18 rules applied. Total rules applied 156 place count 682 transition count 1748
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 173 place count 665 transition count 1712
Iterating global reduction 1 with 17 rules applied. Total rules applied 190 place count 665 transition count 1712
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 205 place count 650 transition count 1682
Iterating global reduction 1 with 15 rules applied. Total rules applied 220 place count 650 transition count 1682
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 234 place count 636 transition count 1654
Iterating global reduction 1 with 14 rules applied. Total rules applied 248 place count 636 transition count 1654
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 260 place count 624 transition count 1630
Iterating global reduction 1 with 12 rules applied. Total rules applied 272 place count 624 transition count 1630
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 281 place count 615 transition count 1612
Iterating global reduction 1 with 9 rules applied. Total rules applied 290 place count 615 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 614 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 614 transition count 1610
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 294 place count 614 transition count 1608
Applied a total of 294 rules in 447 ms. Remains 614 /758 variables (removed 144) and now considering 1608/1962 (removed 354) transitions.
[2025-06-02 12:38:48] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
// Phase 1: matrix 1075 rows 614 cols
[2025-06-02 12:38:48] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:38:49] [INFO ] Implicit Places using invariants in 989 ms returned []
[2025-06-02 12:38:49] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2025-06-02 12:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:38:50] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-02 12:38:55] [INFO ] Implicit Places using invariants and state equation in 5443 ms returned []
Implicit Place search using SMT with State Equation took 6433 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:38:55] [INFO ] Redundant transitions in 53 ms returned []
Running 1606 sub problems to find dead transitions.
[2025-06-02 12:38:55] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2025-06-02 12:38:55] [INFO ] Invariant cache hit.
[2025-06-02 12:38:55] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63702ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 63705ms
Starting structural reductions in SI_CTL mode, iteration 1 : 614/758 places, 1608/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70654 ms. Remains : 614/758 places, 1608/1962 transitions.
[2025-06-02 12:39:59] [INFO ] Flatten gal took : 50 ms
[2025-06-02 12:39:59] [INFO ] Flatten gal took : 58 ms
[2025-06-02 12:39:59] [INFO ] Input system was already deterministic with 1608 transitions.
[2025-06-02 12:39:59] [INFO ] Flatten gal took : 74 ms
RANDOM walk for 40055 steps (8 resets) in 340 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2025-06-02 12:39:59] [INFO ] Flatten gal took : 53 ms
[2025-06-02 12:39:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5105485621842956498.gal : 10 ms
[2025-06-02 12:39:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12242702525407906190.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5105485621842956498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12242702525407906190.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12242702525407906190.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1959
Interrupted probabilistic random walk after 326921 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326921 steps, saw 212203 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 12:40:02] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2025-06-02 12:40:02] [INFO ] Invariant cache hit.
[2025-06-02 12:40:02] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/341 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1143/1484 variables, 472/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 267/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1484 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1546 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1546 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1547 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1547 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/1683 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1689 variables, 4/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1689 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1689 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1689/1689 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/341 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1143/1484 variables, 472/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1484 variables, 267/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1484 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1484 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1546 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1959 after 1.1686e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1546/1689 variables, and 744 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 475/614 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1608/1608 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 614 transition count 1606
Applied a total of 2 rules in 209 ms. Remains 614 /614 variables (removed 0) and now considering 1606/1608 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 614/614 places, 1606/1608 transitions.
RANDOM walk for 4000019 steps (8 resets) in 15551 ms. (257 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 11529 ms. (346 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.1686e+06 after 3.12635e+10
Interrupted probabilistic random walk after 2276592 steps, run timeout after 21001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 2276592 steps, saw 1467215 distinct states, run finished after 21001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 12:40:33] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 614 cols
[2025-06-02 12:40:34] [INFO ] Computed 2 invariants in 5 ms
[2025-06-02 12:40:34] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/341 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1142/1483 variables, 472/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1483 variables, 267/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1483 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1545 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1545 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1546 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1546 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1546 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/1682 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1688 variables, 4/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1688 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1688 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/341 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1142/1483 variables, 472/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1483 variables, 267/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1483 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:35] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1483 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:35] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:35] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:36] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:36] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:36] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:36] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1483 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:37] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:38] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1483 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:39] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1483 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:40] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1545 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:43] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:43] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:43] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:43] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:43] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:44] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1545 variables, 20/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:45] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1545 variables, 3/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1545 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1546 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1546 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1546 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 136/1682 variables, 134/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:46] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1682 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:46] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:46] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:40:46] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1682 variables, 3/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1682 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1688 variables, 4/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1688 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1688 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 922 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 37/37 constraints]
After SMT, in 13554ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 274 ms.
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1606/1606 transitions.
Applied a total of 0 rules in 101 ms. Remains 614 /614 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 614/614 places, 1606/1606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1606/1606 transitions.
Applied a total of 0 rules in 103 ms. Remains 614 /614 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2025-06-02 12:40:48] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:40:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:40:48] [INFO ] Implicit Places using invariants in 767 ms returned []
[2025-06-02 12:40:48] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:40:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:40:49] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-02 12:40:52] [INFO ] Implicit Places using invariants and state equation in 3218 ms returned []
Implicit Place search using SMT with State Equation took 3988 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:40:52] [INFO ] Redundant transitions in 54 ms returned []
Running 1604 sub problems to find dead transitions.
[2025-06-02 12:40:52] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:40:52] [INFO ] Invariant cache hit.
[2025-06-02 12:40:52] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.12635e+10 after 3.68627e+17
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 5)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64341ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 64344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68507 ms. Remains : 614/614 places, 1606/1606 transitions.
RANDOM walk for 400047 steps (8 resets) in 1397 ms. (286 steps per ms) remains 1/3 properties
Running SMT prover for 1 properties.
[2025-06-02 12:41:56] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:41:57] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-02 12:41:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-02 12:41:57] [INFO ] After 388ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 12:41:57] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-02 12:41:57] [INFO ] After 64ms SMT Verify possible using 267 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 12:41:57] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 12:41:57] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:41:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-02 12:41:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 12:41:58] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 12:41:58] [INFO ] After 72ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 12:41:58] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 12:41:58] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000043 steps (8 resets) in 14960 ms. (267 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7975 ms. (501 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2105085 steps, run timeout after 18001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 2105085 steps, saw 1362387 distinct states, run finished after 18001 ms. (steps per millisecond=116 ) properties seen :0
[2025-06-02 12:42:22] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:42:22] [INFO ] Invariant cache hit.
[2025-06-02 12:42:22] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/341 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1142/1483 variables, 472/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1483 variables, 267/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1483 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1545 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1545 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1546 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1546 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1546 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/1682 variables, 134/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1688 variables, 4/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1688 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1688 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 338/341 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1142/1483 variables, 472/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1483 variables, 267/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1483 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:23] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1483 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:24] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:24] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:24] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:24] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:25] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:25] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1483 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:26] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:26] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1483 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:27] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1483 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:28] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1545 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:31] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:31] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:31] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:31] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:32] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:32] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:32] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:32] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:32] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:32] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:33] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:33] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:34] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:34] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:34] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:35] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:35] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:35] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:35] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:35] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1545 variables, 20/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:36] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:36] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:37] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1545 variables, 3/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1545 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1546 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1546 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1546 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 136/1682 variables, 134/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:42:40] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1682 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1682 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1688 variables, 4/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1688 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1688 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 919 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21503 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 35/35 constraints]
After SMT, in 22167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 271 ms.
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1606/1606 transitions.
Applied a total of 0 rules in 101 ms. Remains 614 /614 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 614/614 places, 1606/1606 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1606/1606 transitions.
Applied a total of 0 rules in 95 ms. Remains 614 /614 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2025-06-02 12:42:45] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:42:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:42:45] [INFO ] Implicit Places using invariants in 729 ms returned []
[2025-06-02 12:42:45] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:42:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:42:46] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-02 12:42:49] [INFO ] Implicit Places using invariants and state equation in 3335 ms returned []
Implicit Place search using SMT with State Equation took 4065 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:42:49] [INFO ] Redundant transitions in 54 ms returned []
Running 1604 sub problems to find dead transitions.
[2025-06-02 12:42:49] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:42:49] [INFO ] Invariant cache hit.
[2025-06-02 12:42:49] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1688 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64165ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 64168ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68392 ms. Remains : 614/614 places, 1606/1606 transitions.
RANDOM walk for 400043 steps (8 resets) in 1477 ms. (270 steps per ms) remains 2/3 properties
Running SMT prover for 2 properties.
[2025-06-02 12:43:53] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:43:53] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-02 12:43:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 12:43:54] [INFO ] After 393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-06-02 12:43:54] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-02 12:43:54] [INFO ] After 72ms SMT Verify possible using 267 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 12:43:54] [INFO ] After 200ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-02 12:43:54] [INFO ] After 711ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:43:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-02 12:43:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 12:43:55] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-02 12:43:55] [INFO ] After 122ms SMT Verify possible using 267 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 12:43:55] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 12:43:55] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
RANDOM walk for 466 steps (0 resets) in 5 ms. (77 steps per ms) remains 0/1 properties
RANDOM walk for 30826 steps (6 resets) in 180 ms. (170 steps per ms) remains 0/1 properties
RANDOM walk for 40007 steps (9 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (13 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324927 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324927 steps, saw 210908 distinct states, run finished after 3004 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 12:43:58] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2025-06-02 12:43:58] [INFO ] Invariant cache hit.
[2025-06-02 12:43:58] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 544/557 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/562 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 931/1493 variables, 468/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1493 variables, 266/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1493 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1555 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1555 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 133/1688 variables, 133/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1688 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1688 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1688/1688 variables, and 883 constraints, problems are : Problem set: 0 solved, 1 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 544/557 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/562 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 931/1493 variables, 468/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1493 variables, 266/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1493 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1555 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1555 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 133/1688 variables, 133/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1688 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1688/1688 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1606/1606 transitions.
Graph (complete) has 2681 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.4 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 421 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 421 transition count 1220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 389 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 420 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 420 transition count 1216
Applied a total of 391 rules in 125 ms. Remains 420 /614 variables (removed 194) and now considering 1216/1606 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 420/614 places, 1216/1606 transitions.
RANDOM walk for 40008 steps (8 resets) in 340 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34671 steps (7 resets) in 82 ms. (417 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 940 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 6 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 486 transition count 873
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 477 transition count 873
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 19 place count 477 transition count 802
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 161 place count 406 transition count 802
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 224 place count 343 transition count 739
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 343 transition count 739
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 413 place count 343 transition count 613
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 671 place count 214 transition count 484
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 735 place count 150 transition count 356
Iterating global reduction 3 with 64 rules applied. Total rules applied 799 place count 150 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 801 place count 150 transition count 354
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 864 place count 87 transition count 228
Iterating global reduction 4 with 63 rules applied. Total rules applied 927 place count 87 transition count 228
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 990 place count 24 transition count 102
Iterating global reduction 4 with 63 rules applied. Total rules applied 1053 place count 24 transition count 102
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1116 place count 24 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1116 place count 24 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1118 place count 23 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1120 place count 22 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1123 place count 22 transition count 34
Applied a total of 1123 rules in 142 ms. Remains 22 /614 variables (removed 592) and now considering 34/1606 (removed 1572) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 22 cols
[2025-06-02 12:44:00] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 12:44:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 12:44:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 12:44:00] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-02 12:44:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 12:44:00] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-02 12:44:00] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 12:44:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 12:44:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 12:44:00] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 12:44:00] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-02 12:44:00] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 12:44:00] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 12:44:00] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:44:00] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:44:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7966586853307834119.gal : 0 ms
[2025-06-02 12:44:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10542466690097212497.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7966586853307834119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10542466690097212497.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10542466690097212497.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 126
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :126 after 3730
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3730 after 472362
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :472362 after 1.62727e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.62727e+06 after 3.9371e+06
Detected timeout of ITS tools.
[2025-06-02 12:44:15] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:44:15] [INFO ] Applying decomposition
[2025-06-02 12:44:15] [INFO ] Flatten gal took : 4 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/graph17015764473816826240.txt' '-o' '/tmp/graph17015764473816826240.bin' '-w' '/tmp/graph17015764473816826240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17015764473816826240.bin' '-l' '-1' '-v' '-w' '/tmp/graph17015764473816826240.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:44:15] [INFO ] Decomposing Gal with order
[2025-06-02 12:44:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:44:15] [INFO ] Removed a total of 27 redundant transitions.
[2025-06-02 12:44:15] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:44:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 0 ms.
[2025-06-02 12:44:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14183371384943141551.gal : 1 ms
[2025-06-02 12:44:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16203023642760476089.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14183371384943141551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16203023642760476089.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16203023642760476089.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 126
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :126 after 7059
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7059 after 2.30066e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.30066e+06 after 2.15263e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.15263e+07 after 2.44525e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.44525e+07 after 2.91559e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.91559e+07 after 3.96937e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.96937e+07 after 6.52933e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30368 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 12:44:31] [INFO ] Flatten gal took : 34 ms
[2025-06-02 12:44:31] [INFO ] Applying decomposition
[2025-06-02 12:44:31] [INFO ] Flatten gal took : 34 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/graph1458209123013789048.txt' '-o' '/tmp/graph1458209123013789048.bin' '-w' '/tmp/graph1458209123013789048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1458209123013789048.bin' '-l' '-1' '-v' '-w' '/tmp/graph1458209123013789048.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:44:31] [INFO ] Decomposing Gal with order
[2025-06-02 12:44:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:44:31] [INFO ] Removed a total of 2662 redundant transitions.
[2025-06-02 12:44:31] [INFO ] Flatten gal took : 104 ms
[2025-06-02 12:44:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1119 labels/synchronizations in 64 ms.
[2025-06-02 12:44:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6721318083085032610.gal : 11 ms
[2025-06-02 12:44:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality491481227329120928.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6721318083085032610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality491481227329120928.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality491481227329120928.prop.
Detected timeout of ITS tools.
[2025-06-02 12:54:31] [INFO ] Flatten gal took : 49 ms
[2025-06-02 12:54:31] [INFO ] Flatten gal took : 49 ms
[2025-06-02 12:54:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14649189141616503151.gal : 8 ms
[2025-06-02 12:54:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12362410338063085896.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14649189141616503151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12362410338063085896.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:55:01] [INFO ] Flatten gal took : 35 ms
[2025-06-02 12:55:01] [INFO ] Applying decomposition
[2025-06-02 12:55:01] [INFO ] Flatten gal took : 35 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/graph15533000397417606118.txt' '-o' '/tmp/graph15533000397417606118.bin' '-w' '/tmp/graph15533000397417606118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15533000397417606118.bin' '-l' '-1' '-v' '-w' '/tmp/graph15533000397417606118.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:55:02] [INFO ] Decomposing Gal with order
[2025-06-02 12:55:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:55:02] [INFO ] Removed a total of 2656 redundant transitions.
[2025-06-02 12:55:02] [INFO ] Flatten gal took : 72 ms
[2025-06-02 12:55:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1191 labels/synchronizations in 37 ms.
[2025-06-02 12:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7014207970961234441.gal : 8 ms
[2025-06-02 12:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12259275654957318870.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7014207970961234441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12259275654957318870.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 758/758 places, 1962/1962 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 734 transition count 1906
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 734 transition count 1906
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 734 transition count 1900
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 715 transition count 1850
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 715 transition count 1850
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 111 place count 696 transition count 1788
Iterating global reduction 1 with 19 rules applied. Total rules applied 130 place count 696 transition count 1788
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 149 place count 677 transition count 1732
Iterating global reduction 1 with 19 rules applied. Total rules applied 168 place count 677 transition count 1732
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 186 place count 659 transition count 1694
Iterating global reduction 1 with 18 rules applied. Total rules applied 204 place count 659 transition count 1694
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 220 place count 643 transition count 1662
Iterating global reduction 1 with 16 rules applied. Total rules applied 236 place count 643 transition count 1662
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 251 place count 628 transition count 1632
Iterating global reduction 1 with 15 rules applied. Total rules applied 266 place count 628 transition count 1632
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 279 place count 615 transition count 1606
Iterating global reduction 1 with 13 rules applied. Total rules applied 292 place count 615 transition count 1606
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 301 place count 606 transition count 1588
Iterating global reduction 1 with 9 rules applied. Total rules applied 310 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 311 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 312 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 314 place count 605 transition count 1584
Applied a total of 314 rules in 692 ms. Remains 605 /758 variables (removed 153) and now considering 1584/1962 (removed 378) transitions.
[2025-06-02 12:55:32] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2025-06-02 12:55:32] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:55:33] [INFO ] Implicit Places using invariants in 637 ms returned []
[2025-06-02 12:55:33] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2025-06-02 12:55:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:55:34] [INFO ] State equation strengthened by 262 read => feed constraints.
[2025-06-02 12:55:39] [INFO ] Implicit Places using invariants and state equation in 6317 ms returned []
Implicit Place search using SMT with State Equation took 6965 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:55:39] [INFO ] Redundant transitions in 51 ms returned []
Running 1582 sub problems to find dead transitions.
[2025-06-02 12:55:39] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2025-06-02 12:55:39] [INFO ] Invariant cache hit.
[2025-06-02 12:55:39] [INFO ] State equation strengthened by 262 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 0/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63836ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 63839ms
Starting structural reductions in SI_CTL mode, iteration 1 : 605/758 places, 1584/1962 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71555 ms. Remains : 605/758 places, 1584/1962 transitions.
[2025-06-02 12:56:43] [INFO ] Flatten gal took : 51 ms
[2025-06-02 12:56:43] [INFO ] Flatten gal took : 58 ms
[2025-06-02 12:56:43] [INFO ] Input system was already deterministic with 1584 transitions.
[2025-06-02 12:56:44] [INFO ] Flatten gal took : 59 ms
[2025-06-02 12:56:44] [INFO ] Flatten gal took : 60 ms
[2025-06-02 12:56:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6883573249769806284.gal : 10 ms
[2025-06-02 12:56:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6911213367155182853.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6883573249769806284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6911213367155182853.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:57:14] [INFO ] Flatten gal took : 59 ms
[2025-06-02 12:57:14] [INFO ] Applying decomposition
[2025-06-02 12:57:14] [INFO ] Flatten gal took : 60 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/graph11690888510121787018.txt' '-o' '/tmp/graph11690888510121787018.bin' '-w' '/tmp/graph11690888510121787018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11690888510121787018.bin' '-l' '-1' '-v' '-w' '/tmp/graph11690888510121787018.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:57:14] [INFO ] Decomposing Gal with order
[2025-06-02 12:57:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:57:14] [INFO ] Removed a total of 2628 redundant transitions.
[2025-06-02 12:57:14] [INFO ] Flatten gal took : 105 ms
[2025-06-02 12:57:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1103 labels/synchronizations in 55 ms.
[2025-06-02 12:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability10143587250521534192.gal : 12 ms
[2025-06-02 12:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability533390970562487483.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10143587250521534192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability533390970562487483.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 12:57:44] [INFO ] Flatten gal took : 45 ms
[2025-06-02 12:57:44] [INFO ] Flatten gal took : 51 ms
[2025-06-02 12:57:44] [INFO ] Applying decomposition
[2025-06-02 12:57:44] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3492859188029019161.txt' '-o' '/tmp/graph3492859188029019161.bin' '-w' '/tmp/graph3492859188029019161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3492859188029019161.bin' '-l' '-1' '-v' '-w' '/tmp/graph3492859188029019161.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:57:45] [INFO ] Decomposing Gal with order
[2025-06-02 12:57:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:57:45] [INFO ] Removed a total of 3248 redundant transitions.
[2025-06-02 12:57:45] [INFO ] Flatten gal took : 98 ms
[2025-06-02 12:57:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1453 labels/synchronizations in 56 ms.
[2025-06-02 12:57:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8740629144366537142.gal : 11 ms
[2025-06-02 12:57:45] [INFO ] Time to serialize properties into /tmp/CTLFireability273608663654163820.ctl : 13 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8740629144366537142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability273608663654163820.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="FunctionPointer-PT-c032"
export BK_EXAMINATION="CTLFireability"
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 FunctionPointer-PT-c032, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-174867007400146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;