Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700057.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 CloudDeployment-PT-5b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 1.5M 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 CloudDeployment-PT-5b-CTLCardinality-2023-12
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2023-13
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2023-14
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2023-15
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-00
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-01
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-02
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-03
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-04
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-05
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-06
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-07
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-08
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-09
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-10
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748557431641

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-29 22:23:52] [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-29 22:23:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:23:53] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2025-05-29 22:23:53] [INFO ] Transformed 1525 places.
[2025-05-29 22:23:53] [INFO ] Transformed 3132 transitions.
[2025-05-29 22:23:53] [INFO ] Found NUPN structural information;
[2025-05-29 22:23:53] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
Support contains 123 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1519 transition count 3132
Discarding 369 places :
Symmetric choice reduction at 1 with 369 rule applications. Total rules 375 place count 1150 transition count 1750
Iterating global reduction 1 with 369 rules applied. Total rules applied 744 place count 1150 transition count 1750
Discarding 126 places :
Symmetric choice reduction at 1 with 126 rule applications. Total rules 870 place count 1024 transition count 1624
Iterating global reduction 1 with 126 rules applied. Total rules applied 996 place count 1024 transition count 1624
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1009 place count 1024 transition count 1611
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1019 place count 1014 transition count 1601
Iterating global reduction 2 with 10 rules applied. Total rules applied 1029 place count 1014 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1030 place count 1013 transition count 1600
Iterating global reduction 2 with 1 rules applied. Total rules applied 1031 place count 1013 transition count 1600
Applied a total of 1031 rules in 716 ms. Remains 1013 /1525 variables (removed 512) and now considering 1600/3132 (removed 1532) transitions.
// Phase 1: matrix 1600 rows 1013 cols
[2025-05-29 22:23:54] [INFO ] Computed 15 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:23:54] [INFO ] Implicit Places using invariants in 436 ms returned []
[2025-05-29 22:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:23:55] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1687 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2025-05-29 22:23:55] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1012 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/2613 variables, and 15 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/1013 constraints, PredecessorRefiner: 1599/1298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1012 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/2613 variables, and 15 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/1013 constraints, PredecessorRefiner: 301/1298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61314ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 61334ms
Starting structural reductions in LTL mode, iteration 1 : 1013/1525 places, 1600/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63768 ms. Remains : 1013/1525 places, 1600/3132 transitions.
Support contains 123 out of 1013 places after structural reductions.
[2025-05-29 22:24:57] [INFO ] Flatten gal took : 148 ms
[2025-05-29 22:24:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudDeployment-PT-5b-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 22:24:57] [INFO ] Flatten gal took : 96 ms
[2025-05-29 22:24:57] [INFO ] Input system was already deterministic with 1600 transitions.
Support contains 103 out of 1013 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (241 resets) in 2247 ms. (17 steps per ms) remains 25/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
[2025-05-29 22:24:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 123/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 98/257 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 777/1034 variables, 257/272 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 574/1608 variables, 241/513 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1608 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 488/2096 variables, 226/739 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2096 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 373/2469 variables, 188/927 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2469 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 106/2575 variables, 77/1004 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2575 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 30/2605 variables, 18/1022 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2605 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (OVERLAPS) 8/2613 variables, 6/1028 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2613/2613 variables, and 1028 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 1013/1013 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 123/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 98/257 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 777/1034 variables, 257/272 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 574/1608 variables, 241/515 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1608 variables, 23/538 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1608 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 488/2096 variables, 226/764 constraints. Problems are: Problem set: 0 solved, 25 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 2096/2613 variables, and 764 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 724/1013 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10048ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 1013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Graph (trivial) has 988 edges and 1013 vertex of which 297 / 1013 are part of one of the 37 SCC in 13 ms
Free SCC test removed 260 places
Drop transitions (Empty/Sink Transition effects.) removed 328 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 331 transitions.
Graph (complete) has 2533 edges and 753 vertex of which 751 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 292 transitions
Trivial Post-agglo rules discarded 292 transitions
Performed 292 trivial Post agglomeration. Transition count delta: 292
Iterating post reduction 0 with 299 rules applied. Total rules applied 301 place count 750 transition count 971
Reduce places removed 292 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 297 rules applied. Total rules applied 598 place count 458 transition count 966
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 603 place count 453 transition count 966
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 603 place count 453 transition count 910
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 715 place count 397 transition count 910
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 731 place count 381 transition count 894
Iterating global reduction 3 with 16 rules applied. Total rules applied 747 place count 381 transition count 894
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 749 place count 381 transition count 892
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 749 place count 381 transition count 887
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 759 place count 376 transition count 887
Performed 90 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 939 place count 286 transition count 794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 941 place count 286 transition count 792
Performed 44 Post agglomeration using F-continuation condition with reduction of 68 identical transitions.
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 1029 place count 242 transition count 1000
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1049 place count 242 transition count 980
Drop transitions (Redundant composition of simpler transitions.) removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 6 with 145 rules applied. Total rules applied 1194 place count 242 transition count 835
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1202 place count 238 transition count 893
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1206 place count 238 transition count 889
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 7 with 54 rules applied. Total rules applied 1260 place count 238 transition count 835
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1261 place count 237 transition count 828
Iterating global reduction 7 with 1 rules applied. Total rules applied 1262 place count 237 transition count 828
Free-agglomeration rule applied 54 times with reduction of 20 identical transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 1316 place count 237 transition count 754
Reduce places removed 54 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 7 with 161 rules applied. Total rules applied 1477 place count 183 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 8 with 62 rules applied. Total rules applied 1539 place count 183 transition count 585
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 1560 place count 183 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1561 place count 182 transition count 584
Applied a total of 1561 rules in 313 ms. Remains 182 /1013 variables (removed 831) and now considering 584/1600 (removed 1016) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 182/1013 places, 584/1600 transitions.
RANDOM walk for 40000 steps (391 resets) in 311 ms. (128 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40004 steps (60 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (55 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (57 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
[2025-05-29 22:25:09] [INFO ] Flow matrix only has 399 transitions (discarded 185 similar events)
// Phase 1: matrix 399 rows 182 cols
[2025-05-29 22:25:09] [INFO ] Computed 20 invariants in 3 ms
[2025-05-29 22:25:09] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/182 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 399/581 variables, 182/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/581 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 188 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 182/182 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/182 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 399/581 variables, 182/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/581 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 581/581 variables, and 212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 409 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 182/182 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 610ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 2009 steps, including 46 resets, run visited all 1 properties in 7 ms. (steps per millisecond=287 )
Parikh walk visited 3 properties in 70 ms.
[2025-05-29 22:25:09] [INFO ] Flatten gal took : 65 ms
[2025-05-29 22:25:10] [INFO ] Flatten gal took : 62 ms
[2025-05-29 22:25:10] [INFO ] Input system was already deterministic with 1600 transitions.
Computed a total of 165 stabilizing places and 505 stable transitions
Graph (complete) has 2995 edges and 1013 vertex of which 995 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 958 transition count 1545
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 958 transition count 1545
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 112 place count 958 transition count 1543
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 136 place count 934 transition count 1519
Iterating global reduction 1 with 24 rules applied. Total rules applied 160 place count 934 transition count 1519
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 165 place count 934 transition count 1514
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 930 transition count 1510
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 930 transition count 1510
Applied a total of 173 rules in 98 ms. Remains 930 /1013 variables (removed 83) and now considering 1510/1600 (removed 90) transitions.
// Phase 1: matrix 1510 rows 930 cols
[2025-05-29 22:25:10] [INFO ] Computed 15 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:25:10] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-29 22:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:25:11] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned [11, 19, 185, 193, 359, 367, 532, 540, 705, 713]
[2025-05-29 22:25:11] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1369 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/1013 places, 1510/1600 transitions.
Applied a total of 0 rules in 24 ms. Remains 929 /929 variables (removed 0) and now considering 1510/1510 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1492 ms. Remains : 929/1013 places, 1510/1600 transitions.
[2025-05-29 22:25:11] [INFO ] Flatten gal took : 52 ms
[2025-05-29 22:25:11] [INFO ] Flatten gal took : 55 ms
[2025-05-29 22:25:11] [INFO ] Input system was already deterministic with 1510 transitions.
[2025-05-29 22:25:11] [INFO ] Flatten gal took : 54 ms
[2025-05-29 22:25:12] [INFO ] Flatten gal took : 67 ms
[2025-05-29 22:25:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality17692883652048504435.gal : 21 ms
[2025-05-29 22:25:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality5804037151135782874.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17692883652048504435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5804037151135782874.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:25:42] [INFO ] Flatten gal took : 52 ms
[2025-05-29 22:25:42] [INFO ] Applying decomposition
[2025-05-29 22:25:42] [INFO ] Flatten gal took : 51 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/graph776623622127022592.txt' '-o' '/tmp/graph776623622127022592.bin' '-w' '/tmp/graph776623622127022592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph776623622127022592.bin' '-l' '-1' '-v' '-w' '/tmp/graph776623622127022592.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:25:42] [INFO ] Decomposing Gal with order
[2025-05-29 22:25:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:25:42] [INFO ] Removed a total of 1762 redundant transitions.
[2025-05-29 22:25:42] [INFO ] Flatten gal took : 172 ms
[2025-05-29 22:25:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 28 ms.
[2025-05-29 22:25:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality6020982589717074104.gal : 15 ms
[2025-05-29 22:25:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17652479325453040709.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/CTLCardinality6020982589717074104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17652479325453040709.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,2.50524e+23,29.9603,524516,10050,357,681092,7137,1908,3.24662e+06,182,31829,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 960 transition count 1547
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 960 transition count 1547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 960 transition count 1545
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 131 place count 937 transition count 1522
Iterating global reduction 1 with 23 rules applied. Total rules applied 154 place count 937 transition count 1522
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 159 place count 937 transition count 1517
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 934 transition count 1514
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 934 transition count 1514
Applied a total of 165 rules in 105 ms. Remains 934 /1013 variables (removed 79) and now considering 1514/1600 (removed 86) transitions.
// Phase 1: matrix 1514 rows 934 cols
[2025-05-29 22:26:13] [INFO ] Computed 15 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:26:13] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-29 22:26:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:26:14] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned [11, 19, 188, 196, 362, 370, 535, 543, 708, 716]
[2025-05-29 22:26:14] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 933/1013 places, 1514/1600 transitions.
Applied a total of 0 rules in 23 ms. Remains 933 /933 variables (removed 0) and now considering 1514/1514 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1375 ms. Remains : 933/1013 places, 1514/1600 transitions.
[2025-05-29 22:26:14] [INFO ] Flatten gal took : 53 ms
[2025-05-29 22:26:14] [INFO ] Flatten gal took : 47 ms
[2025-05-29 22:26:14] [INFO ] Input system was already deterministic with 1514 transitions.
[2025-05-29 22:26:14] [INFO ] Flatten gal took : 46 ms
[2025-05-29 22:26:14] [INFO ] Flatten gal took : 46 ms
[2025-05-29 22:26:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1578393923378447290.gal : 8 ms
[2025-05-29 22:26:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3107923629533202646.ctl : 3 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/CTLCardinality1578393923378447290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3107923629533202646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:26:44] [INFO ] Flatten gal took : 46 ms
[2025-05-29 22:26:44] [INFO ] Applying decomposition
[2025-05-29 22:26:44] [INFO ] Flatten gal took : 59 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/graph12988217747961550812.txt' '-o' '/tmp/graph12988217747961550812.bin' '-w' '/tmp/graph12988217747961550812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12988217747961550812.bin' '-l' '-1' '-v' '-w' '/tmp/graph12988217747961550812.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:26:44] [INFO ] Decomposing Gal with order
[2025-05-29 22:26:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:26:45] [INFO ] Removed a total of 1603 redundant transitions.
[2025-05-29 22:26:45] [INFO ] Flatten gal took : 81 ms
[2025-05-29 22:26:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 23 ms.
[2025-05-29 22:26:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11639206396887221905.gal : 10 ms
[2025-05-29 22:26:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality3103337002843160227.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/CTLCardinality11639206396887221905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3103337002843160227.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 967 transition count 1554
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 967 transition count 1554
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 967 transition count 1552
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 115 place count 946 transition count 1531
Iterating global reduction 1 with 21 rules applied. Total rules applied 136 place count 946 transition count 1531
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 140 place count 946 transition count 1527
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 942 transition count 1523
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 942 transition count 1523
Applied a total of 148 rules in 78 ms. Remains 942 /1013 variables (removed 71) and now considering 1523/1600 (removed 77) transitions.
// Phase 1: matrix 1523 rows 942 cols
[2025-05-29 22:27:15] [INFO ] Computed 15 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:27:15] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-29 22:27:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:27:16] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
Running 1522 sub problems to find dead transitions.
[2025-05-29 22:27:16] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/941 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 941/2465 variables, and 15 constraints, problems are : Problem set: 0 solved, 1522 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/942 constraints, PredecessorRefiner: 1522/1221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1522 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/941 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1522 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 2)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 9)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 9)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 0)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 10)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 9)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 12)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 3)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 1)
(s893 1)
(s894 1)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 1)
(s901 1)
(s902 1)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 1)
(s908 1)
(s909 1)
(s910 0)
(s911 0)
(s912 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 941/2465 variables, and 15 constraints, problems are : Problem set: 0 solved, 1522 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/942 constraints, PredecessorRefiner: 301/1221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60983ms problems are : Problem set: 0 solved, 1522 unsolved
Search for dead transitions found 0 dead transitions in 60989ms
Starting structural reductions in LTL mode, iteration 1 : 942/1013 places, 1523/1600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62475 ms. Remains : 942/1013 places, 1523/1600 transitions.
[2025-05-29 22:28:17] [INFO ] Flatten gal took : 40 ms
[2025-05-29 22:28:17] [INFO ] Flatten gal took : 44 ms
[2025-05-29 22:28:17] [INFO ] Input system was already deterministic with 1523 transitions.
[2025-05-29 22:28:17] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:28:17] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:28:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality9021390759158421588.gal : 11 ms
[2025-05-29 22:28:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15206624215261464040.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/CTLCardinality9021390759158421588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15206624215261464040.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:28:48] [INFO ] Flatten gal took : 41 ms
[2025-05-29 22:28:48] [INFO ] Applying decomposition
[2025-05-29 22:28:48] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7645368038559905105.txt' '-o' '/tmp/graph7645368038559905105.bin' '-w' '/tmp/graph7645368038559905105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7645368038559905105.bin' '-l' '-1' '-v' '-w' '/tmp/graph7645368038559905105.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:28:48] [INFO ] Decomposing Gal with order
[2025-05-29 22:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:28:48] [INFO ] Removed a total of 2186 redundant transitions.
[2025-05-29 22:28:48] [INFO ] Flatten gal took : 76 ms
[2025-05-29 22:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 22 ms.
[2025-05-29 22:28:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality13578663706792079173.gal : 10 ms
[2025-05-29 22:28:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11657525502545797860.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/CTLCardinality13578663706792079173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11657525502545797860.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 958 transition count 1545
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 958 transition count 1545
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 958 transition count 1544
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 135 place count 934 transition count 1520
Iterating global reduction 1 with 24 rules applied. Total rules applied 159 place count 934 transition count 1520
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 164 place count 934 transition count 1515
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 168 place count 930 transition count 1511
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 930 transition count 1511
Applied a total of 172 rules in 91 ms. Remains 930 /1013 variables (removed 83) and now considering 1511/1600 (removed 89) transitions.
// Phase 1: matrix 1511 rows 930 cols
[2025-05-29 22:29:18] [INFO ] Computed 15 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:29:18] [INFO ] Implicit Places using invariants in 318 ms returned []
[2025-05-29 22:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:29:20] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned [11, 19, 185, 193, 358, 367, 532, 540, 705, 713]
[2025-05-29 22:29:20] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1420 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/1013 places, 1511/1600 transitions.
Applied a total of 0 rules in 20 ms. Remains 929 /929 variables (removed 0) and now considering 1511/1511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1531 ms. Remains : 929/1013 places, 1511/1600 transitions.
[2025-05-29 22:29:20] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:29:20] [INFO ] Flatten gal took : 40 ms
[2025-05-29 22:29:20] [INFO ] Input system was already deterministic with 1511 transitions.
[2025-05-29 22:29:20] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:29:20] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:29:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9795739398214736050.gal : 7 ms
[2025-05-29 22:29:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality4486638593994775730.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/CTLCardinality9795739398214736050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4486638593994775730.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:29:50] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:29:50] [INFO ] Applying decomposition
[2025-05-29 22:29:50] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2588299470961917146.txt' '-o' '/tmp/graph2588299470961917146.bin' '-w' '/tmp/graph2588299470961917146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2588299470961917146.bin' '-l' '-1' '-v' '-w' '/tmp/graph2588299470961917146.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:29:50] [INFO ] Decomposing Gal with order
[2025-05-29 22:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:29:50] [INFO ] Removed a total of 2183 redundant transitions.
[2025-05-29 22:29:50] [INFO ] Flatten gal took : 70 ms
[2025-05-29 22:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 12 ms.
[2025-05-29 22:29:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14672783888931680860.gal : 11 ms
[2025-05-29 22:29:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7576469833009192398.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/CTLCardinality14672783888931680860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7576469833009192398.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,2.79912e+23,10.3626,234808,8071,95,333771,1562,2032,1.50427e+06,119,4361,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 959 transition count 1546
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 959 transition count 1546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 110 place count 959 transition count 1544
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 133 place count 936 transition count 1521
Iterating global reduction 1 with 23 rules applied. Total rules applied 156 place count 936 transition count 1521
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 161 place count 936 transition count 1516
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 932 transition count 1512
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 932 transition count 1512
Applied a total of 169 rules in 88 ms. Remains 932 /1013 variables (removed 81) and now considering 1512/1600 (removed 88) transitions.
// Phase 1: matrix 1512 rows 932 cols
[2025-05-29 22:30:20] [INFO ] Computed 15 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:30:21] [INFO ] Implicit Places using invariants in 304 ms returned []
[2025-05-29 22:30:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:30:22] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned [11, 19, 186, 194, 359, 367, 532, 540, 705, 713]
[2025-05-29 22:30:22] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1349 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/1013 places, 1512/1600 transitions.
Applied a total of 0 rules in 24 ms. Remains 931 /931 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1463 ms. Remains : 931/1013 places, 1512/1600 transitions.
[2025-05-29 22:30:22] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:30:22] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:30:22] [INFO ] Input system was already deterministic with 1512 transitions.
[2025-05-29 22:30:22] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:30:22] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:30:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality7958268471230434825.gal : 6 ms
[2025-05-29 22:30:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15162864121218398651.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/CTLCardinality7958268471230434825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15162864121218398651.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:30:52] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:30:52] [INFO ] Applying decomposition
[2025-05-29 22:30:52] [INFO ] Flatten gal took : 49 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/graph1343873751937508299.txt' '-o' '/tmp/graph1343873751937508299.bin' '-w' '/tmp/graph1343873751937508299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1343873751937508299.bin' '-l' '-1' '-v' '-w' '/tmp/graph1343873751937508299.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:30:52] [INFO ] Decomposing Gal with order
[2025-05-29 22:30:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:30:52] [INFO ] Removed a total of 1708 redundant transitions.
[2025-05-29 22:30:52] [INFO ] Flatten gal took : 65 ms
[2025-05-29 22:30:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 16 ms.
[2025-05-29 22:30:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11404143596585896760.gal : 10 ms
[2025-05-29 22:30:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17804504262394577239.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/CTLCardinality11404143596585896760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17804504262394577239.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Graph (trivial) has 1052 edges and 1013 vertex of which 365 / 1013 are part of one of the 40 SCC in 2 ms
Free SCC test removed 325 places
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 370 transitions.
Graph (complete) has 2568 edges and 688 vertex of which 670 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 300 rules applied. Total rules applied 302 place count 669 transition count 926
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 602 place count 369 transition count 926
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 602 place count 369 transition count 886
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 682 place count 329 transition count 886
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 707 place count 304 transition count 861
Iterating global reduction 2 with 25 rules applied. Total rules applied 732 place count 304 transition count 861
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 734 place count 304 transition count 859
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 734 place count 304 transition count 854
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 744 place count 299 transition count 854
Performed 85 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 914 place count 214 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 916 place count 214 transition count 764
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 936 place count 214 transition count 744
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 10 rules applied. Total rules applied 946 place count 214 transition count 734
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 956 place count 204 transition count 734
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 966 place count 199 transition count 729
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 967 place count 198 transition count 728
Applied a total of 967 rules in 129 ms. Remains 198 /1013 variables (removed 815) and now considering 728/1600 (removed 872) transitions.
[2025-05-29 22:31:23] [INFO ] Flow matrix only has 589 transitions (discarded 139 similar events)
// Phase 1: matrix 589 rows 198 cols
[2025-05-29 22:31:23] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:31:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-29 22:31:23] [INFO ] Flow matrix only has 589 transitions (discarded 139 similar events)
[2025-05-29 22:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:31:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:31:23] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:31:24] [INFO ] Redundant transitions in 430 ms returned []
Running 687 sub problems to find dead transitions.
[2025-05-29 22:31:24] [INFO ] Flow matrix only has 589 transitions (discarded 139 similar events)
[2025-05-29 22:31:24] [INFO ] Invariant cache hit.
[2025-05-29 22:31:24] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (OVERLAPS) 588/781 variables, 193/198 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 25/223 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 687 unsolved
SMT process timed out in 30739ms, After SMT, problems are : Problem set: 0 solved, 687 unsolved
Search for dead transitions found 0 dead transitions in 30740ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/1013 places, 728/1600 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31765 ms. Remains : 198/1013 places, 728/1600 transitions.
[2025-05-29 22:31:54] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:31:54] [INFO ] Flatten gal took : 28 ms
[2025-05-29 22:31:54] [INFO ] Input system was already deterministic with 728 transitions.
[2025-05-29 22:31:54] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:31:55] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:31:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17859598580578163101.gal : 5 ms
[2025-05-29 22:31:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality625724790964420000.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/CTLCardinality17859598580578163101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality625724790964420000.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,6.20346e+15,5.78454,142608,2,16142,5,601643,6,0,1457,550007,0


Converting to forward existential form...Done !
original formula: EG((p107==0))
=> equivalent forward existential formula: [FwdG(Init,(p107==0))] != FALSE
Hit Full ! (commute/partial/dont) 726/0/2
(forward)formula 0,1,20.9793,434044,1,0,8,2.28013e+06,19,4,11180,1.64218e+06,8
FORMULA CloudDeployment-PT-5b-CTLCardinality-2025-06 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 : 1013/1013 places, 1600/1600 transitions.
Graph (trivial) has 1050 edges and 1013 vertex of which 361 / 1013 are part of one of the 40 SCC in 4 ms
Free SCC test removed 321 places
Ensure Unique test removed 365 transitions
Reduce isomorphic transitions removed 365 transitions.
Graph (complete) has 2573 edges and 692 vertex of which 674 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 303 place count 673 transition count 930
Reduce places removed 301 places and 0 transitions.
Iterating post reduction 1 with 301 rules applied. Total rules applied 604 place count 372 transition count 930
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 604 place count 372 transition count 890
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 684 place count 332 transition count 890
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 708 place count 308 transition count 866
Iterating global reduction 2 with 24 rules applied. Total rules applied 732 place count 308 transition count 866
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 734 place count 308 transition count 864
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 734 place count 308 transition count 859
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 744 place count 303 transition count 859
Performed 85 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 914 place count 218 transition count 771
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 916 place count 218 transition count 769
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 936 place count 218 transition count 749
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 10 rules applied. Total rules applied 946 place count 218 transition count 739
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 956 place count 208 transition count 739
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 966 place count 203 transition count 734
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 967 place count 202 transition count 733
Applied a total of 967 rules in 100 ms. Remains 202 /1013 variables (removed 811) and now considering 733/1600 (removed 867) transitions.
[2025-05-29 22:32:16] [INFO ] Flow matrix only has 594 transitions (discarded 139 similar events)
// Phase 1: matrix 594 rows 202 cols
[2025-05-29 22:32:16] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:32:16] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 22:32:16] [INFO ] Flow matrix only has 594 transitions (discarded 139 similar events)
[2025-05-29 22:32:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:32:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:32:16] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:32:17] [INFO ] Redundant transitions in 516 ms returned []
Running 692 sub problems to find dead transitions.
[2025-05-29 22:32:17] [INFO ] Flow matrix only has 594 transitions (discarded 139 similar events)
[2025-05-29 22:32:17] [INFO ] Invariant cache hit.
[2025-05-29 22:32:17] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (OVERLAPS) 593/790 variables, 197/202 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/790 variables, 25/227 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/796 variables, and 227 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 197/202 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 692/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 692 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 2 (OVERLAPS) 593/790 variables, 197/202 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/790 variables, 25/227 constraints. Problems are: Problem set: 0 solved, 692 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 48/275 constraints. Problems are: Problem set: 0 solved, 692 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/796 variables, and 275 constraints, problems are : Problem set: 0 solved, 692 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 197/202 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 349/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60731ms problems are : Problem set: 0 solved, 692 unsolved
Search for dead transitions found 0 dead transitions in 60733ms
Starting structural reductions in SI_CTL mode, iteration 1 : 202/1013 places, 733/1600 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61853 ms. Remains : 202/1013 places, 733/1600 transitions.
[2025-05-29 22:33:18] [INFO ] Flatten gal took : 29 ms
[2025-05-29 22:33:18] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:33:18] [INFO ] Input system was already deterministic with 733 transitions.
[2025-05-29 22:33:18] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:33:18] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:33:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8210654685468845247.gal : 4 ms
[2025-05-29 22:33:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality18211867773710401155.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/CTLCardinality8210654685468845247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18211867773710401155.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,7.0975e+15,5.25382,152628,2,17640,5,645642,6,0,1478,590371,0


Converting to forward existential form...Done !
original formula: EG(((p738==0)||(p1102==1)))
=> equivalent forward existential formula: [FwdG(Init,((p738==0)||(p1102==1)))] != FALSE
Hit Full ! (commute/partial/dont) 729/0/4
(forward)formula 0,1,18.8609,442816,1,0,8,2.36909e+06,19,4,11359,1.58824e+06,8
FORMULA CloudDeployment-PT-5b-CTLCardinality-2025-07 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 : 1013/1013 places, 1600/1600 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 964 transition count 1551
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 964 transition count 1551
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 964 transition count 1549
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 119 place count 945 transition count 1530
Iterating global reduction 1 with 19 rules applied. Total rules applied 138 place count 945 transition count 1530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 142 place count 945 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 944 transition count 1525
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 944 transition count 1525
Applied a total of 144 rules in 77 ms. Remains 944 /1013 variables (removed 69) and now considering 1525/1600 (removed 75) transitions.
// Phase 1: matrix 1525 rows 944 cols
[2025-05-29 22:33:37] [INFO ] Computed 15 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:33:37] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-29 22:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:33:38] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned [11, 19, 188, 196, 367, 375, 542, 552, 717, 725]
[2025-05-29 22:33:38] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1286 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 943/1013 places, 1525/1600 transitions.
Applied a total of 0 rules in 29 ms. Remains 943 /943 variables (removed 0) and now considering 1525/1525 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1393 ms. Remains : 943/1013 places, 1525/1600 transitions.
[2025-05-29 22:33:38] [INFO ] Flatten gal took : 43 ms
[2025-05-29 22:33:38] [INFO ] Flatten gal took : 44 ms
[2025-05-29 22:33:38] [INFO ] Input system was already deterministic with 1525 transitions.
[2025-05-29 22:33:38] [INFO ] Flatten gal took : 52 ms
[2025-05-29 22:33:38] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:33:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8386233420464872387.gal : 7 ms
[2025-05-29 22:33:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11395233481326756259.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/CTLCardinality8386233420464872387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11395233481326756259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:34:09] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:34:09] [INFO ] Applying decomposition
[2025-05-29 22:34:09] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16653715279520651201.txt' '-o' '/tmp/graph16653715279520651201.bin' '-w' '/tmp/graph16653715279520651201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16653715279520651201.bin' '-l' '-1' '-v' '-w' '/tmp/graph16653715279520651201.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:34:09] [INFO ] Decomposing Gal with order
[2025-05-29 22:34:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:34:09] [INFO ] Removed a total of 2193 redundant transitions.
[2025-05-29 22:34:09] [INFO ] Flatten gal took : 90 ms
[2025-05-29 22:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 48 ms.
[2025-05-29 22:34:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality1654041866298871636.gal : 12 ms
[2025-05-29 22:34:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7922829345777643576.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/CTLCardinality1654041866298871636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7922829345777643576.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,3.3457e+23,11.7541,246860,6698,79,408774,1675,2096,1.24906e+06,116,6176,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 967 transition count 1554
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 967 transition count 1554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 967 transition count 1553
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 115 place count 945 transition count 1531
Iterating global reduction 1 with 22 rules applied. Total rules applied 137 place count 945 transition count 1531
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 142 place count 945 transition count 1526
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 146 place count 941 transition count 1522
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 941 transition count 1522
Applied a total of 150 rules in 73 ms. Remains 941 /1013 variables (removed 72) and now considering 1522/1600 (removed 78) transitions.
// Phase 1: matrix 1522 rows 941 cols
[2025-05-29 22:34:39] [INFO ] Computed 15 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:34:39] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-29 22:34:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:34:41] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned [11, 19, 188, 197, 362, 370, 537, 545, 714, 722]
[2025-05-29 22:34:41] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1496 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 940/1013 places, 1522/1600 transitions.
Applied a total of 0 rules in 19 ms. Remains 940 /940 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1589 ms. Remains : 940/1013 places, 1522/1600 transitions.
[2025-05-29 22:34:41] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:34:41] [INFO ] Flatten gal took : 41 ms
[2025-05-29 22:34:41] [INFO ] Input system was already deterministic with 1522 transitions.
[2025-05-29 22:34:41] [INFO ] Flatten gal took : 51 ms
[2025-05-29 22:34:41] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:34:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality10070398690863668605.gal : 7 ms
[2025-05-29 22:34:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality2606908123397119924.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/CTLCardinality10070398690863668605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2606908123397119924.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:35:11] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:35:11] [INFO ] Applying decomposition
[2025-05-29 22:35:11] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18306265247310942649.txt' '-o' '/tmp/graph18306265247310942649.bin' '-w' '/tmp/graph18306265247310942649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18306265247310942649.bin' '-l' '-1' '-v' '-w' '/tmp/graph18306265247310942649.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:35:11] [INFO ] Decomposing Gal with order
[2025-05-29 22:35:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:35:11] [INFO ] Removed a total of 1843 redundant transitions.
[2025-05-29 22:35:11] [INFO ] Flatten gal took : 68 ms
[2025-05-29 22:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 9 ms.
[2025-05-29 22:35:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality10353953181667303129.gal : 10 ms
[2025-05-29 22:35:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8521184627584398958.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/CTLCardinality10353953181667303129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8521184627584398958.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,2.9692e+23,13.4828,341128,9754,218,600868,3581,2021,1.85566e+06,162,10700,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 959 transition count 1546
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 959 transition count 1546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 110 place count 959 transition count 1544
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 133 place count 936 transition count 1521
Iterating global reduction 1 with 23 rules applied. Total rules applied 156 place count 936 transition count 1521
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 161 place count 936 transition count 1516
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 932 transition count 1512
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 932 transition count 1512
Applied a total of 169 rules in 85 ms. Remains 932 /1013 variables (removed 81) and now considering 1512/1600 (removed 88) transitions.
// Phase 1: matrix 1512 rows 932 cols
[2025-05-29 22:35:41] [INFO ] Computed 15 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:35:42] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-29 22:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:35:43] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned [11, 19, 187, 195, 360, 368, 533, 541, 706, 714]
[2025-05-29 22:35:43] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/1013 places, 1512/1600 transitions.
Applied a total of 0 rules in 28 ms. Remains 931 /931 variables (removed 0) and now considering 1512/1512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1379 ms. Remains : 931/1013 places, 1512/1600 transitions.
[2025-05-29 22:35:43] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:35:43] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:35:43] [INFO ] Input system was already deterministic with 1512 transitions.
[2025-05-29 22:35:43] [INFO ] Flatten gal took : 40 ms
[2025-05-29 22:35:43] [INFO ] Flatten gal took : 41 ms
[2025-05-29 22:35:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15309020349129215016.gal : 6 ms
[2025-05-29 22:35:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8706763432742329140.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/CTLCardinality15309020349129215016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8706763432742329140.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:36:13] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:36:13] [INFO ] Applying decomposition
[2025-05-29 22:36:13] [INFO ] Flatten gal took : 43 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/graph1924150598107374158.txt' '-o' '/tmp/graph1924150598107374158.bin' '-w' '/tmp/graph1924150598107374158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1924150598107374158.bin' '-l' '-1' '-v' '-w' '/tmp/graph1924150598107374158.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:36:13] [INFO ] Decomposing Gal with order
[2025-05-29 22:36:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:36:13] [INFO ] Removed a total of 1824 redundant transitions.
[2025-05-29 22:36:13] [INFO ] Flatten gal took : 64 ms
[2025-05-29 22:36:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 8 ms.
[2025-05-29 22:36:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality9043307344071940239.gal : 9 ms
[2025-05-29 22:36:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17272340806219048469.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/CTLCardinality9043307344071940239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17272340806219048469.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,2.53674e+23,10.2523,223552,9743,239,411322,3001,1962,979445,163,9199,0


Converting to forward existential form...Done !
original formula: EX(E((i18.i0.i1.u240.p1110==0) U !(A(A((i3.i1.i1.u61.p285==1) U (i22.u312.p1418==1)) U (i8.i0.i0.u117.p530==0)))))
=> equivalent forward existential formula: (([(FwdU((FwdU(FwdU(EY(Init),(i18.i0.i1.u240.p1110==0)),!((i8.i0.i0.u117.p530==0))) * !((i8.i0.i0.u117.p530==0))...482
(forward)formula 0,1,16.4315,246080,1,0,488542,3001,5493,979445,308,9199,1206829
FORMULA CloudDeployment-PT-5b-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 961 transition count 1548
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 961 transition count 1548
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 106 place count 961 transition count 1546
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 127 place count 940 transition count 1525
Iterating global reduction 1 with 21 rules applied. Total rules applied 148 place count 940 transition count 1525
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 152 place count 940 transition count 1521
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 936 transition count 1517
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 936 transition count 1517
Applied a total of 160 rules in 84 ms. Remains 936 /1013 variables (removed 77) and now considering 1517/1600 (removed 83) transitions.
// Phase 1: matrix 1517 rows 936 cols
[2025-05-29 22:36:30] [INFO ] Computed 15 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:36:30] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-29 22:36:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:36:31] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned [11, 19, 185, 195, 360, 368, 534, 544, 711, 719]
[2025-05-29 22:36:31] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 935/1013 places, 1517/1600 transitions.
Applied a total of 0 rules in 25 ms. Remains 935 /935 variables (removed 0) and now considering 1517/1517 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1304 ms. Remains : 935/1013 places, 1517/1600 transitions.
[2025-05-29 22:36:31] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:36:31] [INFO ] Flatten gal took : 41 ms
[2025-05-29 22:36:31] [INFO ] Input system was already deterministic with 1517 transitions.
[2025-05-29 22:36:31] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:36:31] [INFO ] Flatten gal took : 40 ms
[2025-05-29 22:36:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality11441810427081310394.gal : 7 ms
[2025-05-29 22:36:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14747776790775031235.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11441810427081310394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14747776790775031235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:37:02] [INFO ] Flatten gal took : 39 ms
[2025-05-29 22:37:02] [INFO ] Applying decomposition
[2025-05-29 22:37:02] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14474679900657475984.txt' '-o' '/tmp/graph14474679900657475984.bin' '-w' '/tmp/graph14474679900657475984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14474679900657475984.bin' '-l' '-1' '-v' '-w' '/tmp/graph14474679900657475984.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:37:02] [INFO ] Decomposing Gal with order
[2025-05-29 22:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:37:02] [INFO ] Removed a total of 2173 redundant transitions.
[2025-05-29 22:37:02] [INFO ] Flatten gal took : 57 ms
[2025-05-29 22:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 8 ms.
[2025-05-29 22:37:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality17405438161507101973.gal : 7 ms
[2025-05-29 22:37:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8520665594847400293.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/CTLCardinality17405438161507101973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8520665594847400293.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,3.61877e+23,21.9718,485844,15031,94,606947,1377,1938,3.70996e+06,117,3309,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Graph (trivial) has 1030 edges and 1013 vertex of which 352 / 1013 are part of one of the 40 SCC in 2 ms
Free SCC test removed 312 places
Ensure Unique test removed 353 transitions
Reduce isomorphic transitions removed 353 transitions.
Graph (complete) has 2587 edges and 701 vertex of which 683 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 293 rules applied. Total rules applied 295 place count 682 transition count 950
Reduce places removed 293 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 298 rules applied. Total rules applied 593 place count 389 transition count 945
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 597 place count 385 transition count 945
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 597 place count 385 transition count 902
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 683 place count 342 transition count 902
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 704 place count 321 transition count 881
Iterating global reduction 3 with 21 rules applied. Total rules applied 725 place count 321 transition count 881
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 727 place count 321 transition count 879
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 727 place count 321 transition count 874
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 737 place count 316 transition count 874
Performed 85 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 907 place count 231 transition count 786
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 909 place count 231 transition count 784
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 929 place count 231 transition count 764
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 10 rules applied. Total rules applied 939 place count 231 transition count 754
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 949 place count 221 transition count 754
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 959 place count 216 transition count 749
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 960 place count 216 transition count 749
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 961 place count 215 transition count 748
Applied a total of 961 rules in 99 ms. Remains 215 /1013 variables (removed 798) and now considering 748/1600 (removed 852) transitions.
[2025-05-29 22:37:32] [INFO ] Flow matrix only has 609 transitions (discarded 139 similar events)
// Phase 1: matrix 609 rows 215 cols
[2025-05-29 22:37:32] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:32] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-29 22:37:32] [INFO ] Flow matrix only has 609 transitions (discarded 139 similar events)
[2025-05-29 22:37:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:37:32] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:37:33] [INFO ] Redundant transitions in 482 ms returned []
Running 706 sub problems to find dead transitions.
[2025-05-29 22:37:33] [INFO ] Flow matrix only has 609 transitions (discarded 139 similar events)
[2025-05-29 22:37:33] [INFO ] Invariant cache hit.
[2025-05-29 22:37:33] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (OVERLAPS) 608/818 variables, 210/215 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/818 variables, 25/240 constraints. Problems are: Problem set: 0 solved, 706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/824 variables, and 240 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 210/215 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 706/405 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (OVERLAPS) 608/818 variables, 210/215 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/818 variables, 25/240 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/818 variables, 64/304 constraints. Problems are: Problem set: 0 solved, 706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/824 variables, and 304 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 210/215 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 365/405 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60767ms problems are : Problem set: 0 solved, 706 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Starting structural reductions in SI_CTL mode, iteration 1 : 215/1013 places, 748/1600 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61843 ms. Remains : 215/1013 places, 748/1600 transitions.
[2025-05-29 22:38:34] [INFO ] Flatten gal took : 23 ms
[2025-05-29 22:38:34] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:38:34] [INFO ] Input system was already deterministic with 748 transitions.
[2025-05-29 22:38:34] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:38:34] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality10807359629308716639.gal : 4 ms
[2025-05-29 22:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality14498241832236735807.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/CTLCardinality10807359629308716639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14498241832236735807.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.24804e+16,10.1352,234660,2,21487,5,977565,6,0,1545,972978,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:39:04] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:39:04] [INFO ] Applying decomposition
[2025-05-29 22:39:04] [INFO ] Flatten gal took : 24 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/graph17699732043723946451.txt' '-o' '/tmp/graph17699732043723946451.bin' '-w' '/tmp/graph17699732043723946451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17699732043723946451.bin' '-l' '-1' '-v' '-w' '/tmp/graph17699732043723946451.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:39:04] [INFO ] Decomposing Gal with order
[2025-05-29 22:39:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:39:04] [INFO ] Removed a total of 1662 redundant transitions.
[2025-05-29 22:39:04] [INFO ] Flatten gal took : 36 ms
[2025-05-29 22:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 6 ms.
[2025-05-29 22:39:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality3712773728402036187.gal : 3 ms
[2025-05-29 22:39:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality13505918202362610888.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/CTLCardinality3712773728402036187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13505918202362610888.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,1.24804e+16,0.118089,8476,521,55,8021,588,885,14810,111,1432,0


Converting to forward existential form...Done !
original formula: AG(!(A(((((i3.i1.u28.p673!=0)||(((i4.u45.p997==0)||(i2.u20.p447==1))&&((i1.i1.u6.p185==0)||(i2.u17.p402==1)))) * !(EF((i1.i1.u8.p200==1))...311
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(EG(!(((((i2.u18.p418==1)||(i3.i2.u35.p767==0))||(i5.i2.u60.p1326==1)) * !(EG(!((i3...629
Reverse transition relation is NOT exact ! Due to transitions t1, t288, t308, t393, t401, t423, t533, t548, t578, t588, t644, t645, u65.t2, i1.t112, i1.i0....908
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Graph (trivial) has 1052 edges and 1013 vertex of which 365 / 1013 are part of one of the 40 SCC in 3 ms
Free SCC test removed 325 places
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 370 transitions.
Graph (complete) has 2568 edges and 688 vertex of which 670 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 300 rules applied. Total rules applied 302 place count 669 transition count 926
Reduce places removed 300 places and 0 transitions.
Iterating post reduction 1 with 300 rules applied. Total rules applied 602 place count 369 transition count 926
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 602 place count 369 transition count 886
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 682 place count 329 transition count 886
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 706 place count 305 transition count 862
Iterating global reduction 2 with 24 rules applied. Total rules applied 730 place count 305 transition count 862
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 732 place count 305 transition count 860
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 732 place count 305 transition count 855
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 742 place count 300 transition count 855
Performed 85 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 912 place count 215 transition count 767
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 914 place count 215 transition count 765
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 934 place count 215 transition count 745
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 10 rules applied. Total rules applied 944 place count 215 transition count 735
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 954 place count 205 transition count 735
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 964 place count 200 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 965 place count 199 transition count 729
Applied a total of 965 rules in 76 ms. Remains 199 /1013 variables (removed 814) and now considering 729/1600 (removed 871) transitions.
[2025-05-29 22:39:34] [INFO ] Flow matrix only has 590 transitions (discarded 139 similar events)
// Phase 1: matrix 590 rows 199 cols
[2025-05-29 22:39:34] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:34] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-29 22:39:34] [INFO ] Flow matrix only has 590 transitions (discarded 139 similar events)
[2025-05-29 22:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:39:35] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:39:35] [INFO ] Redundant transitions in 486 ms returned []
Running 688 sub problems to find dead transitions.
[2025-05-29 22:39:35] [INFO ] Flow matrix only has 590 transitions (discarded 139 similar events)
[2025-05-29 22:39:35] [INFO ] Invariant cache hit.
[2025-05-29 22:39:35] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (OVERLAPS) 589/783 variables, 194/199 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 25/224 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 688 unsolved
SMT process timed out in 30694ms, After SMT, problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 30696ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/1013 places, 729/1600 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31807 ms. Remains : 199/1013 places, 729/1600 transitions.
[2025-05-29 22:40:06] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:40:06] [INFO ] Flatten gal took : 23 ms
[2025-05-29 22:40:06] [INFO ] Input system was already deterministic with 729 transitions.
[2025-05-29 22:40:06] [INFO ] Flatten gal took : 23 ms
[2025-05-29 22:40:06] [INFO ] Flatten gal took : 29 ms
[2025-05-29 22:40:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality10501015961642171846.gal : 4 ms
[2025-05-29 22:40:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6393520728420736806.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/CTLCardinality10501015961642171846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6393520728420736806.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,5.96907e+15,5.15688,141460,2,16353,5,599058,6,0,1462,547312,0


Converting to forward existential form...Done !
original formula: EF(EG((p99==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p99==0))] != FALSE
Hit Full ! (commute/partial/dont) 727/0/2
(forward)formula 0,1,13.9687,316788,1,0,8,1.74982e+06,19,3,11194,1.06412e+06,8
FORMULA CloudDeployment-PT-5b-CTLCardinality-2023-13 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 : 1013/1013 places, 1600/1600 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 957 transition count 1544
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 957 transition count 1544
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 957 transition count 1542
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 138 place count 933 transition count 1518
Iterating global reduction 1 with 24 rules applied. Total rules applied 162 place count 933 transition count 1518
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 167 place count 933 transition count 1513
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 929 transition count 1509
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 929 transition count 1509
Applied a total of 175 rules in 75 ms. Remains 929 /1013 variables (removed 84) and now considering 1509/1600 (removed 91) transitions.
// Phase 1: matrix 1509 rows 929 cols
[2025-05-29 22:40:20] [INFO ] Computed 15 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:40:20] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-29 22:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:40:22] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned [11, 19, 185, 193, 358, 366, 531, 539, 704, 712]
[2025-05-29 22:40:22] [INFO ] Actually due to overlaps returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1294 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/1013 places, 1509/1600 transitions.
Applied a total of 0 rules in 19 ms. Remains 928 /928 variables (removed 0) and now considering 1509/1509 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1389 ms. Remains : 928/1013 places, 1509/1600 transitions.
[2025-05-29 22:40:22] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:40:22] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:40:22] [INFO ] Input system was already deterministic with 1509 transitions.
[2025-05-29 22:40:22] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:40:22] [INFO ] Flatten gal took : 38 ms
[2025-05-29 22:40:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6197394512884482824.gal : 6 ms
[2025-05-29 22:40:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4190012932679426691.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/CTLCardinality6197394512884482824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4190012932679426691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 22:40:52] [INFO ] Flatten gal took : 52 ms
[2025-05-29 22:40:52] [INFO ] Applying decomposition
[2025-05-29 22:40:52] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1263472190435085187.txt' '-o' '/tmp/graph1263472190435085187.bin' '-w' '/tmp/graph1263472190435085187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1263472190435085187.bin' '-l' '-1' '-v' '-w' '/tmp/graph1263472190435085187.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:40:52] [INFO ] Decomposing Gal with order
[2025-05-29 22:40:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:40:52] [INFO ] Removed a total of 1718 redundant transitions.
[2025-05-29 22:40:52] [INFO ] Flatten gal took : 62 ms
[2025-05-29 22:40:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 9 ms.
[2025-05-29 22:40:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality12151508142121203051.gal : 7 ms
[2025-05-29 22:40:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7358270940927586650.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/CTLCardinality12151508142121203051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7358270940927586650.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,2.48839e+23,5.8693,147012,4814,360,225119,6800,1905,613702,189,24913,0


Converting to forward existential form...Done !
original formula: AF(AX(EG(((i15.u200.p965==0)||(i10.u133.p659==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EG(((i15.u200.p965==0)||(i10.u133.p659==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t171, t172, t180, t359, t360, t547, t548, t566, t735, t736, t754, t922, t932, t968, t970,...1835
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1013/1013 places, 1600/1600 transitions.
Graph (trivial) has 1037 edges and 1013 vertex of which 348 / 1013 are part of one of the 39 SCC in 1 ms
Free SCC test removed 309 places
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Graph (complete) has 2594 edges and 704 vertex of which 686 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 298 rules applied. Total rules applied 300 place count 685 transition count 947
Reduce places removed 298 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 306 rules applied. Total rules applied 606 place count 387 transition count 939
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 615 place count 379 transition count 938
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 615 place count 379 transition count 897
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 697 place count 338 transition count 897
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 722 place count 313 transition count 872
Iterating global reduction 3 with 25 rules applied. Total rules applied 747 place count 313 transition count 872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 749 place count 313 transition count 870
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 749 place count 313 transition count 864
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 761 place count 307 transition count 864
Performed 85 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 931 place count 222 transition count 776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 933 place count 222 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 953 place count 222 transition count 754
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 9 rules applied. Total rules applied 962 place count 222 transition count 745
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 971 place count 213 transition count 745
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 983 place count 207 transition count 739
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 984 place count 206 transition count 738
Applied a total of 984 rules in 76 ms. Remains 206 /1013 variables (removed 807) and now considering 738/1600 (removed 862) transitions.
[2025-05-29 22:41:22] [INFO ] Flow matrix only has 605 transitions (discarded 133 similar events)
// Phase 1: matrix 605 rows 206 cols
[2025-05-29 22:41:22] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-29 22:41:22] [INFO ] Flow matrix only has 605 transitions (discarded 133 similar events)
[2025-05-29 22:41:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:41:23] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:41:23] [INFO ] Redundant transitions in 477 ms returned []
Running 700 sub problems to find dead transitions.
[2025-05-29 22:41:23] [INFO ] Flow matrix only has 605 transitions (discarded 133 similar events)
[2025-05-29 22:41:23] [INFO ] Invariant cache hit.
[2025-05-29 22:41:23] [INFO ] State equation strengthened by 25 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (OVERLAPS) 604/804 variables, 200/205 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 25/230 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/811 variables, and 230 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 200/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 700/399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (OVERLAPS) 604/804 variables, 200/205 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/804 variables, 25/230 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/804 variables, 52/282 constraints. Problems are: Problem set: 0 solved, 700 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 804/811 variables, and 282 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 200/206 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 353/399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60749ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60750ms
Starting structural reductions in SI_CTL mode, iteration 1 : 206/1013 places, 738/1600 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61789 ms. Remains : 206/1013 places, 738/1600 transitions.
[2025-05-29 22:42:24] [INFO ] Flatten gal took : 22 ms
[2025-05-29 22:42:24] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:42:24] [INFO ] Input system was already deterministic with 738 transitions.
[2025-05-29 22:42:24] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:42:24] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:42:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality500951457492055203.gal : 4 ms
[2025-05-29 22:42:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality11377682741884512082.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/CTLCardinality500951457492055203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11377682741884512082.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.07116e+16,7.83671,211156,2,35360,5,936132,6,0,1503,820385,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 22:42:54] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:42:54] [INFO ] Applying decomposition
[2025-05-29 22:42:54] [INFO ] Flatten gal took : 24 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/graph5741001007446315548.txt' '-o' '/tmp/graph5741001007446315548.bin' '-w' '/tmp/graph5741001007446315548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5741001007446315548.bin' '-l' '-1' '-v' '-w' '/tmp/graph5741001007446315548.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:42:54] [INFO ] Decomposing Gal with order
[2025-05-29 22:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:42:54] [INFO ] Removed a total of 1650 redundant transitions.
[2025-05-29 22:42:54] [INFO ] Flatten gal took : 35 ms
[2025-05-29 22:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 5 ms.
[2025-05-29 22:42:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17044225978370769170.gal : 2 ms
[2025-05-29 22:42:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18229158090212667464.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/CTLCardinality17044225978370769170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18229158090212667464.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,1.07116e+16,0.089404,6684,347,55,4537,482,753,6689,110,1000,0


Converting to forward existential form...Done !
original formula: AG(!(A(((i6.u66.p1517==0)||(i5.i2.u54.p1410==1)) U !((((i5.i1.u52.p1352==0)&&(i3.u23.p661==0))&&(i5.i1.u51.p1331!=1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!((((i5.i1.u52.p1352==0)&&(i3.u23.p661==0))&&(i5.i1.u51.p1331!=1))))))) * !(E(!(!(((...353
Reverse transition relation is NOT exact ! Due to transitions t259, t276, t382, u68.t1, i0.t103, i0.t96, i0.u0.t114, i0.u1.t110, i0.u2.t191, i0.u2.t192, i0...785
Detected timeout of ITS tools.
[2025-05-29 22:43:25] [INFO ] Flatten gal took : 43 ms
[2025-05-29 22:43:25] [INFO ] Flatten gal took : 44 ms
[2025-05-29 22:43:25] [INFO ] Applying decomposition
[2025-05-29 22:43:25] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18083228818779605334.txt' '-o' '/tmp/graph18083228818779605334.bin' '-w' '/tmp/graph18083228818779605334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18083228818779605334.bin' '-l' '-1' '-v' '-w' '/tmp/graph18083228818779605334.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:43:25] [INFO ] Decomposing Gal with order
[2025-05-29 22:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:43:25] [INFO ] Removed a total of 1836 redundant transitions.
[2025-05-29 22:43:25] [INFO ] Flatten gal took : 68 ms
[2025-05-29 22:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 9 ms.
[2025-05-29 22:43:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality10265083168882523804.gal : 9 ms
[2025-05-29 22:43:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17028312002737662456.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/CTLCardinality10265083168882523804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17028312002737662456.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 11 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.57364e+24,759.905,10798176,19848,685,1.04405e+07,45623,2233,1.00733e+08,198,217056,0


Converting to forward existential form...Done !
original formula: AG(EX(AF(((i4.u149.p380==0)||(i3.i0.i0.u14.p95==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!(((i4.u149.p380==0)||(i3.i0.i0.u14.p95==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t182, t183, t386, t387, t405, t558, t588, t589, t599, t764, t795, t804, t814, t842, t1001...2069
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 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 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
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Detected timeout of ITS tools.
[2025-05-29 23:09:56] [INFO ] Applying decomposition
[2025-05-29 23:09:56] [INFO ] Flatten gal took : 47 ms
[2025-05-29 23:09:56] [INFO ] Decomposing Gal with order
[2025-05-29 23:09:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:09:56] [INFO ] Removed a total of 1856 redundant transitions.
[2025-05-29 23:09:56] [INFO ] Flatten gal took : 64 ms
[2025-05-29 23:09:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 464 labels/synchronizations in 11 ms.
[2025-05-29 23:09:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality12697629985868313375.gal : 6 ms
[2025-05-29 23:09:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10691746776574836699.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/CTLCardinality12697629985868313375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10691746776574836699.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 11 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.57364e+24,14.1292,340980,3705,9275,359740,272992,1113,1.23383e+06,1624,1.85904e+06,0


Converting to forward existential form...Done !
original formula: AG(EX(AF(((i0.i0.i0.i0.i0.i1.u15.p380==0)||(i0.i0.i0.i0.i0.i0.u10.p95==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!(((i0.i0.i0.i0.i0.i1.u15.p380==0)||(i0.i0.i0.i0.i0.i0.u10.p95==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1052, t1193, t1199, t1219, t1226, u40.t5, u40.t6, i0.t1562, i0.t1555, i0.t1554, i0.t1545, i0...3440
Using saturation style SCC detection
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="CloudDeployment-PT-5b"
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 CloudDeployment-PT-5b, 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-174854027700057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;