About the Execution of ITS-Tools for CO4-PT-21
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | T?TFFFTTTTTFTTF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600537.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CO4-PT-21, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600537
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 344K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-21-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-21-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748611579173
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 13:26:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 13:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:26:20] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-05-30 13:26:20] [INFO ] Transformed 1400 places.
[2025-05-30 13:26:20] [INFO ] Transformed 1583 transitions.
[2025-05-30 13:26:20] [INFO ] Found NUPN structural information;
[2025-05-30 13:26:20] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 307 places in 17 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1072 transition count 1233
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 182 place count 914 transition count 1075
Iterating global reduction 1 with 158 rules applied. Total rules applied 340 place count 914 transition count 1075
Discarding 134 places :
Symmetric choice reduction at 1 with 134 rule applications. Total rules 474 place count 780 transition count 941
Iterating global reduction 1 with 134 rules applied. Total rules applied 608 place count 780 transition count 941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 611 place count 780 transition count 938
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 674 place count 717 transition count 875
Iterating global reduction 2 with 63 rules applied. Total rules applied 737 place count 717 transition count 875
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 782 place count 672 transition count 830
Iterating global reduction 2 with 45 rules applied. Total rules applied 827 place count 672 transition count 830
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 830 place count 672 transition count 827
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 852 place count 650 transition count 805
Iterating global reduction 3 with 22 rules applied. Total rules applied 874 place count 650 transition count 805
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 876 place count 650 transition count 803
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 884 place count 642 transition count 795
Iterating global reduction 4 with 8 rules applied. Total rules applied 892 place count 642 transition count 795
Applied a total of 892 rules in 354 ms. Remains 642 /1093 variables (removed 451) and now considering 795/1236 (removed 441) transitions.
// Phase 1: matrix 795 rows 642 cols
[2025-05-30 13:26:21] [INFO ] Computed 5 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:26:21] [INFO ] Implicit Places using invariants in 372 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 408 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 641/1093 places, 795/1236 transitions.
Applied a total of 0 rules in 15 ms. Remains 641 /641 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 792 ms. Remains : 641/1093 places, 795/1236 transitions.
Support contains 41 out of 641 places after structural reductions.
[2025-05-30 13:26:21] [INFO ] Flatten gal took : 70 ms
[2025-05-30 13:26:21] [INFO ] Flatten gal took : 39 ms
[2025-05-30 13:26:21] [INFO ] Input system was already deterministic with 795 transitions.
Support contains 40 out of 641 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (40 resets) in 1459 ms. (27 steps per ms) remains 22/28 properties
BEST_FIRST walk for 4003 steps (19 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (20 resets) in 28 ms. (138 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (19 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 21 ms. (181 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (18 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (16 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (17 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (19 resets) in 43 ms. (91 steps per ms) remains 19/19 properties
// Phase 1: matrix 795 rows 641 cols
[2025-05-30 13:26:22] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 53/80 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 239/319 variables, 53/80 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 12/331 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 17/348 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 514/862 variables, 243/328 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/862 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 396/1258 variables, 204/532 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 138/1396 variables, 87/619 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1396 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 33/1429 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1429 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 7/1436 variables, 6/645 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1436 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/1436 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1436/1436 variables, and 645 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2608 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 53/80 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 239/319 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 12/331 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 17/348 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 514/862 variables, 243/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/862 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 396/1258 variables, 204/551 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1258 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 138/1396 variables, 87/638 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1396 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 33/1429 variables, 20/658 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1429 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 7/1436 variables, 6/664 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1436/1436 variables, and 664 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 641/641 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7674ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 641 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 641/641 places, 795/795 transitions.
Graph (trivial) has 645 edges and 641 vertex of which 3 / 641 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 987 edges and 639 vertex of which 620 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 303 rules applied. Total rules applied 305 place count 620 transition count 475
Reduce places removed 278 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 585 place count 342 transition count 473
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 590 place count 341 transition count 469
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 594 place count 337 transition count 469
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 594 place count 337 transition count 413
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 706 place count 281 transition count 413
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 708 place count 279 transition count 411
Iterating global reduction 4 with 2 rules applied. Total rules applied 710 place count 279 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 710 place count 279 transition count 410
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 712 place count 278 transition count 410
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 713 place count 277 transition count 409
Iterating global reduction 4 with 1 rules applied. Total rules applied 714 place count 277 transition count 409
Performed 88 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 890 place count 189 transition count 307
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 897 place count 189 transition count 300
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 906 place count 180 transition count 291
Iterating global reduction 5 with 9 rules applied. Total rules applied 915 place count 180 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 916 place count 180 transition count 290
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 922 place count 177 transition count 287
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 1008 place count 134 transition count 290
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1026 place count 134 transition count 272
Discarding 29 places :
Symmetric choice reduction at 7 with 29 rule applications. Total rules 1055 place count 105 transition count 214
Iterating global reduction 7 with 29 rules applied. Total rules applied 1084 place count 105 transition count 214
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1098 place count 105 transition count 200
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1103 place count 100 transition count 185
Iterating global reduction 8 with 5 rules applied. Total rules applied 1108 place count 100 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1110 place count 100 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1116 place count 100 transition count 177
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 1123 place count 100 transition count 170
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1131 place count 93 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1133 place count 93 transition count 167
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1137 place count 93 transition count 167
Graph (complete) has 270 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 1138 place count 92 transition count 167
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1139 place count 92 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1140 place count 92 transition count 166
Graph (complete) has 267 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 1141 place count 91 transition count 166
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1142 place count 91 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1143 place count 91 transition count 165
Graph (complete) has 264 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 1144 place count 90 transition count 165
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1145 place count 90 transition count 164
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 1149 place count 90 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1150 place count 90 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1151 place count 89 transition count 162
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t68.t72.t697.t760 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 44 edges and 85 vertex of which 5 / 85 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 3 rules applied. Total rules applied 1154 place count 82 transition count 160
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 1161 place count 82 transition count 153
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 1163 place count 80 transition count 150
Iterating global reduction 19 with 2 rules applied. Total rules applied 1165 place count 80 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1166 place count 80 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 1187 place count 80 transition count 128
Discarding 6 places :
Symmetric choice reduction at 20 with 6 rule applications. Total rules 1193 place count 74 transition count 122
Iterating global reduction 20 with 6 rules applied. Total rules applied 1199 place count 74 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 1204 place count 74 transition count 117
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 1206 place count 72 transition count 115
Iterating global reduction 21 with 2 rules applied. Total rules applied 1208 place count 72 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 1210 place count 72 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1211 place count 72 transition count 112
Free-agglomeration rule applied 17 times.
Iterating global reduction 22 with 17 rules applied. Total rules applied 1228 place count 72 transition count 95
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 22 with 17 rules applied. Total rules applied 1245 place count 55 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 23 with 5 rules applied. Total rules applied 1250 place count 55 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1251 place count 55 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 1252 place count 55 transition count 93
Applied a total of 1252 rules in 164 ms. Remains 55 /641 variables (removed 586) and now considering 93/795 (removed 702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 55/641 places, 93/795 transitions.
RANDOM walk for 40000 steps (8 resets) in 581 ms. (68 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/2 properties
BEST_FIRST walk for 30040 steps (6 resets) in 21 ms. (1365 steps per ms) remains 0/1 properties
[2025-05-30 13:26:30] [INFO ] Flatten gal took : 46 ms
[2025-05-30 13:26:30] [INFO ] Flatten gal took : 28 ms
[2025-05-30 13:26:30] [INFO ] Input system was already deterministic with 795 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 990 edges and 641 vertex of which 629 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 27 place count 616 transition count 769
Iterating global reduction 1 with 23 rules applied. Total rules applied 50 place count 616 transition count 769
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 599 transition count 752
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 599 transition count 752
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 93 place count 590 transition count 743
Iterating global reduction 1 with 9 rules applied. Total rules applied 102 place count 590 transition count 743
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 585 transition count 738
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 585 transition count 738
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 583 transition count 736
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 583 transition count 736
Applied a total of 116 rules in 79 ms. Remains 583 /641 variables (removed 58) and now considering 736/795 (removed 59) transitions.
// Phase 1: matrix 736 rows 583 cols
[2025-05-30 13:26:30] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:26:30] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-30 13:26:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:26:31] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2025-05-30 13:26:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 587 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 735/1322 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1322 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in LTL mode, iteration 1 : 583/641 places, 736/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60727 ms. Remains : 583/641 places, 736/795 transitions.
[2025-05-30 13:27:31] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:27:31] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:27:31] [INFO ] Input system was already deterministic with 736 transitions.
[2025-05-30 13:27:31] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:27:31] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:27:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality3326826732399879733.gal : 12 ms
[2025-05-30 13:27:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality9466219310835140571.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3326826732399879733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9466219310835140571.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.66365e+10,2.89074,93596,2,11501,5,278103,6,0,3066,489052,0
Converting to forward existential form...Done !
original formula: AG(EX((p1336==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p1336==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...540
(forward)formula 0,0,28.4165,769200,1,0,924,2.81664e+06,1488,628,16342,2.98963e+06,1479
FORMULA CO4-PT-21-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 25 place count 618 transition count 771
Iterating global reduction 1 with 21 rules applied. Total rules applied 46 place count 618 transition count 771
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 601 transition count 754
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 601 transition count 754
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 89 place count 592 transition count 745
Iterating global reduction 1 with 9 rules applied. Total rules applied 98 place count 592 transition count 745
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 587 transition count 740
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 587 transition count 740
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 585 transition count 738
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 585 transition count 738
Applied a total of 112 rules in 81 ms. Remains 585 /641 variables (removed 56) and now considering 738/795 (removed 57) transitions.
// Phase 1: matrix 738 rows 585 cols
[2025-05-30 13:28:00] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:28:00] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-30 13:28:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:28:00] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 737 sub problems to find dead transitions.
[2025-05-30 13:28:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 589 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 737 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1323 variables, 737/1326 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1326 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 737 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 585/641 places, 738/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60746 ms. Remains : 585/641 places, 738/795 transitions.
[2025-05-30 13:29:01] [INFO ] Flatten gal took : 20 ms
[2025-05-30 13:29:01] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:29:01] [INFO ] Input system was already deterministic with 738 transitions.
[2025-05-30 13:29:01] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:29:01] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:29:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality17813578024164882733.gal : 13 ms
[2025-05-30 13:29:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14589435956996543553.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17813578024164882733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14589435956996543553.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.75785e+10,2.8803,91164,2,11216,5,269215,6,0,3076,470848,0
Converting to forward existential form...Done !
original formula: AG(((AF(((p905==0)&&(p363==1))) + AX((p1006==0))) + (p375==1)))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((p375==1))) * !(!(EG(!(((p905==0)&&(p363==1)))))))) * !((p1006==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...540
Detected timeout of ITS tools.
[2025-05-30 13:29:31] [INFO ] Flatten gal took : 18 ms
[2025-05-30 13:29:31] [INFO ] Applying decomposition
[2025-05-30 13:29:31] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11791018347200666999.txt' '-o' '/tmp/graph11791018347200666999.bin' '-w' '/tmp/graph11791018347200666999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11791018347200666999.bin' '-l' '-1' '-v' '-w' '/tmp/graph11791018347200666999.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:29:31] [INFO ] Decomposing Gal with order
[2025-05-30 13:29:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:29:31] [INFO ] Removed a total of 215 redundant transitions.
[2025-05-30 13:29:31] [INFO ] Flatten gal took : 136 ms
[2025-05-30 13:29:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 22 ms.
[2025-05-30 13:29:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8101888313555073867.gal : 12 ms
[2025-05-30 13:29:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality18104215215596555334.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8101888313555073867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18104215215596555334.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.75785e+10,0.495324,23876,1182,112,33448,2275,1288,96110,99,9626,0
Converting to forward existential form...Done !
original formula: AG(((AF(((i13.u136.p905==0)&&(i5.i0.i1.u58.p363==1))) + AX((i15.u156.p1006==0))) + (i5.i1.i0.u51.p375==1)))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((i5.i1.i0.u51.p375==1))) * !(!(EG(!(((i13.u136.p905==0)&&(i5.i0.i1.u58.p363==1)))))))...191
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t187, t284, t304, t343, t389, t397, t398, t418, t429, t532, t544, t575, t615, t624...906
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Graph (trivial) has 683 edges and 641 vertex of which 3 / 641 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 988 edges and 639 vertex of which 627 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 293 transitions
Trivial Post-agglo rules discarded 293 transitions
Performed 293 trivial Post agglomeration. Transition count delta: 293
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 626 transition count 484
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 295 rules applied. Total rules applied 592 place count 333 transition count 482
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 595 place count 332 transition count 480
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 597 place count 330 transition count 480
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 597 place count 330 transition count 423
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 711 place count 273 transition count 423
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 715 place count 269 transition count 419
Iterating global reduction 4 with 4 rules applied. Total rules applied 719 place count 269 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 719 place count 269 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 723 place count 267 transition count 417
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 725 place count 265 transition count 415
Iterating global reduction 4 with 2 rules applied. Total rules applied 727 place count 265 transition count 415
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 797 place count 230 transition count 380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 802 place count 230 transition count 375
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 805 place count 228 transition count 374
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 813 place count 220 transition count 366
Iterating global reduction 6 with 8 rules applied. Total rules applied 821 place count 220 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 823 place count 219 transition count 365
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 824 place count 218 transition count 364
Iterating global reduction 6 with 1 rules applied. Total rules applied 825 place count 218 transition count 364
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 826 place count 217 transition count 362
Iterating global reduction 6 with 1 rules applied. Total rules applied 827 place count 217 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 828 place count 217 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 847 place count 217 transition count 342
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 7 with 11 rules applied. Total rules applied 858 place count 217 transition count 331
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 869 place count 206 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 869 place count 206 transition count 330
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 871 place count 205 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 873 place count 204 transition count 329
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 877 place count 204 transition count 329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 879 place count 202 transition count 327
Applied a total of 879 rules in 94 ms. Remains 202 /641 variables (removed 439) and now considering 327/795 (removed 468) transitions.
// Phase 1: matrix 327 rows 202 cols
[2025-05-30 13:30:02] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-30 13:30:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:30:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:30:02] [INFO ] Redundant transitions in 20 ms returned []
Running 314 sub problems to find dead transitions.
[2025-05-30 13:30:02] [INFO ] Invariant cache hit.
[2025-05-30 13:30:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 326/528 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 1/529 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/529 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 529/529 variables, and 207 constraints, problems are : Problem set: 0 solved, 314 unsolved in 23526 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 326/528 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 314/520 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 1/529 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 521 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53594ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 53595ms
Starting structural reductions in SI_CTL mode, iteration 1 : 202/641 places, 327/795 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53956 ms. Remains : 202/641 places, 327/795 transitions.
[2025-05-30 13:30:55] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:30:55] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:30:55] [INFO ] Input system was already deterministic with 327 transitions.
[2025-05-30 13:30:55] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:30:55] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:30:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13259594968450381969.gal : 2 ms
[2025-05-30 13:30:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality2432057942086062736.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13259594968450381969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2432057942086062736.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32503e+08,0.206432,11448,2,1396,5,28461,6,0,1121,30015,0
Converting to forward existential form...Done !
original formula: E(AG(A((p849==1) U !(AF((p774==0))))) U EF(EG(((p709==0)||(p809==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,!(E(TRUE U !(!((E(!(!(!(EG(!((p774==0)))))) U (!((p849==1)) * !(!(!(EG(!((p774==0)))))))) +...231
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t31, t56, t73, t78, t93, t108, t113, t167, t186, t320, Intersection with reachable ...226
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 323/0/4
(forward)formula 0,1,11.5048,381648,1,0,688,2.36828e+06,702,411,8172,2.26878e+06,1037
FORMULA CO4-PT-21-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 27 place count 616 transition count 769
Iterating global reduction 1 with 23 rules applied. Total rules applied 50 place count 616 transition count 769
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 599 transition count 752
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 599 transition count 752
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 93 place count 590 transition count 743
Iterating global reduction 1 with 9 rules applied. Total rules applied 102 place count 590 transition count 743
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 585 transition count 738
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 585 transition count 738
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 583 transition count 736
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 583 transition count 736
Applied a total of 116 rules in 63 ms. Remains 583 /641 variables (removed 58) and now considering 736/795 (removed 59) transitions.
// Phase 1: matrix 736 rows 583 cols
[2025-05-30 13:31:07] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:31:07] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 13:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:31:08] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2025-05-30 13:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 587 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 735/1322 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1322 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 583/641 places, 736/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60586 ms. Remains : 583/641 places, 736/795 transitions.
[2025-05-30 13:32:08] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:32:08] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:32:08] [INFO ] Input system was already deterministic with 736 transitions.
[2025-05-30 13:32:08] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:32:08] [INFO ] Flatten gal took : 18 ms
[2025-05-30 13:32:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality15898387719919514390.gal : 4 ms
[2025-05-30 13:32:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6470429936552249856.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15898387719919514390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6470429936552249856.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.66365e+10,3.00505,93376,2,11501,5,278103,6,0,3066,489052,0
Converting to forward existential form...Done !
original formula: EX(EG((p418==0)))
=> equivalent forward existential formula: [FwdG(EY(Init),(p418==0))] != FALSE
Hit Full ! (commute/partial/dont) 734/0/2
(forward)formula 0,1,19.2483,522784,1,0,35,2.60315e+06,19,4,14019,1.34438e+06,32
FORMULA CO4-PT-21-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 24 place count 619 transition count 772
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 619 transition count 772
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 605 transition count 758
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 605 transition count 758
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 81 place count 596 transition count 749
Iterating global reduction 1 with 9 rules applied. Total rules applied 90 place count 596 transition count 749
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 591 transition count 744
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 591 transition count 744
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 589 transition count 742
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 589 transition count 742
Applied a total of 104 rules in 63 ms. Remains 589 /641 variables (removed 52) and now considering 742/795 (removed 53) transitions.
// Phase 1: matrix 742 rows 589 cols
[2025-05-30 13:32:27] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 13:32:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:28] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 741 sub problems to find dead transitions.
[2025-05-30 13:32:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 742/1331 variables, 589/593 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1331/1331 variables, and 593 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 3 (OVERLAPS) 742/1331 variables, 589/593 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1331 variables, 741/1334 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1331/1331 variables, and 1334 constraints, problems are : Problem set: 0 solved, 741 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 741 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 589/641 places, 742/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60605 ms. Remains : 589/641 places, 742/795 transitions.
[2025-05-30 13:33:28] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:33:28] [INFO ] Flatten gal took : 17 ms
[2025-05-30 13:33:28] [INFO ] Input system was already deterministic with 742 transitions.
[2025-05-30 13:33:28] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:33:28] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:33:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality11175372516872700824.gal : 2 ms
[2025-05-30 13:33:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4623812945190842344.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11175372516872700824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4623812945190842344.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.99798e+10,3.07084,95768,2,11489,5,283475,6,0,3096,506899,0
Converting to forward existential form...Done !
original formula: EF(EX(!(A(((p231==0)||(p646==1)) U (p421==1)))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),!((p421==1))) * (!(((p231==0)||(p646==1))) * !((p421==1))))] != FALSE + [FwdG(EY(Fwd...193
Hit Full ! (commute/partial/dont) 740/0/2
(forward)formula 0,1,3.96264,95768,1,0,10,283475,19,3,6034,506899,6
FORMULA CO4-PT-21-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Graph (trivial) has 689 edges and 641 vertex of which 3 / 641 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 988 edges and 639 vertex of which 627 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 300 transitions
Trivial Post-agglo rules discarded 300 transitions
Performed 300 trivial Post agglomeration. Transition count delta: 300
Iterating post reduction 0 with 302 rules applied. Total rules applied 304 place count 626 transition count 477
Reduce places removed 300 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 302 rules applied. Total rules applied 606 place count 326 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 607 place count 325 transition count 475
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 607 place count 325 transition count 418
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 721 place count 268 transition count 418
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 724 place count 265 transition count 415
Iterating global reduction 3 with 3 rules applied. Total rules applied 727 place count 265 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 727 place count 265 transition count 414
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 729 place count 264 transition count 414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 730 place count 263 transition count 413
Iterating global reduction 3 with 1 rules applied. Total rules applied 731 place count 263 transition count 413
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 805 place count 226 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 810 place count 226 transition count 371
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 813 place count 224 transition count 370
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 821 place count 216 transition count 362
Iterating global reduction 5 with 8 rules applied. Total rules applied 829 place count 216 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 831 place count 215 transition count 361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 832 place count 214 transition count 360
Iterating global reduction 5 with 1 rules applied. Total rules applied 833 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 834 place count 213 transition count 358
Iterating global reduction 5 with 1 rules applied. Total rules applied 835 place count 213 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 836 place count 213 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 855 place count 213 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 866 place count 213 transition count 327
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 877 place count 202 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 877 place count 202 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 879 place count 201 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 881 place count 200 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 883 place count 198 transition count 323
Applied a total of 883 rules in 68 ms. Remains 198 /641 variables (removed 443) and now considering 323/795 (removed 472) transitions.
// Phase 1: matrix 323 rows 198 cols
[2025-05-30 13:33:32] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:33:32] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-30 13:33:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:33:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:33:32] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:33:32] [INFO ] Redundant transitions in 4 ms returned []
Running 310 sub problems to find dead transitions.
[2025-05-30 13:33:32] [INFO ] Invariant cache hit.
[2025-05-30 13:33:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 203 constraints, problems are : Problem set: 0 solved, 310 unsolved in 22281 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 310/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52325ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 52325ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/641 places, 323/795 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52657 ms. Remains : 198/641 places, 323/795 transitions.
[2025-05-30 13:34:25] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:34:25] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:34:25] [INFO ] Input system was already deterministic with 323 transitions.
[2025-05-30 13:34:25] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:34:25] [INFO ] Flatten gal took : 6 ms
[2025-05-30 13:34:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16633116837981498356.gal : 2 ms
[2025-05-30 13:34:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13629803092327315794.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16633116837981498356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13629803092327315794.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2367e+08,0.14192,9436,2,1032,5,24634,6,0,1101,16482,0
Converting to forward existential form...Done !
original formula: EG((p783!=1))
=> equivalent forward existential formula: [FwdG(Init,(p783!=1))] != FALSE
Hit Full ! (commute/partial/dont) 321/0/2
(forward)formula 0,1,0.667986,27396,1,0,8,139052,19,4,5244,41904,8
FORMULA CO4-PT-21-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 27 place count 616 transition count 769
Iterating global reduction 1 with 23 rules applied. Total rules applied 50 place count 616 transition count 769
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 600 transition count 753
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 600 transition count 753
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 90 place count 592 transition count 745
Iterating global reduction 1 with 8 rules applied. Total rules applied 98 place count 592 transition count 745
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 588 transition count 741
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 588 transition count 741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 586 transition count 739
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 586 transition count 739
Applied a total of 110 rules in 72 ms. Remains 586 /641 variables (removed 55) and now considering 739/795 (removed 56) transitions.
// Phase 1: matrix 739 rows 586 cols
[2025-05-30 13:34:25] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:34:25] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 13:34:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:34:26] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2025-05-30 13:34:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 590 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 738/1328 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:35:23] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1329 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 586/641 places, 739/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60606 ms. Remains : 586/641 places, 739/795 transitions.
[2025-05-30 13:35:26] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:35:26] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:35:26] [INFO ] Input system was already deterministic with 739 transitions.
[2025-05-30 13:35:26] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:35:26] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:35:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality9148338274088207186.gal : 3 ms
[2025-05-30 13:35:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality5449492872460933654.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9148338274088207186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5449492872460933654.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.82942e+10,2.84873,92204,2,11191,5,273928,6,0,3081,480192,0
Converting to forward existential form...Done !
original formula: EX(!(E(AF((p323==1)) U (p157==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EG(!((p323==1)))) U (p157==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...540
Detected timeout of ITS tools.
[2025-05-30 13:35:56] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:35:56] [INFO ] Applying decomposition
[2025-05-30 13:35:56] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4810424502729108255.txt' '-o' '/tmp/graph4810424502729108255.bin' '-w' '/tmp/graph4810424502729108255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4810424502729108255.bin' '-l' '-1' '-v' '-w' '/tmp/graph4810424502729108255.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:35:56] [INFO ] Decomposing Gal with order
[2025-05-30 13:35:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:35:56] [INFO ] Removed a total of 234 redundant transitions.
[2025-05-30 13:35:56] [INFO ] Flatten gal took : 27 ms
[2025-05-30 13:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2025-05-30 13:35:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality17924545277540396839.gal : 5 ms
[2025-05-30 13:35:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality4928551966408260840.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17924545277540396839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4928551966408260840.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.82942e+10,0.480083,24588,1167,112,37135,2127,1261,96852,96,8180,0
Converting to forward existential form...Done !
original formula: EX(!(E(AF((i5.u41.p323==1)) U (i0.i1.i0.u14.p157==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EG(!((i5.u41.p323==1)))) U (i0.i1.i0.u14.p157==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t188, t273, t285, t305, t344, t390, t419, t457, t498, t532, t544, t584, t616, t625...880
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 26 place count 617 transition count 770
Iterating global reduction 1 with 22 rules applied. Total rules applied 48 place count 617 transition count 770
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 601 transition count 754
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 601 transition count 754
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 593 transition count 746
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 593 transition count 746
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 589 transition count 742
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 589 transition count 742
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 588 transition count 741
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 588 transition count 741
Applied a total of 106 rules in 68 ms. Remains 588 /641 variables (removed 53) and now considering 741/795 (removed 54) transitions.
// Phase 1: matrix 741 rows 588 cols
[2025-05-30 13:36:26] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:36:26] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-30 13:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:36:27] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 740 sub problems to find dead transitions.
[2025-05-30 13:36:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 592 constraints, problems are : Problem set: 0 solved, 740 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1329 variables, 740/1332 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1329 variables, and 1332 constraints, problems are : Problem set: 0 solved, 740 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 588/641 places, 741/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 588/641 places, 741/795 transitions.
[2025-05-30 13:37:27] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:37:27] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:37:27] [INFO ] Input system was already deterministic with 741 transitions.
[2025-05-30 13:37:27] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:37:27] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:37:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality5032263021932676816.gal : 2 ms
[2025-05-30 13:37:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality14459787978195659387.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5032263021932676816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14459787978195659387.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.85713e+10,2.98687,96376,2,11620,5,287780,6,0,3091,500949,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:37:57] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:37:57] [INFO ] Applying decomposition
[2025-05-30 13:37:57] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18334156544726380298.txt' '-o' '/tmp/graph18334156544726380298.bin' '-w' '/tmp/graph18334156544726380298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18334156544726380298.bin' '-l' '-1' '-v' '-w' '/tmp/graph18334156544726380298.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:37:57] [INFO ] Decomposing Gal with order
[2025-05-30 13:37:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:37:57] [INFO ] Removed a total of 227 redundant transitions.
[2025-05-30 13:37:57] [INFO ] Flatten gal took : 27 ms
[2025-05-30 13:37:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 6 ms.
[2025-05-30 13:37:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11537230066498743013.gal : 6 ms
[2025-05-30 13:37:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6994105657416544727.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11537230066498743013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6994105657416544727.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.85713e+10,0.399193,18288,1017,109,24268,2076,1276,57259,97,7973,0
Converting to forward existential form...Done !
original formula: AG(EX(EG(((i10.i0.i1.u111.p803==0)||(i12.u125.p869==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EG(((i10.i0.i1.u111.p803==0)||(i12.u125.p869==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t299, t309, t348, t382, t394, t423, t502, t548, t579, t628, t655, t656, i0.i0.i0.u...931
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 24 place count 619 transition count 772
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 619 transition count 772
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 604 transition count 757
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 604 transition count 757
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 82 place count 596 transition count 749
Iterating global reduction 1 with 8 rules applied. Total rules applied 90 place count 596 transition count 749
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 592 transition count 745
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 592 transition count 745
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 590 transition count 743
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 590 transition count 743
Applied a total of 102 rules in 67 ms. Remains 590 /641 variables (removed 51) and now considering 743/795 (removed 52) transitions.
// Phase 1: matrix 743 rows 590 cols
[2025-05-30 13:38:27] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:38:27] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 13:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:38:28] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 742 sub problems to find dead transitions.
[2025-05-30 13:38:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (OVERLAPS) 1/590 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 743/1333 variables, 590/594 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1333/1333 variables, and 594 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (OVERLAPS) 1/590 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 3 (OVERLAPS) 743/1333 variables, 590/594 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1333 variables, 742/1336 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1333/1333 variables, and 1336 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 590/641 places, 743/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 590/641 places, 743/795 transitions.
[2025-05-30 13:39:28] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:39:28] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:39:28] [INFO ] Input system was already deterministic with 743 transitions.
[2025-05-30 13:39:28] [INFO ] Flatten gal took : 21 ms
[2025-05-30 13:39:28] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:39:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality16131073483941581830.gal : 3 ms
[2025-05-30 13:39:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3146655716892620679.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16131073483941581830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3146655716892620679.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.0198e+10,3.27547,102756,2,11281,5,305252,6,0,3100,542421,0
Converting to forward existential form...Done !
original formula: !(A((p322==0) U !(EX(AX(((p1056==0)||(p156==1)))))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,!(!(EX(!(EX(!(((p1056==0)||(p156==1))))))))) * !((p322==0)))) * !(EX(!(((p1056==0)||(p156==1)))...237
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...540
Detected timeout of ITS tools.
[2025-05-30 13:39:58] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:39:58] [INFO ] Applying decomposition
[2025-05-30 13:39:58] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7319505136507613606.txt' '-o' '/tmp/graph7319505136507613606.bin' '-w' '/tmp/graph7319505136507613606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7319505136507613606.bin' '-l' '-1' '-v' '-w' '/tmp/graph7319505136507613606.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:39:58] [INFO ] Decomposing Gal with order
[2025-05-30 13:39:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:39:58] [INFO ] Removed a total of 234 redundant transitions.
[2025-05-30 13:39:58] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:39:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-05-30 13:39:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11456883582784379778.gal : 6 ms
[2025-05-30 13:39:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10797512422238775458.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11456883582784379778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10797512422238775458.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.0198e+10,0.561708,25816,1349,110,36711,1362,1252,116527,97,4962,0
Converting to forward existential form...Done !
original formula: !(A((i3.u43.p322==0) U !(EX(AX(((i18.u173.p1056==0)||(i5.u14.p156==1)))))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,!(!(EX(!(EX(!(((i18.u173.p1056==0)||(i5.u14.p156==1))))))))) * !((i3.u43.p322==0)))) * !(EX(!((...292
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t274, t286, t306, t345, t379, t458, t499, t534, t546, t555, t557, t577, t619, t628...912
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 625 transition count 779
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 625 transition count 779
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 613 transition count 767
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 613 transition count 767
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 607 transition count 761
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 607 transition count 761
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 602 transition count 756
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 602 transition count 756
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 600 transition count 754
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 600 transition count 754
Applied a total of 82 rules in 79 ms. Remains 600 /641 variables (removed 41) and now considering 754/795 (removed 41) transitions.
// Phase 1: matrix 754 rows 600 cols
[2025-05-30 13:40:28] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:28] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 13:40:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:29] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 753 sub problems to find dead transitions.
[2025-05-30 13:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 753 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 timeout
1.0)
(s270 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1354 variables, and 4 constraints, problems are : Problem set: 0 solved, 753 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/600 constraints, PredecessorRefiner: 753/753 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 753 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 3 (OVERLAPS) 754/1352 variables, 598/602 constraints. Problems are: Problem set: 0 solved, 753 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1352 variables, 713/1315 constraints. Problems are: Problem set: 0 solved, 753 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:27] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1352/1354 variables, and 1316 constraints, problems are : Problem set: 0 solved, 753 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 598/600 constraints, PredecessorRefiner: 713/753 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 753 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 600/641 places, 754/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 600/641 places, 754/795 transitions.
[2025-05-30 13:41:29] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:41:29] [INFO ] Flatten gal took : 27 ms
[2025-05-30 13:41:29] [INFO ] Input system was already deterministic with 754 transitions.
[2025-05-30 13:41:29] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:41:29] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:41:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7536076188308059605.gal : 2 ms
[2025-05-30 13:41:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality14386646302739556830.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7536076188308059605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14386646302739556830.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.62699e+10,2.96918,94640,2,11545,5,285782,6,0,3145,498835,0
Converting to forward existential form...Done !
original formula: !(A(((!(EX(!((((p1075==0)||(p679==0))||(p1020==1))))) + !(((p1091==1) * !(EF((p1025==1)))))) + E((AF(((p1380==0)||(p133==1))) + (p585==1)...237
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(E(EG(((p238==0)||(p807==1))) U ((p1035==0)||(p182==1))))))) * !(((!(EX(!((((p1075==0)...478
Reverse transition relation is NOT exact ! Due to transitions t23, t24, t25, t26, t27, t28, t29, t35, t37, t42, t51, t53, t54, t55, t56, t57, t59, t62, t10...534
Detected timeout of ITS tools.
[2025-05-30 13:41:59] [INFO ] Flatten gal took : 15 ms
[2025-05-30 13:41:59] [INFO ] Applying decomposition
[2025-05-30 13:41:59] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4144045577194822339.txt' '-o' '/tmp/graph4144045577194822339.bin' '-w' '/tmp/graph4144045577194822339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4144045577194822339.bin' '-l' '-1' '-v' '-w' '/tmp/graph4144045577194822339.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:41:59] [INFO ] Decomposing Gal with order
[2025-05-30 13:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:41:59] [INFO ] Removed a total of 219 redundant transitions.
[2025-05-30 13:41:59] [INFO ] Flatten gal took : 49 ms
[2025-05-30 13:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-05-30 13:41:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14537734580286346700.gal : 7 ms
[2025-05-30 13:41:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3562432582129284174.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14537734580286346700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3562432582129284174.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.62699e+10,0.36857,17872,1016,120,22626,2178,1305,55453,101,8508,0
Converting to forward existential form...Done !
original formula: !(A(((!(EX(!((((i17.u169.p1075==0)||(i7.i1.i2.u87.p679==0))||(i16.i1.i0.u156.p1020==1))))) + !(((i18.i0.i2.u174.p1091==1) * !(EF((i13.u15...379
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(E(EG(((i7.i0.i0.u27.p238==0)||(i11.i1.i1.u116.p807==1))) U ((i16.i1.i1.u162.p1035==0)...720
Reverse transition relation is NOT exact ! Due to transitions t62, t106, t211, t313, t352, t398, t430, t441, t509, t555, t586, t598, t637, t664, t665, i0.t...896
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 25 place count 618 transition count 771
Iterating global reduction 1 with 21 rules applied. Total rules applied 46 place count 618 transition count 771
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 62 place count 602 transition count 755
Iterating global reduction 1 with 16 rules applied. Total rules applied 78 place count 602 transition count 755
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 594 transition count 747
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 594 transition count 747
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 590 transition count 743
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 590 transition count 743
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 588 transition count 741
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 588 transition count 741
Applied a total of 106 rules in 62 ms. Remains 588 /641 variables (removed 53) and now considering 741/795 (removed 54) transitions.
// Phase 1: matrix 741 rows 588 cols
[2025-05-30 13:42:29] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:42:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 13:42:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:42:30] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 740 sub problems to find dead transitions.
[2025-05-30 13:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 592 constraints, problems are : Problem set: 0 solved, 740 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 3 (OVERLAPS) 741/1329 variables, 588/592 constraints. Problems are: Problem set: 0 solved, 740 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1329 variables, 740/1332 constraints. Problems are: Problem set: 0 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:27] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1329 variables, and 1333 constraints, problems are : Problem set: 0 solved, 740 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 740/740 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 740 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 588/641 places, 741/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60603 ms. Remains : 588/641 places, 741/795 transitions.
[2025-05-30 13:43:30] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:43:30] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:43:30] [INFO ] Input system was already deterministic with 741 transitions.
[2025-05-30 13:43:30] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:43:30] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:43:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16722274129092659180.gal : 2 ms
[2025-05-30 13:43:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality9637756482520608814.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16722274129092659180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9637756482520608814.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.93993e+10,2.95766,94144,2,11299,5,283398,6,0,3091,495005,0
Converting to forward existential form...Done !
original formula: EX(A((!(AX((p131!=0))) * AF(!((((p322==0)||(p369==1))&&(p1030==1))))) U AX(FALSE)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((!(!(EX(!((p131!=0))))) * !(EG(!(!((((p32...226
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t26, t27, t28, t33, t35, t40, t49, t51, t52, t53, t54, t55, t57, t60, t10...540
Detected timeout of ITS tools.
[2025-05-30 13:44:00] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:44:00] [INFO ] Applying decomposition
[2025-05-30 13:44:00] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12004961775567879180.txt' '-o' '/tmp/graph12004961775567879180.bin' '-w' '/tmp/graph12004961775567879180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12004961775567879180.bin' '-l' '-1' '-v' '-w' '/tmp/graph12004961775567879180.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:44:00] [INFO ] Decomposing Gal with order
[2025-05-30 13:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:44:00] [INFO ] Removed a total of 216 redundant transitions.
[2025-05-30 13:44:00] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 3 ms.
[2025-05-30 13:44:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality15825421547558933636.gal : 5 ms
[2025-05-30 13:44:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4115535796287179581.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15825421547558933636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4115535796287179581.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.93993e+10,0.34671,16856,1034,109,21890,2205,1231,50323,96,8443,0
Converting to forward existential form...Done !
original formula: EX(A((!(AX((i1.u5.p131!=0))) * AF(!((((i4.u36.p322==0)||(i5.u50.p369==1))&&(i16.u155.p1030==1))))) U AX(FALSE)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((!(!(EX(!((i1.u5.p131!=0))))) * !(EG(!(!(...255
Reverse transition relation is NOT exact ! Due to transitions t60, t104, t188, t305, t344, t378, t390, t419, t430, t457, t500, t535, t578, t590, t618, t627...836
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 639 transition count 793
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 25 place count 618 transition count 771
Iterating global reduction 1 with 21 rules applied. Total rules applied 46 place count 618 transition count 771
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 62 place count 602 transition count 755
Iterating global reduction 1 with 16 rules applied. Total rules applied 78 place count 602 transition count 755
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 593 transition count 746
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 593 transition count 746
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 588 transition count 741
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 588 transition count 741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 586 transition count 739
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 586 transition count 739
Applied a total of 110 rules in 70 ms. Remains 586 /641 variables (removed 55) and now considering 739/795 (removed 56) transitions.
// Phase 1: matrix 739 rows 586 cols
[2025-05-30 13:44:30] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:44:30] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-30 13:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:44:31] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2025-05-30 13:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 590 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 738/1328 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:31] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1329 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 586/641 places, 739/795 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60605 ms. Remains : 586/641 places, 739/795 transitions.
[2025-05-30 13:45:31] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:45:31] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:45:31] [INFO ] Input system was already deterministic with 739 transitions.
[2025-05-30 13:45:31] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:45:31] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:45:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality2808297187862011410.gal : 3 ms
[2025-05-30 13:45:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16381136396768440210.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2808297187862011410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16381136396768440210.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81334e+10,2.95677,92320,2,11528,5,276669,6,0,3081,478942,0
Converting to forward existential form...Done !
original formula: A(E(!(AX(FALSE)) U ((p773==0)||(p1208==1))) U (p886!=0))
=> equivalent forward existential formula: [((Init * !(EG(!((p886!=0))))) * !(E(!((p886!=0)) U (!(E(!(!(EX(!(FALSE)))) U ((p773==0)||(p1208==1)))) * !((p88...175
Reverse transition relation is NOT exact ! Due to transitions t21, t22, t23, t24, t25, t26, t27, t32, t34, t39, t48, t50, t51, t52, t53, t54, t56, t59, t10...546
Detected timeout of ITS tools.
[2025-05-30 13:46:01] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:46:01] [INFO ] Applying decomposition
[2025-05-30 13:46:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2249006274536731973.txt' '-o' '/tmp/graph2249006274536731973.bin' '-w' '/tmp/graph2249006274536731973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2249006274536731973.bin' '-l' '-1' '-v' '-w' '/tmp/graph2249006274536731973.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:46:01] [INFO ] Decomposing Gal with order
[2025-05-30 13:46:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:46:01] [INFO ] Removed a total of 222 redundant transitions.
[2025-05-30 13:46:01] [INFO ] Flatten gal took : 31 ms
[2025-05-30 13:46:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 13:46:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality3816262223078548861.gal : 5 ms
[2025-05-30 13:46:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality6856825018629613102.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3816262223078548861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6856825018629613102.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81334e+10,0.44235,20024,1004,109,28064,2339,1277,64745,91,8992,0
Converting to forward existential form...Done !
original formula: A(E(!(AX(FALSE)) U ((i10.i2.i0.u105.p773==0)||(i20.i0.i0.u198.p1208==1))) U (i12.u131.p886!=0))
=> equivalent forward existential formula: [((Init * !(EG(!((i12.u131.p886!=0))))) * !(E(!((i12.u131.p886!=0)) U (!(E(!(!(EX(!(FALSE)))) U ((i10.i2.i0.u105...232
Reverse transition relation is NOT exact ! Due to transitions t59, t103, t187, t272, t305, t344, t392, t421, t459, t500, t546, t577, t586, t617, t626, t653...928
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 641/641 places, 795/795 transitions.
Graph (trivial) has 688 edges and 641 vertex of which 3 / 641 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 988 edges and 639 vertex of which 627 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 298 transitions
Trivial Post-agglo rules discarded 298 transitions
Performed 298 trivial Post agglomeration. Transition count delta: 298
Iterating post reduction 0 with 300 rules applied. Total rules applied 302 place count 626 transition count 479
Reduce places removed 298 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 300 rules applied. Total rules applied 602 place count 328 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 603 place count 327 transition count 477
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 603 place count 327 transition count 420
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 717 place count 270 transition count 420
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 721 place count 266 transition count 416
Iterating global reduction 3 with 4 rules applied. Total rules applied 725 place count 266 transition count 416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 725 place count 266 transition count 414
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 729 place count 264 transition count 414
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 731 place count 262 transition count 412
Iterating global reduction 3 with 2 rules applied. Total rules applied 733 place count 262 transition count 412
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 805 place count 226 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 810 place count 226 transition count 371
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 813 place count 224 transition count 370
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 821 place count 216 transition count 362
Iterating global reduction 5 with 8 rules applied. Total rules applied 829 place count 216 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 831 place count 215 transition count 361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 832 place count 214 transition count 360
Iterating global reduction 5 with 1 rules applied. Total rules applied 833 place count 214 transition count 360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 834 place count 213 transition count 358
Iterating global reduction 5 with 1 rules applied. Total rules applied 835 place count 213 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 836 place count 213 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 855 place count 213 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 6 with 11 rules applied. Total rules applied 866 place count 213 transition count 327
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 877 place count 202 transition count 327
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 877 place count 202 transition count 326
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 879 place count 201 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 881 place count 200 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 883 place count 198 transition count 323
Applied a total of 883 rules in 62 ms. Remains 198 /641 variables (removed 443) and now considering 323/795 (removed 472) transitions.
// Phase 1: matrix 323 rows 198 cols
[2025-05-30 13:46:31] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:46:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-30 13:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:46:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:46:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:46:31] [INFO ] Redundant transitions in 4 ms returned []
Running 310 sub problems to find dead transitions.
[2025-05-30 13:46:31] [INFO ] Invariant cache hit.
[2025-05-30 13:46:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 203 constraints, problems are : Problem set: 0 solved, 310 unsolved in 21887 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/520 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 310/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51933ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 51933ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/641 places, 323/795 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52196 ms. Remains : 198/641 places, 323/795 transitions.
[2025-05-30 13:47:23] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:47:23] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:47:23] [INFO ] Input system was already deterministic with 323 transitions.
[2025-05-30 13:47:23] [INFO ] Flatten gal took : 4 ms
[2025-05-30 13:47:23] [INFO ] Flatten gal took : 4 ms
[2025-05-30 13:47:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2850760577451136016.gal : 1 ms
[2025-05-30 13:47:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality7705670640106484759.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2850760577451136016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7705670640106484759.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22612e+08,0.146868,9688,2,1025,5,25724,6,0,1101,17958,0
Converting to forward existential form...Done !
original formula: AF(EG((p1091==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p1091==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t33, t58, t75, t80, t95, t110, t115, t166, t186, t321, Intersection with reachable ...226
(forward)formula 0,0,5.93987,200388,1,0,605,873604,671,380,6669,1.30834e+06,947
FORMULA CO4-PT-21-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 13:47:29] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:47:29] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:47:29] [INFO ] Applying decomposition
[2025-05-30 13:47:29] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15384743071353263623.txt' '-o' '/tmp/graph15384743071353263623.bin' '-w' '/tmp/graph15384743071353263623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15384743071353263623.bin' '-l' '-1' '-v' '-w' '/tmp/graph15384743071353263623.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:47:29] [INFO ] Decomposing Gal with order
[2025-05-30 13:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:47:29] [INFO ] Removed a total of 236 redundant transitions.
[2025-05-30 13:47:29] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:47:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2025-05-30 13:47:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality13005998094285019985.gal : 5 ms
[2025-05-30 13:47:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality11037592113346812953.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13005998094285019985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11037592113346812953.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20712e+11,0.38535,19912,1213,110,28226,1873,1442,61997,98,6267,0
Converting to forward existential form...Done !
original formula: AG(((AF(((i13.i1.i0.u154.p905==0)&&(i5.i1.i0.u55.p363==1))) + AX((i14.i0.i0.u178.p1006==0))) + (i5.i0.i1.u59.p375==1)))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((i5.i0.i1.u59.p375==1))) * !(!(EG(!(((i13.i1.i0.u154.p905==0)&&(i5.i1.i0.u55.p363==1)...203
Reverse transition relation is NOT exact ! Due to transitions t67, t112, t218, t288, t325, t367, t452, t463, t536, t571, t616, t628, t669, i0.i0.t319, i0.i...1053
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
(forward)formula 0,0,225.953,2446748,1,0,2.20925e+06,7574,3582,2.44026e+07,221,46558,664969
FORMULA CO4-PT-21-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(!(E(AF((i3.u46.p323==1)) U (i4.u16.p157==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EG(!((i3.u46.p323==1)))) U (i4.u16.p157==1))))] != FALSE
(forward)formula 1,1,436.264,3042028,1,0,2.7617e+06,8603,3545,2.96901e+07,216,58037,724367
FORMULA CO4-PT-21-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(EX(EG(((i8.i2.i1.u129.p803==0)||(i13.i0.i0.u146.p869==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EG(((i8.i2.i1.u129.p803==0)||(i13.i0.i0.u146.p869==1))))))] = FALSE
(forward)formula 2,0,646.202,3751532,1,0,3.35115e+06,8705,2979,3.69134e+07,206,61097,594735
FORMULA CO4-PT-21-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(A((i3.u46.p322==0) U !(EX(AX(((i14.i0.i3.u190.p1056==0)||(i4.u16.p156==1)))))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,!(!(EX(!(EX(!(((i14.i0.i3.u190.p1056==0)||(i4.u16.p156==1))))))))) * !((i3.u46.p322==0)))) * !(...310
(forward)formula 3,1,1174.03,5099628,1,0,5.70764e+06,8705,2954,4.61472e+07,201,61097,260106
FORMULA CO4-PT-21-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(A(((!(EX(!((((i15.u195.p1075==0)||(i10.u98.p679==0))||(i14.i1.i0.u181.p1020==1))))) + !(((i17.u200.p1091==1) * !(EF((i14.i1.i2.u183.p10...391
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(E(EG(((i0.i1.i2.u32.p238==0)||(i11.i0.i0.u131.p807==1))) U ((i14.i1.i1.u186.p1035==0)...732
(forward)formula 4,0,1437.88,5632856,1,0,5.70764e+06,10652,4884,5.37378e+07,261,73601,1387048
FORMULA CO4-PT-21-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(A((!(AX((i2.i0.i1.u8.p131!=0))) * AF(!((((i3.u46.p322==0)||(i5.i0.i0.u56.p369==1))&&(i14.i1.i2.u185.p1030==1))))) U AX(FALSE)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((!(!(EX(!((i2.i0.i1.u8.p131!=0))))) * !(E...273
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
[2025-05-30 14:14:33] [INFO ] Applying decomposition
[2025-05-30 14:14:33] [INFO ] Flatten gal took : 11 ms
[2025-05-30 14:14:33] [INFO ] Decomposing Gal with order
[2025-05-30 14:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:14:33] [INFO ] Removed a total of 87 redundant transitions.
[2025-05-30 14:14:33] [INFO ] Flatten gal took : 19 ms
[2025-05-30 14:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 8 ms.
[2025-05-30 14:14:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16785816895909652703.gal : 2 ms
[2025-05-30 14:14:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality10882520098039556042.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16785816895909652703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10882520098039556042.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20712e+11,0.920867,36268,218,2494,3613,88392,231,8904,1702,306446,0
Converting to forward existential form...Done !
original formula: EX(A((!(AX((i0.i0.i0.i0.i0.u7.p131!=0))) * AF(!((((i0.i0.i0.i0.i0.u7.p322==0)||(i0.i0.i0.i0.i0.u7.p369==1))&&(i0.i0.i1.u11.p1030==1))))) ...168
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!((!(!(EX(!((i0.i0.i0.i0.i0.u7.p131!=0)))))...293
Reverse transition relation is NOT exact ! Due to transitions i0.t698, i0.t671, i0.t42, i0.u13.t40, i0.u13.t47, i0.u13.t56, i0.u13.t59, i0.u13.t60, i0.u13....1370
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="CO4-PT-21"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-21, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028600537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-21.tgz
mv CO4-PT-21 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;