Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 82K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716378269187

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 11:44:30] [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]
[2024-05-22 11:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:44:30] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-22 11:44:30] [INFO ] Transformed 324 places.
[2024-05-22 11:44:30] [INFO ] Transformed 344 transitions.
[2024-05-22 11:44:30] [INFO ] Found NUPN structural information;
[2024-05-22 11:44:30] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 308 transition count 344
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 49 place count 275 transition count 311
Iterating global reduction 1 with 33 rules applied. Total rules applied 82 place count 275 transition count 311
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 269 transition count 305
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 269 transition count 305
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 265 transition count 301
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 265 transition count 301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 263 transition count 299
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 263 transition count 299
Applied a total of 106 rules in 77 ms. Remains 263 /324 variables (removed 61) and now considering 299/344 (removed 45) transitions.
// Phase 1: matrix 299 rows 263 cols
[2024-05-22 11:44:30] [INFO ] Computed 3 invariants in 20 ms
[2024-05-22 11:44:30] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-22 11:44:30] [INFO ] Invariant cache hit.
[2024-05-22 11:44:31] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2024-05-22 11:44:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 3/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 11:44:34] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 7 ms to minimize.
[2024-05-22 11:44:34] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 299/558 variables, 259/264 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:44:38] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-22 11:44:39] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 4/562 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/562 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 289 constraints, problems are : Problem set: 0 solved, 298 unsolved in 21373 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 3/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 299/558 variables, 259/285 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 4/562 variables, 4/583 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/562 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 587 constraints, problems are : Problem set: 0 solved, 298 unsolved in 27003 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 23/23 constraints]
After SMT, in 48543ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 48568ms
Starting structural reductions in LTL mode, iteration 1 : 263/324 places, 299/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49172 ms. Remains : 263/324 places, 299/344 transitions.
Support contains 88 out of 263 places after structural reductions.
[2024-05-22 11:45:19] [INFO ] Flatten gal took : 47 ms
[2024-05-22 11:45:19] [INFO ] Flatten gal took : 21 ms
[2024-05-22 11:45:20] [INFO ] Input system was already deterministic with 299 transitions.
Support contains 86 out of 263 places (down from 88) after GAL structural reductions.
RANDOM walk for 36321 steps (100 resets) in 1143 ms. (31 steps per ms) remains 0/62 properties
[2024-05-22 11:45:20] [INFO ] Flatten gal took : 15 ms
[2024-05-22 11:45:20] [INFO ] Flatten gal took : 14 ms
[2024-05-22 11:45:20] [INFO ] Input system was already deterministic with 299 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 492 edges and 263 vertex of which 244 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 299
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 234 transition count 275
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 234 transition count 275
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 226 transition count 264
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 226 transition count 264
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 219 transition count 257
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 219 transition count 257
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 213 transition count 251
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 213 transition count 251
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 210 transition count 245
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 210 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 207 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 207 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 205 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 205 transition count 240
Applied a total of 110 rules in 26 ms. Remains 205 /263 variables (removed 58) and now considering 240/299 (removed 59) transitions.
// Phase 1: matrix 240 rows 205 cols
[2024-05-22 11:45:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 11:45:20] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 11:45:20] [INFO ] Invariant cache hit.
[2024-05-22 11:45:20] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-22 11:45:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 240/445 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 11:45:24] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:45:24] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:45:24] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:45:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:45:24] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-05-22 11:45:24] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 5 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:45:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/445 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 11:45:26] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:45:26] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 229 constraints, problems are : Problem set: 0 solved, 239 unsolved in 10820 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/445 variables, 205/229 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 239/468 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 468 constraints, problems are : Problem set: 0 solved, 239 unsolved in 10686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 22/22 constraints]
After SMT, in 21604ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 21610ms
Starting structural reductions in LTL mode, iteration 1 : 205/263 places, 240/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21843 ms. Remains : 205/263 places, 240/299 transitions.
[2024-05-22 11:45:42] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:45:42] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:45:42] [INFO ] Input system was already deterministic with 240 transitions.
[2024-05-22 11:45:42] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:45:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:45:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality1846905958906909858.gal : 6 ms
[2024-05-22 11:45:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality10810867403551405656.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1846905958906909858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10810867403551405656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:46:12] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:46:12] [INFO ] Applying decomposition
[2024-05-22 11:46:12] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7351936632519567544.txt' '-o' '/tmp/graph7351936632519567544.bin' '-w' '/tmp/graph7351936632519567544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7351936632519567544.bin' '-l' '-1' '-v' '-w' '/tmp/graph7351936632519567544.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:46:12] [INFO ] Decomposing Gal with order
[2024-05-22 11:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:46:12] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-22 11:46:12] [INFO ] Flatten gal took : 69 ms
[2024-05-22 11:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 8 ms.
[2024-05-22 11:46:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality9050673422135059745.gal : 21 ms
[2024-05-22 11:46:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7291436959712939315.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9050673422135059745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7291436959712939315.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Graph (complete) has 492 edges and 263 vertex of which 245 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 244 transition count 244
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 202 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 201 transition count 243
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 87 place count 201 transition count 216
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 141 place count 174 transition count 216
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 151 place count 164 transition count 205
Iterating global reduction 3 with 10 rules applied. Total rules applied 161 place count 164 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 161 place count 164 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 163 transition count 204
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 169 place count 157 transition count 197
Iterating global reduction 3 with 6 rules applied. Total rules applied 175 place count 157 transition count 197
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 152 transition count 189
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 152 transition count 189
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 149 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 149 transition count 186
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 233 place count 128 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 235 place count 126 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 126 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 239 place count 124 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 124 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 242 place count 123 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 123 transition count 158
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 123 transition count 158
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 247 place count 121 transition count 156
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 144 edges and 119 vertex of which 115 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 109 edges and 115 vertex of which 38 / 115 are part of one of the 19 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 3 with 34 rules applied. Total rules applied 281 place count 96 transition count 121
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 49 rules applied. Total rules applied 330 place count 66 transition count 102
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 336 place count 60 transition count 90
Iterating global reduction 5 with 6 rules applied. Total rules applied 342 place count 60 transition count 90
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 345 place count 57 transition count 84
Iterating global reduction 5 with 3 rules applied. Total rules applied 348 place count 57 transition count 84
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 351 place count 54 transition count 78
Iterating global reduction 5 with 3 rules applied. Total rules applied 354 place count 54 transition count 78
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 357 place count 51 transition count 75
Iterating global reduction 5 with 3 rules applied. Total rules applied 360 place count 51 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 361 place count 51 transition count 74
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 362 place count 51 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 363 place count 50 transition count 73
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 371 place count 42 transition count 65
Applied a total of 371 rules in 86 ms. Remains 42 /263 variables (removed 221) and now considering 65/299 (removed 234) transitions.
[2024-05-22 11:46:43] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 42 cols
[2024-05-22 11:46:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:46:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 11:46:43] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-05-22 11:46:43] [INFO ] Invariant cache hit.
[2024-05-22 11:46:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-22 11:46:43] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-22 11:46:43] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2024-05-22 11:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 55/89 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 8/97 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 0/97 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/98 variables, and 42 constraints, problems are : Problem set: 0 solved, 50 unsolved in 408 ms.
Refiners :[State Equation: 42/42 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 55/89 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 48/82 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 8/97 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/98 variables, and 92 constraints, problems are : Problem set: 0 solved, 50 unsolved in 358 ms.
Refiners :[State Equation: 42/42 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 772ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/263 places, 65/299 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 928 ms. Remains : 42/263 places, 65/299 transitions.
[2024-05-22 11:46:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:46:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:46:43] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-22 11:46:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:46:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 11:46:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5066038422602634105.gal : 1 ms
[2024-05-22 11:46:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16664547262384801792.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5066038422602634105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16664547262384801792.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.7885e+06,0.008723,3640,2,195,5,1216,6,0,204,1213,0


Converting to forward existential form...Done !
original formula: EG(((p127==0) * (E(!(((p212==0)&&(p78==1))) U (p257==0)) + (EG(AG((p188==0))) * (E(!(((p263==0)||(p72==1))) U (p161==1)) + AF((((p52==0)|...184
=> equivalent forward existential formula: [FwdG(Init,((p127==0) * (E(!(((p212==0)&&(p78==1))) U (p257==0)) + (EG(!(E(TRUE U !((p188==0))))) * (E(!(((p263=...245
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, t8, t12, t16, t26, t30, t31, t35, t37, t39, t40, t41, t58, t59, t61, t63, Inters...246
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.436905,22860,1,0,500,92273,173,341,1242,182511,537
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Graph (complete) has 492 edges and 263 vertex of which 246 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 245 transition count 243
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 202 transition count 243
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 87 place count 202 transition count 217
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 139 place count 176 transition count 217
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 150 place count 165 transition count 205
Iterating global reduction 2 with 11 rules applied. Total rules applied 161 place count 165 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 165 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 164 transition count 204
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 171 place count 156 transition count 194
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 156 transition count 194
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 149 transition count 184
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 149 transition count 184
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 198 place count 144 transition count 177
Iterating global reduction 2 with 5 rules applied. Total rules applied 203 place count 144 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 205 place count 142 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 142 transition count 175
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 249 place count 121 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 251 place count 119 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 119 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 255 place count 117 transition count 148
Iterating global reduction 2 with 2 rules applied. Total rules applied 257 place count 117 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 258 place count 116 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 116 transition count 147
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 262 place count 116 transition count 147
Applied a total of 262 rules in 40 ms. Remains 116 /263 variables (removed 147) and now considering 147/299 (removed 152) transitions.
[2024-05-22 11:46:44] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
// Phase 1: matrix 146 rows 116 cols
[2024-05-22 11:46:44] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:46:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 11:46:44] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-22 11:46:44] [INFO ] Invariant cache hit.
[2024-05-22 11:46:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:46:44] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-22 11:46:44] [INFO ] Redundant transitions in 4 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-22 11:46:44] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2024-05-22 11:46:44] [INFO ] Invariant cache hit.
[2024-05-22 11:46:44] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/260 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 14/130 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 2/262 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 132 constraints, problems are : Problem set: 0 solved, 145 unsolved in 3918 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/260 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 14/130 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 144/274 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 2/262 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 11:46:51] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:46:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-22 11:46:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
[2024-05-22 11:46:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:46:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:46:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:46:52] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 11:46:52] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:46:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 9/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 286 constraints, problems are : Problem set: 0 solved, 145 unsolved in 6882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 9/9 constraints]
After SMT, in 10866ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 10868ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/263 places, 147/299 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11054 ms. Remains : 116/263 places, 147/299 transitions.
[2024-05-22 11:46:55] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:46:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:46:55] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 11:46:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:46:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:46:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality502013604452495259.gal : 1 ms
[2024-05-22 11:46:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality9920169282556294513.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality502013604452495259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9920169282556294513.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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.32912e+12,18.7382,480436,2,93844,5,2.92428e+06,6,0,598,1.90992e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 11:47:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:47:25] [INFO ] Applying decomposition
[2024-05-22 11:47:25] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15287474503526917772.txt' '-o' '/tmp/graph15287474503526917772.bin' '-w' '/tmp/graph15287474503526917772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15287474503526917772.bin' '-l' '-1' '-v' '-w' '/tmp/graph15287474503526917772.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:47:25] [INFO ] Decomposing Gal with order
[2024-05-22 11:47:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:47:25] [INFO ] Removed a total of 72 redundant transitions.
[2024-05-22 11:47:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:47:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 4 ms.
[2024-05-22 11:47:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality14344289527493724465.gal : 2 ms
[2024-05-22 11:47:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4137617126227034641.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14344289527493724465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4137617126227034641.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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 : 263/263 places, 299/299 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 299
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 35 place count 228 transition count 269
Iterating global reduction 1 with 29 rules applied. Total rules applied 64 place count 228 transition count 269
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 217 transition count 255
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 217 transition count 255
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 207 transition count 245
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 207 transition count 245
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 114 place count 199 transition count 237
Iterating global reduction 1 with 8 rules applied. Total rules applied 122 place count 199 transition count 237
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 193 transition count 225
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 193 transition count 225
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 140 place count 187 transition count 219
Iterating global reduction 1 with 6 rules applied. Total rules applied 146 place count 187 transition count 219
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 152 place count 181 transition count 213
Iterating global reduction 1 with 6 rules applied. Total rules applied 158 place count 181 transition count 213
Applied a total of 158 rules in 26 ms. Remains 181 /263 variables (removed 82) and now considering 213/299 (removed 86) transitions.
// Phase 1: matrix 213 rows 181 cols
[2024-05-22 11:47:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:47:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 11:47:55] [INFO ] Invariant cache hit.
[2024-05-22 11:47:55] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-22 11:47:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 213/394 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 11:47:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-22 11:47:58] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
[2024-05-22 11:47:58] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:47:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 14/197 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 197 constraints, problems are : Problem set: 0 solved, 212 unsolved in 8075 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/394 variables, 181/197 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 212/409 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 409 constraints, problems are : Problem set: 0 solved, 212 unsolved in 8633 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 14/14 constraints]
After SMT, in 16771ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 16773ms
Starting structural reductions in LTL mode, iteration 1 : 181/263 places, 213/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16978 ms. Remains : 181/263 places, 213/299 transitions.
[2024-05-22 11:48:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:48:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:48:12] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-22 11:48:12] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:48:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:48:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4722639030830844876.gal : 1 ms
[2024-05-22 11:48:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality16738491901918913895.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4722639030830844876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16738491901918913895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:48:42] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:48:42] [INFO ] Applying decomposition
[2024-05-22 11:48:42] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5368390258339415521.txt' '-o' '/tmp/graph5368390258339415521.bin' '-w' '/tmp/graph5368390258339415521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5368390258339415521.bin' '-l' '-1' '-v' '-w' '/tmp/graph5368390258339415521.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:48:42] [INFO ] Decomposing Gal with order
[2024-05-22 11:48:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:48:42] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-22 11:48:42] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:48:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2024-05-22 11:48:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14814691309084031814.gal : 3 ms
[2024-05-22 11:48:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4839567851789131673.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14814691309084031814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4839567851789131673.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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 : 263/263 places, 299/299 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 258 transition count 299
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 231 transition count 271
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 231 transition count 271
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 220 transition count 257
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 220 transition count 257
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 91 place count 210 transition count 247
Iterating global reduction 1 with 10 rules applied. Total rules applied 101 place count 210 transition count 247
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 201 transition count 238
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 201 transition count 238
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 125 place count 195 transition count 226
Iterating global reduction 1 with 6 rules applied. Total rules applied 131 place count 195 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 137 place count 189 transition count 220
Iterating global reduction 1 with 6 rules applied. Total rules applied 143 place count 189 transition count 220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 149 place count 183 transition count 214
Iterating global reduction 1 with 6 rules applied. Total rules applied 155 place count 183 transition count 214
Applied a total of 155 rules in 24 ms. Remains 183 /263 variables (removed 80) and now considering 214/299 (removed 85) transitions.
// Phase 1: matrix 214 rows 183 cols
[2024-05-22 11:49:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:49:13] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 11:49:13] [INFO ] Invariant cache hit.
[2024-05-22 11:49:13] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-05-22 11:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 214/396 variables, 182/184 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:49:16] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:49:17] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:49:17] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:49:17] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 14/198 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 1/397 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/397 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 199 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/396 variables, 182/198 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 212/410 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 412 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints]
After SMT, in 23639ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 23642ms
Starting structural reductions in LTL mode, iteration 1 : 183/263 places, 214/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23917 ms. Remains : 183/263 places, 214/299 transitions.
[2024-05-22 11:49:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:49:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:49:36] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-22 11:49:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:49:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:49:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality12391432973231081609.gal : 1 ms
[2024-05-22 11:49:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17344831485911559035.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12391432973231081609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17344831485911559035.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:50:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:50:06] [INFO ] Applying decomposition
[2024-05-22 11:50:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15283574199930582374.txt' '-o' '/tmp/graph15283574199930582374.bin' '-w' '/tmp/graph15283574199930582374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15283574199930582374.bin' '-l' '-1' '-v' '-w' '/tmp/graph15283574199930582374.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:50:07] [INFO ] Decomposing Gal with order
[2024-05-22 11:50:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:50:07] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-22 11:50:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:50:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 11:50:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality12299311646491032421.gal : 3 ms
[2024-05-22 11:50:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality18234943496388958729.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12299311646491032421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18234943496388958729.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Graph (complete) has 492 edges and 263 vertex of which 246 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.4 ms
Discarding 17 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 245 transition count 240
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 199 transition count 240
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 93 place count 199 transition count 212
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 149 place count 171 transition count 212
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 159 place count 161 transition count 201
Iterating global reduction 2 with 10 rules applied. Total rules applied 169 place count 161 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 169 place count 161 transition count 200
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 160 transition count 200
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 179 place count 152 transition count 190
Iterating global reduction 2 with 8 rules applied. Total rules applied 187 place count 152 transition count 190
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 194 place count 145 transition count 180
Iterating global reduction 2 with 7 rules applied. Total rules applied 201 place count 145 transition count 180
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 140 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 140 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 138 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 138 transition count 171
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 261 place count 115 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 263 place count 113 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 265 place count 113 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 267 place count 111 transition count 142
Iterating global reduction 2 with 2 rules applied. Total rules applied 269 place count 111 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 270 place count 110 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 271 place count 110 transition count 141
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 272 place count 110 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 108 transition count 139
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 128 edges and 106 vertex of which 102 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 110 edges and 102 vertex of which 42 / 102 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 2 with 36 rules applied. Total rules applied 310 place count 81 transition count 102
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 54 rules applied. Total rules applied 364 place count 49 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 365 place count 48 transition count 80
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 375 place count 38 transition count 60
Iterating global reduction 5 with 10 rules applied. Total rules applied 385 place count 38 transition count 60
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 394 place count 29 transition count 42
Iterating global reduction 5 with 9 rules applied. Total rules applied 403 place count 29 transition count 42
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 411 place count 21 transition count 26
Iterating global reduction 5 with 8 rules applied. Total rules applied 419 place count 21 transition count 26
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 427 place count 13 transition count 18
Iterating global reduction 5 with 8 rules applied. Total rules applied 435 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 436 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 438 place count 12 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 441 place count 9 transition count 13
Applied a total of 441 rules in 77 ms. Remains 9 /263 variables (removed 254) and now considering 13/299 (removed 286) transitions.
[2024-05-22 11:50:37] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 9 cols
[2024-05-22 11:50:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:50:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 11:50:37] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 11:50:37] [INFO ] Invariant cache hit.
[2024-05-22 11:50:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-22 11:50:37] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 11:50:37] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-22 11:50:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 44 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 41 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/263 places, 13/299 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 217 ms. Remains : 9/263 places, 13/299 transitions.
[2024-05-22 11:50:37] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:50:37] [INFO ] Flatten gal took : 1 ms
[2024-05-22 11:50:37] [INFO ] Input system was already deterministic with 13 transitions.
[2024-05-22 11:50:37] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:50:37] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:50:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality18042616906313920626.gal : 1 ms
[2024-05-22 11:50:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11218410515254940285.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18042616906313920626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11218410515254940285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,1190,0.003447,3356,2,31,5,336,6,0,41,390,0


Converting to forward existential form...Done !
original formula: EG(!(E((p114==1) U (p298==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E((p114==1) U (p298==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,1,0.01474,3940,1,0,100,2624,48,78,228,4107,107
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 258 transition count 299
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 29 place count 234 transition count 274
Iterating global reduction 1 with 24 rules applied. Total rules applied 53 place count 234 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 227 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 227 transition count 265
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 220 transition count 258
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 220 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 214 transition count 252
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 214 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 210 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 210 transition count 244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 206 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 206 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 203 transition count 237
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 203 transition count 237
Applied a total of 115 rules in 30 ms. Remains 203 /263 variables (removed 60) and now considering 237/299 (removed 62) transitions.
// Phase 1: matrix 237 rows 203 cols
[2024-05-22 11:50:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:50:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:50:37] [INFO ] Invariant cache hit.
[2024-05-22 11:50:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-22 11:50:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 237/439 variables, 202/204 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-22 11:50:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:50:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 1/440 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 227 constraints, problems are : Problem set: 0 solved, 236 unsolved in 13013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/439 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 235/461 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 1/440 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 463 constraints, problems are : Problem set: 0 solved, 236 unsolved in 17944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 22/22 constraints]
After SMT, in 31025ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 31028ms
Starting structural reductions in LTL mode, iteration 1 : 203/263 places, 237/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31254 ms. Remains : 203/263 places, 237/299 transitions.
[2024-05-22 11:51:08] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:51:08] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:51:08] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-22 11:51:08] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:51:08] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:51:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5559111716928646004.gal : 7 ms
[2024-05-22 11:51:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality17084134816014168776.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5559111716928646004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17084134816014168776.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 299
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 33 place count 230 transition count 271
Iterating global reduction 1 with 27 rules applied. Total rules applied 60 place count 230 transition count 271
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 220 transition count 259
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 place count 220 transition count 259
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 89 place count 211 transition count 250
Iterating global reduction 1 with 9 rules applied. Total rules applied 98 place count 211 transition count 250
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 106 place count 203 transition count 242
Iterating global reduction 1 with 8 rules applied. Total rules applied 114 place count 203 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 197 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 197 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 132 place count 191 transition count 224
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 191 transition count 224
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 144 place count 185 transition count 218
Iterating global reduction 1 with 6 rules applied. Total rules applied 150 place count 185 transition count 218
Applied a total of 150 rules in 19 ms. Remains 185 /263 variables (removed 78) and now considering 218/299 (removed 81) transitions.
// Phase 1: matrix 218 rows 185 cols
[2024-05-22 11:52:08] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:52:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 11:52:08] [INFO ] Invariant cache hit.
[2024-05-22 11:52:09] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-22 11:52:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/403 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:52:12] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:52:13] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:52:13] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 11:52:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:52:13] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 18/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 205 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/403 variables, 185/205 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 217/422 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 422 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 18/18 constraints]
After SMT, in 18300ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18304ms
Starting structural reductions in LTL mode, iteration 1 : 185/263 places, 218/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18511 ms. Remains : 185/263 places, 218/299 transitions.
[2024-05-22 11:52:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:52:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:52:27] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-22 11:52:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:52:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:52:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality15964867581967375822.gal : 1 ms
[2024-05-22 11:52:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality14010304836284842381.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15964867581967375822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14010304836284842381.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:52:57] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:52:57] [INFO ] Applying decomposition
[2024-05-22 11:52:57] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4319540582153694340.txt' '-o' '/tmp/graph4319540582153694340.bin' '-w' '/tmp/graph4319540582153694340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4319540582153694340.bin' '-l' '-1' '-v' '-w' '/tmp/graph4319540582153694340.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:52:57] [INFO ] Decomposing Gal with order
[2024-05-22 11:52:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:52:57] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-22 11:52:57] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:52:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 11:52:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13259387199589622471.gal : 2 ms
[2024-05-22 11:52:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality8746468220511528254.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13259387199589622471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8746468220511528254.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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 : 263/263 places, 299/299 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 259 transition count 299
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 28 place count 235 transition count 274
Iterating global reduction 1 with 24 rules applied. Total rules applied 52 place count 235 transition count 274
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 226 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 226 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 219 transition count 255
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 219 transition count 255
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 212 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 212 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 208 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 208 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 205 transition count 237
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 205 transition count 237
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 202 transition count 234
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 202 transition count 234
Applied a total of 118 rules in 16 ms. Remains 202 /263 variables (removed 61) and now considering 234/299 (removed 65) transitions.
// Phase 1: matrix 234 rows 202 cols
[2024-05-22 11:53:27] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:53:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 11:53:27] [INFO ] Invariant cache hit.
[2024-05-22 11:53:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-22 11:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/434 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-22 11:53:31] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:53:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:53:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:53:32] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-22 11:53:32] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:53:32] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 14/216 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 2/436 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 218 constraints, problems are : Problem set: 0 solved, 233 unsolved in 11163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/434 variables, 200/216 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 231/447 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 2/436 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 0/436 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 451 constraints, problems are : Problem set: 0 solved, 233 unsolved in 16113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 14/14 constraints]
After SMT, in 27348ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 27351ms
Starting structural reductions in LTL mode, iteration 1 : 202/263 places, 234/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27565 ms. Remains : 202/263 places, 234/299 transitions.
[2024-05-22 11:53:55] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:53:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:53:55] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-22 11:53:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:53:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:53:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality11349723734592507258.gal : 1 ms
[2024-05-22 11:53:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality11997907800289535104.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11349723734592507258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11997907800289535104.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:54:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:54:25] [INFO ] Applying decomposition
[2024-05-22 11:54:25] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7206059540265095225.txt' '-o' '/tmp/graph7206059540265095225.bin' '-w' '/tmp/graph7206059540265095225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7206059540265095225.bin' '-l' '-1' '-v' '-w' '/tmp/graph7206059540265095225.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:54:25] [INFO ] Decomposing Gal with order
[2024-05-22 11:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:54:25] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-22 11:54:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:54:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 11:54:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2246618282842121430.gal : 2 ms
[2024-05-22 11:54:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality11593914018863423605.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2246618282842121430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11593914018863423605.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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 : 263/263 places, 299/299 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 299
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 33 place count 230 transition count 271
Iterating global reduction 1 with 27 rules applied. Total rules applied 60 place count 230 transition count 271
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 220 transition count 259
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 place count 220 transition count 259
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 212 transition count 251
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 212 transition count 251
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 205 transition count 244
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 205 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 199 transition count 232
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 199 transition count 232
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 193 transition count 226
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 193 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 140 place count 187 transition count 220
Iterating global reduction 1 with 6 rules applied. Total rules applied 146 place count 187 transition count 220
Applied a total of 146 rules in 18 ms. Remains 187 /263 variables (removed 76) and now considering 220/299 (removed 79) transitions.
// Phase 1: matrix 220 rows 187 cols
[2024-05-22 11:54:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:54:55] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 11:54:55] [INFO ] Invariant cache hit.
[2024-05-22 11:54:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-22 11:54:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/407 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 11:54:58] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:54:58] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:54:58] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:54:59] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 15/204 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/407 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 204 constraints, problems are : Problem set: 0 solved, 219 unsolved in 8663 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/407 variables, 187/204 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 219/423 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 423 constraints, problems are : Problem set: 0 solved, 219 unsolved in 8727 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 15/15 constraints]
After SMT, in 17457ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 17459ms
Starting structural reductions in LTL mode, iteration 1 : 187/263 places, 220/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17662 ms. Remains : 187/263 places, 220/299 transitions.
[2024-05-22 11:55:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:55:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:55:13] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-22 11:55:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:55:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:55:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14685610494871422875.gal : 1 ms
[2024-05-22 11:55:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality2597360145766332269.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14685610494871422875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2597360145766332269.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:55:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:55:43] [INFO ] Applying decomposition
[2024-05-22 11:55:43] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4388055779670594688.txt' '-o' '/tmp/graph4388055779670594688.bin' '-w' '/tmp/graph4388055779670594688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4388055779670594688.bin' '-l' '-1' '-v' '-w' '/tmp/graph4388055779670594688.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:55:43] [INFO ] Decomposing Gal with order
[2024-05-22 11:55:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:55:43] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-22 11:55:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:55:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 3 ms.
[2024-05-22 11:55:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality1976082724055354757.gal : 2 ms
[2024-05-22 11:55:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality431865512619170389.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1976082724055354757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality431865512619170389.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 299
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 231 transition count 273
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 231 transition count 273
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 222 transition count 261
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 222 transition count 261
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 84 place count 214 transition count 253
Iterating global reduction 1 with 8 rules applied. Total rules applied 92 place count 214 transition count 253
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 206 transition count 245
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 206 transition count 245
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 201 transition count 235
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 201 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 123 place count 196 transition count 230
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 196 transition count 230
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 133 place count 191 transition count 225
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 191 transition count 225
Applied a total of 138 rules in 18 ms. Remains 191 /263 variables (removed 72) and now considering 225/299 (removed 74) transitions.
// Phase 1: matrix 225 rows 191 cols
[2024-05-22 11:56:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:56:13] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 11:56:13] [INFO ] Invariant cache hit.
[2024-05-22 11:56:13] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-22 11:56:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 225/416 variables, 191/193 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-22 11:56:16] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-22 11:56:17] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 11:56:18] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:56:18] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 18/211 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/416 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 211 constraints, problems are : Problem set: 0 solved, 224 unsolved in 9524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/416 variables, 191/211 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 224/435 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/416 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 435 constraints, problems are : Problem set: 0 solved, 224 unsolved in 9419 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 18/18 constraints]
After SMT, in 19014ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 19017ms
Starting structural reductions in LTL mode, iteration 1 : 191/263 places, 225/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19257 ms. Remains : 191/263 places, 225/299 transitions.
[2024-05-22 11:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:56:32] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-22 11:56:32] [INFO ] Flatten gal took : 17 ms
[2024-05-22 11:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:56:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality667938772315584396.gal : 2 ms
[2024-05-22 11:56:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17031817612157759178.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality667938772315584396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17031817612157759178.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:57:02] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:57:02] [INFO ] Applying decomposition
[2024-05-22 11:57:02] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12124850360291914476.txt' '-o' '/tmp/graph12124850360291914476.bin' '-w' '/tmp/graph12124850360291914476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12124850360291914476.bin' '-l' '-1' '-v' '-w' '/tmp/graph12124850360291914476.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:57:02] [INFO ] Decomposing Gal with order
[2024-05-22 11:57:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:57:02] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-22 11:57:02] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:57:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 11:57:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15404317097202354343.gal : 1 ms
[2024-05-22 11:57:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality7651039505974910422.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15404317097202354343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7651039505974910422.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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 : 263/263 places, 299/299 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 299
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 231 transition count 272
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 231 transition count 272
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 68 place count 221 transition count 259
Iterating global reduction 1 with 10 rules applied. Total rules applied 78 place count 221 transition count 259
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 212 transition count 250
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 212 transition count 250
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 204 transition count 242
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 204 transition count 242
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 199 transition count 232
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 199 transition count 232
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 127 place count 194 transition count 227
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 194 transition count 227
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 137 place count 189 transition count 222
Iterating global reduction 1 with 5 rules applied. Total rules applied 142 place count 189 transition count 222
Applied a total of 142 rules in 10 ms. Remains 189 /263 variables (removed 74) and now considering 222/299 (removed 77) transitions.
// Phase 1: matrix 222 rows 189 cols
[2024-05-22 11:57:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:57:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 11:57:32] [INFO ] Invariant cache hit.
[2024-05-22 11:57:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-22 11:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/411 variables, 189/191 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:57:36] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 11:57:37] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 212 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9480 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/411 variables, 189/212 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 221/433 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 433 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9459 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 21/21 constraints]
After SMT, in 19008ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 19011ms
Starting structural reductions in LTL mode, iteration 1 : 189/263 places, 222/299 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19211 ms. Remains : 189/263 places, 222/299 transitions.
[2024-05-22 11:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:57:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:57:52] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-22 11:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:57:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality13559439705285628314.gal : 1 ms
[2024-05-22 11:57:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5800804885157594099.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13559439705285628314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5800804885157594099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 11:58:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:58:22] [INFO ] Applying decomposition
[2024-05-22 11:58:22] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17532290307591394210.txt' '-o' '/tmp/graph17532290307591394210.bin' '-w' '/tmp/graph17532290307591394210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17532290307591394210.bin' '-l' '-1' '-v' '-w' '/tmp/graph17532290307591394210.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:58:22] [INFO ] Decomposing Gal with order
[2024-05-22 11:58:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:58:22] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-22 11:58:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:58:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 11:58:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality14352734670070814524.gal : 2 ms
[2024-05-22 11:58:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality2748735541966131972.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14352734670070814524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2748735541966131972.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 299/299 transitions.
Graph (complete) has 492 edges and 263 vertex of which 246 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 245 transition count 239
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 198 transition count 239
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 95 place count 198 transition count 211
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 151 place count 170 transition count 211
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 160 place count 161 transition count 201
Iterating global reduction 2 with 9 rules applied. Total rules applied 169 place count 161 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 169 place count 161 transition count 200
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 160 transition count 200
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 178 place count 153 transition count 191
Iterating global reduction 2 with 7 rules applied. Total rules applied 185 place count 153 transition count 191
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 191 place count 147 transition count 183
Iterating global reduction 2 with 6 rules applied. Total rules applied 197 place count 147 transition count 183
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 143 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 143 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 207 place count 141 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 141 transition count 175
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 255 place count 118 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 257 place count 116 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 116 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 114 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 114 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 113 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 113 transition count 145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 111 transition count 143
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 131 edges and 109 vertex of which 105 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 116 edges and 105 vertex of which 44 / 105 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 2 with 39 rules applied. Total rules applied 306 place count 83 transition count 103
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 60 rules applied. Total rules applied 366 place count 48 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 368 place count 46 transition count 78
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 377 place count 37 transition count 60
Iterating global reduction 5 with 9 rules applied. Total rules applied 386 place count 37 transition count 60
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 395 place count 28 transition count 42
Iterating global reduction 5 with 9 rules applied. Total rules applied 404 place count 28 transition count 42
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 413 place count 19 transition count 24
Iterating global reduction 5 with 9 rules applied. Total rules applied 422 place count 19 transition count 24
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 431 place count 10 transition count 15
Iterating global reduction 5 with 9 rules applied. Total rules applied 440 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 441 place count 10 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 442 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 443 place count 9 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 445 place count 7 transition count 11
Applied a total of 445 rules in 49 ms. Remains 7 /263 variables (removed 256) and now considering 11/299 (removed 288) transitions.
[2024-05-22 11:58:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 7 cols
[2024-05-22 11:58:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:58:52] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 11:58:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 11:58:52] [INFO ] Invariant cache hit.
[2024-05-22 11:58:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-22 11:58:52] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 11:58:52] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-22 11:58:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/14 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 7 constraints, problems are : Problem set: 0 solved, 7 unsolved in 44 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 39 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/263 places, 11/299 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 284 ms. Remains : 7/263 places, 11/299 transitions.
[2024-05-22 11:58:52] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:58:52] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:58:52] [INFO ] Input system was already deterministic with 11 transitions.
[2024-05-22 11:58:52] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:58:52] [INFO ] Flatten gal took : 0 ms
[2024-05-22 11:58:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality12371334579459583756.gal : 0 ms
[2024-05-22 11:58:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15031616989749242127.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12371334579459583756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15031616989749242127.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,396,0.003584,3352,2,22,5,144,6,0,31,138,0


Converting to forward existential form...Done !
original formula: AF((p285==1))
=> equivalent forward existential formula: [FwdG(Init,!((p285==1)))] = FALSE
Hit Full ! (commute/partial/dont) 10/0/1
(forward)formula 0,0,0.005969,3672,1,0,9,269,20,4,171,298,8
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 11:58:52] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:58:52] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:58:52] [INFO ] Applying decomposition
[2024-05-22 11:58:52] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9952682436663681752.txt' '-o' '/tmp/graph9952682436663681752.bin' '-w' '/tmp/graph9952682436663681752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9952682436663681752.bin' '-l' '-1' '-v' '-w' '/tmp/graph9952682436663681752.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:58:52] [INFO ] Decomposing Gal with order
[2024-05-22 11:58:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:58:52] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-22 11:58:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:58:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 11:58:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality15284661650942284798.gal : 3 ms
[2024-05-22 11:58:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11128300118028507542.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15284661650942284798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11128300118028507542.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 10 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.74128e+16,38.3709,820276,11902,153,1.15393e+06,6126,628,4.89146e+06,67,51930,0


Converting to forward existential form...Done !
original formula: EF((!(E(!(EX((i2.u5.p23==1))) U (((i17.u54.p179==1) * AX((i22.u70.p249==0))) * E((i3.u63.p216==0) U (i25.u82.p286==1))))) * (((EX(!(E((i2...433
=> equivalent forward existential formula: ((([(EY((FwdU(Init,TRUE) * !(E(!(EX((i2.u5.p23==1))) U (((i17.u54.p179==1) * !(EX(!((i22.u70.p249==0))))) * E((i...1145
Reverse transition relation is NOT exact ! Due to transitions t278, u91.t6, u91.t7, i2.u5.t189, i2.u6.t187, i2.u6.t293, i3.t163, i3.t145, i3.t130, i3.t66, ...910
(forward)formula 0,1,545.973,2218464,1,0,3.04462e+06,6126,1568,1.23907e+07,145,51930,1503824
FORMULA DiscoveryGPU-PT-11b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((AF((i4.u10.p35==1)) * EG((u91.p315==0))) * ((i21.i0.u67.p238==0)&&(u91.p309==1))) * (EF((i9.u25.p76==0)) * ((i23.i1.u79.p271==1)||(...201
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((!(EG(!((i4.u10.p35==1)))) * EG((u91.p315==0))) * ((i21.i0.u67.p238==0)&&(u91.p309==...266
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 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
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Detected timeout of ITS tools.
[2024-05-22 12:23:39] [INFO ] Applying decomposition
[2024-05-22 12:23:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:23:39] [INFO ] Decomposing Gal with order
[2024-05-22 12:23:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:23:39] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-22 12:23:39] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:23:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 613 labels/synchronizations in 20 ms.
[2024-05-22 12:23:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13610561284805035638.gal : 1 ms
[2024-05-22 12:23:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality4719552905758747300.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13610561284805035638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4719552905758747300.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 9 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.74128e+16,83.4229,1606404,1146,2382,1.97128e+06,959144,424,6.52671e+06,273,7.89565e+06,0


Converting to forward existential form...Done !
original formula: EF((((AF((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p35==1)) * EG((i1.u23.p315==0))) * ((i0.i0.i0.u19.p238==0)&&(i1.u23.p309==1))) * (EF((i0.i0.i...252
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * ((!(EG(!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p35==1)))) * EG((i1.u23.p315==0))) * ((i0...317
Reverse transition relation is NOT exact ! Due to transitions t217, t219, t221, t278, i0.u21.t20, i0.u21.t22, i0.u21.t25, i0.i0.u20.t37, i0.i0.u20.t39, i0....1649
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2

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

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