Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716489837187

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-c064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 18:43:58] [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]
[2024-05-23 18:43:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 18:43:58] [INFO ] Load time of PNML (sax parser for PT used): 393 ms
[2024-05-23 18:43:58] [INFO ] Transformed 2826 places.
[2024-05-23 18:43:58] [INFO ] Transformed 8960 transitions.
[2024-05-23 18:43:58] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 1198 places in 37 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 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 278 places :
Symmetric choice reduction at 1 with 278 rule applications. Total rules 295 place count 1333 transition count 3954
Iterating global reduction 1 with 278 rules applied. Total rules applied 573 place count 1333 transition count 3954
Ensure Unique test removed 508 transitions
Reduce isomorphic transitions removed 508 transitions.
Iterating post reduction 1 with 508 rules applied. Total rules applied 1081 place count 1333 transition count 3446
Discarding 132 places :
Symmetric choice reduction at 2 with 132 rule applications. Total rules 1213 place count 1201 transition count 3182
Iterating global reduction 2 with 132 rules applied. Total rules applied 1345 place count 1201 transition count 3182
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 1453 place count 1201 transition count 3074
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1467 place count 1187 transition count 3046
Iterating global reduction 3 with 14 rules applied. Total rules applied 1481 place count 1187 transition count 3046
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1494 place count 1174 transition count 3020
Iterating global reduction 3 with 13 rules applied. Total rules applied 1507 place count 1174 transition count 3020
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1520 place count 1161 transition count 2994
Iterating global reduction 3 with 13 rules applied. Total rules applied 1533 place count 1161 transition count 2994
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1545 place count 1149 transition count 2970
Iterating global reduction 3 with 12 rules applied. Total rules applied 1557 place count 1149 transition count 2970
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1568 place count 1138 transition count 2948
Iterating global reduction 3 with 11 rules applied. Total rules applied 1579 place count 1138 transition count 2948
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1589 place count 1128 transition count 2928
Iterating global reduction 3 with 10 rules applied. Total rules applied 1599 place count 1128 transition count 2928
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1607 place count 1120 transition count 2912
Iterating global reduction 3 with 8 rules applied. Total rules applied 1615 place count 1120 transition count 2912
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1634 place count 1101 transition count 2844
Iterating global reduction 3 with 19 rules applied. Total rules applied 1653 place count 1101 transition count 2844
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1677 place count 1077 transition count 2748
Iterating global reduction 3 with 24 rules applied. Total rules applied 1701 place count 1077 transition count 2748
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1723 place count 1055 transition count 2686
Iterating global reduction 3 with 22 rules applied. Total rules applied 1745 place count 1055 transition count 2686
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1766 place count 1034 transition count 2644
Iterating global reduction 3 with 21 rules applied. Total rules applied 1787 place count 1034 transition count 2644
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1807 place count 1014 transition count 2604
Iterating global reduction 3 with 20 rules applied. Total rules applied 1827 place count 1014 transition count 2604
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1846 place count 995 transition count 2566
Iterating global reduction 3 with 19 rules applied. Total rules applied 1865 place count 995 transition count 2566
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1884 place count 976 transition count 2528
Iterating global reduction 3 with 19 rules applied. Total rules applied 1903 place count 976 transition count 2528
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1911 place count 968 transition count 2512
Iterating global reduction 3 with 8 rules applied. Total rules applied 1919 place count 968 transition count 2512
Applied a total of 1919 rules in 1295 ms. Remains 968 /1628 variables (removed 660) and now considering 2512/5962 (removed 3450) transitions.
[2024-05-23 18:44:00] [INFO ] Flow matrix only has 1695 transitions (discarded 817 similar events)
// Phase 1: matrix 1695 rows 968 cols
[2024-05-23 18:44:00] [INFO ] Computed 2 invariants in 50 ms
[2024-05-23 18:44:01] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-05-23 18:44:01] [INFO ] Flow matrix only has 1695 transitions (discarded 817 similar events)
[2024-05-23 18:44:01] [INFO ] Invariant cache hit.
[2024-05-23 18:44:01] [INFO ] State equation strengthened by 393 read => feed constraints.
[2024-05-23 18:44:13] [INFO ] Implicit Places using invariants and state equation in 12282 ms returned []
Implicit Place search using SMT with State Equation took 13195 ms to find 0 implicit places.
Running 2510 sub problems to find dead transitions.
[2024-05-23 18:44:13] [INFO ] Flow matrix only has 1695 transitions (discarded 817 similar events)
[2024-05-23 18:44:13] [INFO ] Invariant cache hit.
[2024-05-23 18:44:13] [INFO ] State equation strengthened by 393 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/968 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2510 unsolved
SMT process timed out in 43994ms, After SMT, problems are : Problem set: 0 solved, 2510 unsolved
Search for dead transitions found 0 dead transitions in 44037ms
Starting structural reductions in LTL mode, iteration 1 : 968/1628 places, 2512/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58563 ms. Remains : 968/1628 places, 2512/5962 transitions.
Support contains 64 out of 968 places after structural reductions.
[2024-05-23 18:44:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-23 18:44:58] [INFO ] Flatten gal took : 178 ms
FORMULA FunctionPointer-PT-c064-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 18:44:58] [INFO ] Flatten gal took : 119 ms
[2024-05-23 18:44:58] [INFO ] Input system was already deterministic with 2512 transitions.
Support contains 56 out of 968 places (down from 64) after GAL structural reductions.
RANDOM walk for 40060 steps (8 resets) in 2969 ms. (13 steps per ms) remains 34/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
[2024-05-23 18:44:59] [INFO ] Flow matrix only has 1695 transitions (discarded 817 similar events)
[2024-05-23 18:44:59] [INFO ] Invariant cache hit.
[2024-05-23 18:44:59] [INFO ] State equation strengthened by 393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 378/420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 84/504 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1215/1719 variables, 504/506 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1719 variables, 330/836 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1719 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 8 (OVERLAPS) 735/2454 variables, 296/1132 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2454 variables, 63/1195 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2454 variables, 0/1195 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 204/2658 variables, 163/1358 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2658 variables, 0/1358 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 5/2663 variables, 5/1363 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2663 variables, 0/1363 constraints. Problems are: Problem set: 1 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2663/2663 variables, and 1363 constraints, problems are : Problem set: 1 solved, 30 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 968/968 constraints, ReadFeed: 393/393 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 378/418 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 84/502 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 1211/1713 variables, 502/504 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1713 variables, 330/834 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1713 variables, 0/834 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 733/2446 variables, 294/1128 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2446 variables, 63/1191 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2446 variables, 30/1221 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2446 variables, 0/1221 constraints. Problems are: Problem set: 1 solved, 30 unsolved
SMT process timed out in 10334ms, After SMT, problems are : Problem set: 1 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 2512/2512 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 953 transition count 2474
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 953 transition count 2474
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 42 place count 953 transition count 2462
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 938 transition count 2428
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 938 transition count 2428
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 80 place count 938 transition count 2420
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 94 place count 924 transition count 2374
Iterating global reduction 2 with 14 rules applied. Total rules applied 108 place count 924 transition count 2374
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 124 place count 908 transition count 2322
Iterating global reduction 2 with 16 rules applied. Total rules applied 140 place count 908 transition count 2322
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 157 place count 891 transition count 2276
Iterating global reduction 2 with 17 rules applied. Total rules applied 174 place count 891 transition count 2276
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 192 place count 873 transition count 2228
Iterating global reduction 2 with 18 rules applied. Total rules applied 210 place count 873 transition count 2228
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 226 place count 857 transition count 2190
Iterating global reduction 2 with 16 rules applied. Total rules applied 242 place count 857 transition count 2190
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 258 place count 841 transition count 2158
Iterating global reduction 2 with 16 rules applied. Total rules applied 274 place count 841 transition count 2158
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 287 place count 828 transition count 2132
Iterating global reduction 2 with 13 rules applied. Total rules applied 300 place count 828 transition count 2132
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 308 place count 820 transition count 2116
Iterating global reduction 2 with 8 rules applied. Total rules applied 316 place count 820 transition count 2116
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 322 place count 814 transition count 2104
Iterating global reduction 2 with 6 rules applied. Total rules applied 328 place count 814 transition count 2104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 331 place count 811 transition count 2098
Iterating global reduction 2 with 3 rules applied. Total rules applied 334 place count 811 transition count 2098
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 2 with 44 rules applied. Total rules applied 378 place count 811 transition count 2054
Applied a total of 378 rules in 807 ms. Remains 811 /968 variables (removed 157) and now considering 2054/2512 (removed 458) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 807 ms. Remains : 811/968 places, 2054/2512 transitions.
RANDOM walk for 40028 steps (8 resets) in 393 ms. (101 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 133135 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :2 out of 29
Probabilistic random walk after 133135 steps, saw 86434 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :2
[2024-05-23 18:45:13] [INFO ] Flow matrix only has 1395 transitions (discarded 659 similar events)
// Phase 1: matrix 1395 rows 811 cols
[2024-05-23 18:45:13] [INFO ] Computed 2 invariants in 19 ms
[2024-05-23 18:45:13] [INFO ] State equation strengthened by 341 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 378/415 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 47/462 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1070/1532 variables, 462/464 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1532 variables, 277/741 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1532 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 545/2077 variables, 234/975 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2077 variables, 64/1039 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2077 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 125/2202 variables, 111/1150 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2202 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 4/2206 variables, 4/1154 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2206 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 0/2206 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2206/2206 variables, and 1154 constraints, problems are : Problem set: 0 solved, 27 unsolved in 4593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 811/811 constraints, ReadFeed: 341/341 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 378/415 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 47/462 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1070/1532 variables, 462/464 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1532 variables, 277/741 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1532 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 545/2077 variables, 234/975 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2077 variables, 64/1039 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2077 variables, 27/1066 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2077 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 125/2202 variables, 111/1177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2202 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 4/2206 variables, 4/1181 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2206 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/2206 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2206/2206 variables, and 1181 constraints, problems are : Problem set: 0 solved, 27 unsolved in 14055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 811/811 constraints, ReadFeed: 341/341 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 18869ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 37 out of 811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 811/811 places, 2054/2054 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 808 transition count 2042
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 808 transition count 2042
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 805 transition count 2036
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 805 transition count 2036
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 803 transition count 2032
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 803 transition count 2032
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 801 transition count 2028
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 801 transition count 2028
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 799 transition count 2024
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 799 transition count 2024
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 797 transition count 2020
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 797 transition count 2020
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 794 transition count 2010
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 794 transition count 2010
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 792 transition count 2006
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 792 transition count 2006
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 790 transition count 2002
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 790 transition count 2002
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 788 transition count 1998
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 788 transition count 1998
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 786 transition count 1994
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 786 transition count 1994
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 784 transition count 1990
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 784 transition count 1990
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 782 transition count 1986
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 782 transition count 1986
Applied a total of 58 rules in 442 ms. Remains 782 /811 variables (removed 29) and now considering 1986/2054 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 782/811 places, 1986/2054 transitions.
RANDOM walk for 40134 steps (8 resets) in 226 ms. (176 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 5 ms. (667 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 22/22 properties
[2024-05-23 18:45:33] [INFO ] Flow matrix only has 1348 transitions (discarded 638 similar events)
// Phase 1: matrix 1348 rows 782 cols
[2024-05-23 18:45:33] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 18:45:33] [INFO ] State equation strengthened by 331 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 380/411 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 41/452 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1037/1489 variables, 452/454 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1489 variables, 266/720 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1489 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 524/2013 variables, 222/942 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2013 variables, 65/1007 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2013 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 114/2127 variables, 105/1112 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2127 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 3/2130 variables, 3/1115 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2130 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/2130 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2130/2130 variables, and 1115 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 782/782 constraints, ReadFeed: 331/331 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 380/411 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 41/452 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1037/1489 variables, 452/454 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1489 variables, 266/720 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1489 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 524/2013 variables, 222/942 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2013 variables, 65/1007 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2013 variables, 22/1029 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2013 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 114/2127 variables, 105/1134 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2127 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 3/2130 variables, 3/1137 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2130 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 0/2130 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2130/2130 variables, and 1137 constraints, problems are : Problem set: 0 solved, 22 unsolved in 10522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 782/782 constraints, ReadFeed: 331/331 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 14364ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 18 properties in 32223 ms.
Support contains 7 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 1986/1986 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 763 transition count 1940
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 763 transition count 1940
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 763 transition count 1934
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 64 place count 743 transition count 1888
Iterating global reduction 1 with 20 rules applied. Total rules applied 84 place count 743 transition count 1888
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 743 transition count 1884
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 106 place count 725 transition count 1834
Iterating global reduction 2 with 18 rules applied. Total rules applied 124 place count 725 transition count 1834
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 140 place count 709 transition count 1802
Iterating global reduction 2 with 16 rules applied. Total rules applied 156 place count 709 transition count 1802
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 173 place count 692 transition count 1764
Iterating global reduction 2 with 17 rules applied. Total rules applied 190 place count 692 transition count 1764
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 206 place count 676 transition count 1730
Iterating global reduction 2 with 16 rules applied. Total rules applied 222 place count 676 transition count 1730
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 237 place count 661 transition count 1700
Iterating global reduction 2 with 15 rules applied. Total rules applied 252 place count 661 transition count 1700
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 265 place count 648 transition count 1674
Iterating global reduction 2 with 13 rules applied. Total rules applied 278 place count 648 transition count 1674
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 288 place count 638 transition count 1654
Iterating global reduction 2 with 10 rules applied. Total rules applied 298 place count 638 transition count 1654
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 301 place count 635 transition count 1648
Iterating global reduction 2 with 3 rules applied. Total rules applied 304 place count 635 transition count 1648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 307 place count 632 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 310 place count 632 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 311 place count 631 transition count 1640
Iterating global reduction 2 with 1 rules applied. Total rules applied 312 place count 631 transition count 1640
Applied a total of 312 rules in 323 ms. Remains 631 /782 variables (removed 151) and now considering 1640/1986 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 631/782 places, 1640/1986 transitions.
RANDOM walk for 40044 steps (8 resets) in 114 ms. (348 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 81 ms. (487 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 22 ms. (1739 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 3/3 properties
[2024-05-23 18:46:20] [INFO ] Flow matrix only has 1099 transitions (discarded 541 similar events)
// Phase 1: matrix 1099 rows 631 cols
[2024-05-23 18:46:20] [INFO ] Computed 2 invariants in 22 ms
[2024-05-23 18:46:20] [INFO ] State equation strengthened by 274 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 359/374 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1142/1516 variables, 472/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1516 variables, 268/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1516 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1578 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1578 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 144/1722 variables, 139/902 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1722 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/1727 variables, 3/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1727 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/1730 variables, 2/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1730 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1730 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1730/1730 variables, and 907 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 631/631 constraints, ReadFeed: 274/274 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 359/374 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1142/1516 variables, 472/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1516 variables, 268/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1516 variables, 3/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1516 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1578 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1578 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 144/1722 variables, 139/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1722 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/1727 variables, 3/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1727 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/1730 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1730 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1730 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1730/1730 variables, and 910 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 631/631 constraints, ReadFeed: 274/274 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2593ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1640/1640 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 630 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 630 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 629 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 629 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 628 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 628 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 627 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 627 transition count 1632
Applied a total of 8 rules in 141 ms. Remains 627 /631 variables (removed 4) and now considering 1632/1640 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 627/631 places, 1632/1640 transitions.
RANDOM walk for 40005 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (19 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 252836 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 3
Probabilistic random walk after 252836 steps, saw 164123 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-23 18:46:26] [INFO ] Flow matrix only has 1092 transitions (discarded 540 similar events)
// Phase 1: matrix 1092 rows 627 cols
[2024-05-23 18:46:26] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 18:46:26] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 355/369 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1137/1506 variables, 470/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1506 variables, 266/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1506 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1568 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1568 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 143/1711 variables, 138/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1711 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/1716 variables, 3/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1716 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/1719 variables, 2/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1719 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1719 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 900 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 627/627 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 355/369 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1137/1506 variables, 470/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1506 variables, 266/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1506 variables, 3/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1506 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1568 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1568 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 143/1711 variables, 138/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1711 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/1716 variables, 3/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1716 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/1719 variables, 2/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1719 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1719 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 903 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 627/627 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2602ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 230 ms.
Support contains 4 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 1632/1632 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 626 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 626 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 625 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 625 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 624 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 624 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 623 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 623 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 622 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 622 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 621 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 621 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 618 transition count 1612
Applied a total of 18 rules in 225 ms. Remains 618 /627 variables (removed 9) and now considering 1612/1632 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 618/627 places, 1612/1632 transitions.
RANDOM walk for 40076 steps (8 resets) in 102 ms. (389 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 294248 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 294248 steps, saw 190999 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-23 18:46:32] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
// Phase 1: matrix 1078 rows 618 cols
[2024-05-23 18:46:32] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 18:46:32] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 347/358 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1128/1486 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1486 variables, 264/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1486 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1548 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1548 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 140/1688 variables, 136/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1688 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/1693 variables, 3/886 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1693 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1696 variables, 2/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1696 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1696 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1696/1696 variables, and 888 constraints, problems are : Problem set: 0 solved, 2 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 347/358 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1128/1486 variables, 466/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1486 variables, 264/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1486 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1486 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 62/1548 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1548 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 140/1688 variables, 136/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1688 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/1693 variables, 3/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1696 variables, 2/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1696 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1696 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 890 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1728ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 77 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 618/618 places, 1612/1612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 74 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 18:46:34] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 18:46:34] [INFO ] Invariant cache hit.
[2024-05-23 18:46:34] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-23 18:46:34] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 18:46:34] [INFO ] Invariant cache hit.
[2024-05-23 18:46:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 18:46:36] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2024-05-23 18:46:36] [INFO ] Redundant transitions in 74 ms returned []
Running 1610 sub problems to find dead transitions.
[2024-05-23 18:46:36] [INFO ] Flow matrix only has 1078 transitions (discarded 534 similar events)
[2024-05-23 18:46:36] [INFO ] Invariant cache hit.
[2024-05-23 18:46:36] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1696 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1696 variables, 268/888 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 2498 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69332ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71805 ms. Remains : 618/618 places, 1612/1612 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-23 18:47:46] [INFO ] Flatten gal took : 93 ms
[2024-05-23 18:47:46] [INFO ] Flatten gal took : 79 ms
[2024-05-23 18:47:46] [INFO ] Input system was already deterministic with 2512 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 2512/2512 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 933 transition count 2414
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 933 transition count 2414
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 84 place count 933 transition count 2400
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 119 place count 898 transition count 2316
Iterating global reduction 1 with 35 rules applied. Total rules applied 154 place count 898 transition count 2316
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 162 place count 898 transition count 2308
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 193 place count 867 transition count 2210
Iterating global reduction 2 with 31 rules applied. Total rules applied 224 place count 867 transition count 2210
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 256 place count 835 transition count 2112
Iterating global reduction 2 with 32 rules applied. Total rules applied 288 place count 835 transition count 2112
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 323 place count 800 transition count 2022
Iterating global reduction 2 with 35 rules applied. Total rules applied 358 place count 800 transition count 2022
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 394 place count 764 transition count 1930
Iterating global reduction 2 with 36 rules applied. Total rules applied 430 place count 764 transition count 1930
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 465 place count 729 transition count 1850
Iterating global reduction 2 with 35 rules applied. Total rules applied 500 place count 729 transition count 1850
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 533 place count 696 transition count 1782
Iterating global reduction 2 with 33 rules applied. Total rules applied 566 place count 696 transition count 1782
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 594 place count 668 transition count 1726
Iterating global reduction 2 with 28 rules applied. Total rules applied 622 place count 668 transition count 1726
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 637 place count 653 transition count 1696
Iterating global reduction 2 with 15 rules applied. Total rules applied 652 place count 653 transition count 1696
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 663 place count 642 transition count 1674
Iterating global reduction 2 with 11 rules applied. Total rules applied 674 place count 642 transition count 1674
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 679 place count 637 transition count 1664
Iterating global reduction 2 with 5 rules applied. Total rules applied 684 place count 637 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 685 place count 636 transition count 1662
Iterating global reduction 2 with 1 rules applied. Total rules applied 686 place count 636 transition count 1662
Applied a total of 686 rules in 345 ms. Remains 636 /968 variables (removed 332) and now considering 1662/2512 (removed 850) transitions.
[2024-05-23 18:47:46] [INFO ] Flow matrix only has 1112 transitions (discarded 550 similar events)
// Phase 1: matrix 1112 rows 636 cols
[2024-05-23 18:47:46] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 18:47:47] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-23 18:47:47] [INFO ] Flow matrix only has 1112 transitions (discarded 550 similar events)
[2024-05-23 18:47:47] [INFO ] Invariant cache hit.
[2024-05-23 18:47:47] [INFO ] State equation strengthened by 274 read => feed constraints.
[2024-05-23 18:47:48] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2024-05-23 18:47:48] [INFO ] Flow matrix only has 1112 transitions (discarded 550 similar events)
[2024-05-23 18:47:48] [INFO ] Invariant cache hit.
[2024-05-23 18:47:48] [INFO ] State equation strengthened by 274 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/1748 variables, and 2 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/636 constraints, ReadFeed: 0/274 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 3 (OVERLAPS) 1112/1748 variables, 636/638 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1748 variables, 274/912 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1748/1748 variables, and 2572 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 31328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 636/636 constraints, ReadFeed: 274/274 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
After SMT, in 69116ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 69139ms
Starting structural reductions in LTL mode, iteration 1 : 636/968 places, 1662/2512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71434 ms. Remains : 636/968 places, 1662/2512 transitions.
[2024-05-23 18:48:57] [INFO ] Flatten gal took : 40 ms
[2024-05-23 18:48:58] [INFO ] Flatten gal took : 46 ms
[2024-05-23 18:48:58] [INFO ] Input system was already deterministic with 1662 transitions.
[2024-05-23 18:48:58] [INFO ] Flatten gal took : 42 ms
[2024-05-23 18:48:58] [INFO ] Flatten gal took : 42 ms
[2024-05-23 18:48:58] [INFO ] Time to serialize gal into /tmp/CTLFireability615692561918754658.gal : 27 ms
[2024-05-23 18:48:58] [INFO ] Time to serialize properties into /tmp/CTLFireability590409792902035361.ctl : 4 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability615692561918754658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability590409792902035361.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-23 18:49:28] [INFO ] Flatten gal took : 41 ms
[2024-05-23 18:49:28] [INFO ] Applying decomposition
[2024-05-23 18:49:28] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph13802195758648456638.txt' '-o' '/tmp/graph13802195758648456638.bin' '-w' '/tmp/graph13802195758648456638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13802195758648456638.bin' '-l' '-1' '-v' '-w' '/tmp/graph13802195758648456638.weights' '-q' '0' '-e' '0.001'
[2024-05-23 18:49:28] [INFO ] Decomposing Gal with order
[2024-05-23 18:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 18:49:28] [INFO ] Removed a total of 2771 redundant transitions.
[2024-05-23 18:49:29] [INFO ] Flatten gal took : 165 ms
[2024-05-23 18:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1207 labels/synchronizations in 96 ms.
[2024-05-23 18:49:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10282875617814071480.gal : 23 ms
[2024-05-23 18:49:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13374734884063980249.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10282875617814071480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13374734884063980249.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 968/968 places, 2512/2512 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 930 transition count 2404
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 930 transition count 2404
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 90 place count 930 transition count 2390
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 128 place count 892 transition count 2298
Iterating global reduction 1 with 38 rules applied. Total rules applied 166 place count 892 transition count 2298
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 174 place count 892 transition count 2290
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 208 place count 858 transition count 2182
Iterating global reduction 2 with 34 rules applied. Total rules applied 242 place count 858 transition count 2182
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 277 place count 823 transition count 2074
Iterating global reduction 2 with 35 rules applied. Total rules applied 312 place count 823 transition count 2074
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 350 place count 785 transition count 1978
Iterating global reduction 2 with 38 rules applied. Total rules applied 388 place count 785 transition count 1978
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 427 place count 746 transition count 1880
Iterating global reduction 2 with 39 rules applied. Total rules applied 466 place count 746 transition count 1880
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 502 place count 710 transition count 1800
Iterating global reduction 2 with 36 rules applied. Total rules applied 538 place count 710 transition count 1800
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 571 place count 677 transition count 1734
Iterating global reduction 2 with 33 rules applied. Total rules applied 604 place count 677 transition count 1734
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 632 place count 649 transition count 1678
Iterating global reduction 2 with 28 rules applied. Total rules applied 660 place count 649 transition count 1678
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 673 place count 636 transition count 1652
Iterating global reduction 2 with 13 rules applied. Total rules applied 686 place count 636 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 696 place count 626 transition count 1632
Iterating global reduction 2 with 10 rules applied. Total rules applied 706 place count 626 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 710 place count 622 transition count 1624
Iterating global reduction 2 with 4 rules applied. Total rules applied 714 place count 622 transition count 1624
Applied a total of 714 rules in 255 ms. Remains 622 /968 variables (removed 346) and now considering 1624/2512 (removed 888) transitions.
[2024-05-23 18:49:59] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 622 cols
[2024-05-23 18:49:59] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 18:50:00] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-05-23 18:50:00] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 18:50:00] [INFO ] Invariant cache hit.
[2024-05-23 18:50:00] [INFO ] State equation strengthened by 269 read => feed constraints.
[2024-05-23 18:50:01] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
Running 1622 sub problems to find dead transitions.
[2024-05-23 18:50:01] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 18:50:01] [INFO ] Invariant cache hit.
[2024-05-23 18:50:02] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1707 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1707 variables, 622/624 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1707 variables, 269/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1707/1707 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30885 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 68569ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 68584ms
Starting structural reductions in LTL mode, iteration 1 : 622/968 places, 1624/2512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71334 ms. Remains : 622/968 places, 1624/2512 transitions.
[2024-05-23 18:51:10] [INFO ] Flatten gal took : 67 ms
[2024-05-23 18:51:10] [INFO ] Flatten gal took : 59 ms
[2024-05-23 18:51:10] [INFO ] Input system was already deterministic with 1624 transitions.
[2024-05-23 18:51:10] [INFO ] Flatten gal took : 41 ms
[2024-05-23 18:51:11] [INFO ] Flatten gal took : 112 ms
[2024-05-23 18:51:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15685390316008250801.gal : 29 ms
[2024-05-23 18:51:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3848598485362537705.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15685390316008250801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3848598485362537705.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.
[2024-05-23 18:51:41] [INFO ] Flatten gal took : 36 ms
[2024-05-23 18:51:41] [INFO ] Applying decomposition
[2024-05-23 18:51:41] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph17839132866303534354.txt' '-o' '/tmp/graph17839132866303534354.bin' '-w' '/tmp/graph17839132866303534354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17839132866303534354.bin' '-l' '-1' '-v' '-w' '/tmp/graph17839132866303534354.weights' '-q' '0' '-e' '0.001'
[2024-05-23 18:51:41] [INFO ] Decomposing Gal with order
[2024-05-23 18:51:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 18:51:41] [INFO ] Removed a total of 2704 redundant transitions.
[2024-05-23 18:51:41] [INFO ] Flatten gal took : 136 ms
[2024-05-23 18:51:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1185 labels/synchronizations in 64 ms.
[2024-05-23 18:51:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13935753265036416571.gal : 26 ms
[2024-05-23 18:51:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13912383259702848127.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13935753265036416571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13912383259702848127.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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 : 968/968 places, 2512/2512 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 931 transition count 2406
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 931 transition count 2406
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 86 place count 931 transition count 2394
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 124 place count 893 transition count 2302
Iterating global reduction 1 with 38 rules applied. Total rules applied 162 place count 893 transition count 2302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 170 place count 893 transition count 2294
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 204 place count 859 transition count 2188
Iterating global reduction 2 with 34 rules applied. Total rules applied 238 place count 859 transition count 2188
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 273 place count 824 transition count 2082
Iterating global reduction 2 with 35 rules applied. Total rules applied 308 place count 824 transition count 2082
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 346 place count 786 transition count 1986
Iterating global reduction 2 with 38 rules applied. Total rules applied 384 place count 786 transition count 1986
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 423 place count 747 transition count 1888
Iterating global reduction 2 with 39 rules applied. Total rules applied 462 place count 747 transition count 1888
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 499 place count 710 transition count 1804
Iterating global reduction 2 with 37 rules applied. Total rules applied 536 place count 710 transition count 1804
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 570 place count 676 transition count 1734
Iterating global reduction 2 with 34 rules applied. Total rules applied 604 place count 676 transition count 1734
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 632 place count 648 transition count 1678
Iterating global reduction 2 with 28 rules applied. Total rules applied 660 place count 648 transition count 1678
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 675 place count 633 transition count 1648
Iterating global reduction 2 with 15 rules applied. Total rules applied 690 place count 633 transition count 1648
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 701 place count 622 transition count 1626
Iterating global reduction 2 with 11 rules applied. Total rules applied 712 place count 622 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 717 place count 617 transition count 1616
Iterating global reduction 2 with 5 rules applied. Total rules applied 722 place count 617 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 723 place count 616 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 724 place count 616 transition count 1614
Applied a total of 724 rules in 321 ms. Remains 616 /968 variables (removed 352) and now considering 1614/2512 (removed 898) transitions.
[2024-05-23 18:52:12] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
// Phase 1: matrix 1078 rows 616 cols
[2024-05-23 18:52:12] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 18:52:12] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-23 18:52:12] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 18:52:12] [INFO ] Invariant cache hit.
[2024-05-23 18:52:12] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 18:52:13] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
Running 1612 sub problems to find dead transitions.
[2024-05-23 18:52:13] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2024-05-23 18:52:13] [INFO ] Invariant cache hit.
[2024-05-23 18:52:14] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/616 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/616 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1078/1694 variables, 616/618 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 267/885 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2497 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 616/616 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 68654ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 68668ms
Starting structural reductions in LTL mode, iteration 1 : 616/968 places, 1614/2512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70917 ms. Remains : 616/968 places, 1614/2512 transitions.
[2024-05-23 18:53:22] [INFO ] Flatten gal took : 33 ms
[2024-05-23 18:53:22] [INFO ] Flatten gal took : 38 ms
[2024-05-23 18:53:22] [INFO ] Input system was already deterministic with 1614 transitions.
[2024-05-23 18:53:22] [INFO ] Flatten gal took : 73 ms
[2024-05-23 18:53:22] [INFO ] Flatten gal took : 73 ms
[2024-05-23 18:53:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16982162485999082324.gal : 6 ms
[2024-05-23 18:53:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1438422017371174894.ctl : 9 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16982162485999082324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1438422017371174894.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.

BK_STOP 1716490428155

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-c064"
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-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c064, 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 r180-tall-171640603100314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;