fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640603600505
Last Updated
July 7, 2024

About the Execution of ITS-Tools for GPUForwardProgress-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1457.955 516549.00 576620.00 1723.80 TTFTTFTTFTFFTFTF normal

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.r180-tall-171640603600505.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 GPUForwardProgress-PT-12b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603600505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 22:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 65K 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 GPUForwardProgress-PT-12b-CTLCardinality-2024-00
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-01
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-02
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-03
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-04
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-05
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-06
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-07
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-08
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-09
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-10
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2024-11
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2023-12
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2023-13
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2023-14
FORMULA_NAME GPUForwardProgress-PT-12b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716508523141

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-23 23:55:24] [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-23 23:55:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:55:24] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-23 23:55:24] [INFO ] Transformed 264 places.
[2024-05-23 23:55:24] [INFO ] Transformed 277 transitions.
[2024-05-23 23:55:24] [INFO ] Found NUPN structural information;
[2024-05-23 23:55:24] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 277
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 250 transition count 264
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 250 transition count 264
Applied a total of 27 rules in 44 ms. Remains 250 /264 variables (removed 14) and now considering 264/277 (removed 13) transitions.
// Phase 1: matrix 264 rows 250 cols
[2024-05-23 23:55:24] [INFO ] Computed 13 invariants in 20 ms
[2024-05-23 23:55:24] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-23 23:55:24] [INFO ] Invariant cache hit.
[2024-05-23 23:55:25] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-23 23:55:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 264/513 variables, 249/262 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/514 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 0/514 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 263 constraints, problems are : Problem set: 0 solved, 263 unsolved in 11837 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 264/513 variables, 249/262 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 263/525 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 526 constraints, problems are : Problem set: 0 solved, 263 unsolved in 12534 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 0/0 constraints]
After SMT, in 24497ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 24528ms
Starting structural reductions in LTL mode, iteration 1 : 250/264 places, 264/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25027 ms. Remains : 250/264 places, 264/277 transitions.
Support contains 97 out of 250 places after structural reductions.
[2024-05-23 23:55:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-23 23:55:49] [INFO ] Flatten gal took : 67 ms
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 23:55:49] [INFO ] Flatten gal took : 49 ms
[2024-05-23 23:55:49] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 94 out of 250 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (355 resets) in 2743 ms. (14 steps per ms) remains 5/63 properties
BEST_FIRST walk for 40004 steps (49 resets) in 137 ms. (289 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (57 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (56 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (47 resets) in 99 ms. (400 steps per ms) remains 3/4 properties
[2024-05-23 23:55:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 240/249 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 264/513 variables, 249/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/514 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 263 constraints, problems are : Problem set: 0 solved, 3 unsolved in 248 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 240/249 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 264/513 variables, 249/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/514 variables, 1/266 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/514 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 266 constraints, problems are : Problem set: 2 solved, 1 unsolved in 280 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 238 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=119 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-05-23 23:55:51] [INFO ] Flatten gal took : 13 ms
[2024-05-23 23:55:51] [INFO ] Flatten gal took : 26 ms
[2024-05-23 23:55:51] [INFO ] Input system was already deterministic with 264 transitions.
Computed a total of 52 stabilizing places and 52 stable transitions
Graph (complete) has 381 edges and 250 vertex of which 234 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.19 ms
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 231 transition count 245
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 231 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 231 transition count 241
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 227 transition count 237
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 227 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 227 transition count 233
Applied a total of 54 rules in 26 ms. Remains 227 /250 variables (removed 23) and now considering 233/264 (removed 31) transitions.
// Phase 1: matrix 233 rows 227 cols
[2024-05-23 23:55:51] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 23:55:51] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-23 23:55:51] [INFO ] Invariant cache hit.
[2024-05-23 23:55:52] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-23 23:55:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 233/459 variables, 226/239 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 1/460 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 240 constraints, problems are : Problem set: 0 solved, 232 unsolved in 9297 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 233/459 variables, 226/239 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 232/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (OVERLAPS) 1/460 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 472 constraints, problems are : Problem set: 0 solved, 232 unsolved in 10165 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 19525ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 19530ms
Starting structural reductions in LTL mode, iteration 1 : 227/250 places, 233/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19835 ms. Remains : 227/250 places, 233/264 transitions.
[2024-05-23 23:56:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 23:56:11] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:56:11] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-23 23:56:11] [INFO ] Flatten gal took : 10 ms
[2024-05-23 23:56:11] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:56:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality13708635706284819749.gal : 5 ms
[2024-05-23 23:56:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality1383428135316218229.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/CTLCardinality13708635706284819749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1383428135316218229.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-23 23:56:41] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:56:41] [INFO ] Applying decomposition
[2024-05-23 23:56:41] [INFO ] Flatten gal took : 9 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/graph18018307239741756651.txt' '-o' '/tmp/graph18018307239741756651.bin' '-w' '/tmp/graph18018307239741756651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18018307239741756651.bin' '-l' '-1' '-v' '-w' '/tmp/graph18018307239741756651.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:56:42] [INFO ] Decomposing Gal with order
[2024-05-23 23:56:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:56:42] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-23 23:56:42] [INFO ] Flatten gal took : 99 ms
[2024-05-23 23:56:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-23 23:56:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3320038924729235912.gal : 106 ms
[2024-05-23 23:56:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality18404803824981125852.ctl : 5 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/CTLCardinality3320038924729235912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18404803824981125852.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.
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.19794e+16,0.094892,8112,794,27,8583,253,491,11829,36,593,0


Converting to forward existential form...Done !
original formula: AF((AG((((EX((i9.i1.u61.p168==0)) + AX(((i9.i0.u58.p158==0)||(i0.i2.u89.p262==1)))) + ((i0.i2.u84.p246==1)||(i4.i0.u24.p69==1))) + ((i0.i...518
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((EX((i9.i1.u61.p168==0)) + !(EX(!(((i9.i0.u58.p158==0)||(i0.i2.u89.p262==1)))))) + ...952
Reverse transition relation is NOT exact ! Due to transitions t3, t16, t207, i1.i0.t193, i1.i0.u7.t202, i2.t187, i2.i1.u17.t180, i3.i1.t166, i3.i1.u19.t173...550
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.89044,270252,1,0,563772,253,3452,674723,199,593,544047
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 231 transition count 245
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 231 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 231 transition count 241
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 224 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 224 transition count 234
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 61 place count 224 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 223 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 223 transition count 228
Applied a total of 63 rules in 19 ms. Remains 223 /250 variables (removed 27) and now considering 228/264 (removed 36) transitions.
// Phase 1: matrix 228 rows 223 cols
[2024-05-23 23:56:50] [INFO ] Computed 13 invariants in 5 ms
[2024-05-23 23:56:50] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-23 23:56:50] [INFO ] Invariant cache hit.
[2024-05-23 23:56:50] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-23 23:56:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 228/450 variables, 222/235 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 1/451 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 0/451 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 236 constraints, problems are : Problem set: 0 solved, 227 unsolved in 8963 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 228/450 variables, 222/235 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 227/462 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 1/451 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 463 constraints, problems are : Problem set: 0 solved, 227 unsolved in 10774 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints]
After SMT, in 19773ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 19775ms
Starting structural reductions in LTL mode, iteration 1 : 223/250 places, 228/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20408 ms. Remains : 223/250 places, 228/264 transitions.
[2024-05-23 23:57:10] [INFO ] Flatten gal took : 10 ms
[2024-05-23 23:57:10] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:57:10] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-23 23:57:10] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:57:10] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:57:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14402069660582891424.gal : 1 ms
[2024-05-23 23:57:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16162140058209359475.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/CTLCardinality14402069660582891424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16162140058209359475.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-23 23:57:40] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:57:40] [INFO ] Applying decomposition
[2024-05-23 23:57:40] [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/graph10999301831859238178.txt' '-o' '/tmp/graph10999301831859238178.bin' '-w' '/tmp/graph10999301831859238178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10999301831859238178.bin' '-l' '-1' '-v' '-w' '/tmp/graph10999301831859238178.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:57:40] [INFO ] Decomposing Gal with order
[2024-05-23 23:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:57:40] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-23 23:57:40] [INFO ] Flatten gal took : 13 ms
[2024-05-23 23:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-23 23:57:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13912958982725717005.gal : 3 ms
[2024-05-23 23:57:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality2807423559362376654.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/CTLCardinality13912958982725717005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2807423559362376654.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.
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.2196e+16,0.116641,9200,600,29,10826,305,512,17084,38,874,0


Converting to forward existential form...Done !
original formula: E(AX(EG(!(AF((i4.i1.u32.p87==1))))) U AX(((AF((((i13.i1.u88.p244==0)||(i7.i0.u44.p121==1))||((i1.i0.u12.p33==0)||(i12.i1.u81.p222==1)))) ...272
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(EG(!(!(EG(!((i4.i1.u32.p87==1)))))))))) * !(EX(!(((!(EG(!((((i13.i1.u88.p244==0)||(i7.i0.u44....342
Reverse transition relation is NOT exact ! Due to transitions t202, i0.i0.t190, i0.i0.u8.t197, i1.t184, i1.i1.u11.t175, i2.t168, i2.i2.t161, i3.t154, i3.i1...549
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 13
(forward)formula 0,1,10.0478,301976,1,0,645330,305,3462,734489,192,874,510462
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 226 transition count 240
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 226 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 226 transition count 234
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 219 transition count 227
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 219 transition count 227
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 219 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 218 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 218 transition count 221
Applied a total of 75 rules in 10 ms. Remains 218 /250 variables (removed 32) and now considering 221/264 (removed 43) transitions.
// Phase 1: matrix 221 rows 218 cols
[2024-05-23 23:57:50] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 23:57:51] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 23:57:51] [INFO ] Invariant cache hit.
[2024-05-23 23:57:51] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-23 23:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/439 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 231 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8200 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 220/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 1/439 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 451 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10617 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 18843ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 18846ms
Starting structural reductions in LTL mode, iteration 1 : 218/250 places, 221/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19055 ms. Remains : 218/250 places, 221/264 transitions.
[2024-05-23 23:58:10] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:58:10] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:58:10] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-23 23:58:10] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:58:10] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:58:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality11715052372145450400.gal : 1 ms
[2024-05-23 23:58:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality1476084186403098470.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/CTLCardinality11715052372145450400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1476084186403098470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-23 23:58:40] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:58:40] [INFO ] Applying decomposition
[2024-05-23 23:58:40] [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/graph55963534104999702.txt' '-o' '/tmp/graph55963534104999702.bin' '-w' '/tmp/graph55963534104999702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph55963534104999702.bin' '-l' '-1' '-v' '-w' '/tmp/graph55963534104999702.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:58:40] [INFO ] Decomposing Gal with order
[2024-05-23 23:58:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:58:40] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-23 23:58:40] [INFO ] Flatten gal took : 11 ms
[2024-05-23 23:58:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-23 23:58:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality18369038258620237489.gal : 5 ms
[2024-05-23 23:58:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17282148849425019905.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18369038258620237489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17282148849425019905.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.
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.71462e+15,0.099284,6972,465,28,6576,204,434,8791,35,438,0


Converting to forward existential form...Done !
original formula: (AG(EF((((i8.i1.u49.p140==0)||(i13.u84.p241==1))||((i4.i1.u24.p67==0)||(i12.i2.u75.p211==1))))) * E(EF(AG((i2.i0.u14.p37==1))) U ((i11.i1...196
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((i8.i1.u49.p140==0)||(i13.u84.p241==1))||((i4.i1.u24.p67==0)||(i12.i2.u75.p211...296
Reverse transition relation is NOT exact ! Due to transitions t195, i1.t190, i1.i1.u11.t183, i2.t177, i2.i1.u13.t170, i3.t163, i3.i1.u18.t156, i4.t149, i4....530
(forward)formula 0,0,0.227285,10668,1,0,12689,209,2466,24959,151,546,46656
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Graph (trivial) has 213 edges and 250 vertex of which 7 / 250 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 374 edges and 244 vertex of which 228 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 117 place count 227 transition count 138
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 135 rules applied. Total rules applied 252 place count 112 transition count 118
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 260 place count 105 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 261 place count 104 transition count 117
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 261 place count 104 transition count 89
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 317 place count 76 transition count 89
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 331 place count 62 transition count 75
Iterating global reduction 4 with 14 rules applied. Total rules applied 345 place count 62 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 345 place count 62 transition count 74
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 347 place count 61 transition count 74
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 4 with 46 rules applied. Total rules applied 393 place count 38 transition count 51
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 395 place count 38 transition count 51
Applied a total of 395 rules in 86 ms. Remains 38 /250 variables (removed 212) and now considering 51/264 (removed 213) transitions.
// Phase 1: matrix 51 rows 38 cols
[2024-05-23 23:58:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:58:40] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-23 23:58:40] [INFO ] Invariant cache hit.
[2024-05-23 23:58:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 23:58:40] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-23 23:58:40] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-23 23:58:40] [INFO ] Invariant cache hit.
[2024-05-23 23:58:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/87 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 1/89 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 40 constraints, problems are : Problem set: 0 solved, 50 unsolved in 775 ms.
Refiners :[State Equation: 38/38 constraints, ReadFeed: 2/2 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/87 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 50/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 90 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1099 ms.
Refiners :[State Equation: 38/38 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 1891ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1892ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/250 places, 51/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2200 ms. Remains : 38/250 places, 51/264 transitions.
[2024-05-23 23:58:42] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:58:42] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:58:42] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-23 23:58:42] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:58:42] [INFO ] Flatten gal took : 15 ms
[2024-05-23 23:58:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15805971100034163360.gal : 4 ms
[2024-05-23 23:58:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality10852022710098448630.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/CTLCardinality15805971100034163360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10852022710098448630.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,9.48721e+07,0.176177,11156,2,494,5,44765,6,0,202,38030,0


Converting to forward existential form...Done !
original formula: EG(!(A((p73==1) U ((((p245==0)||(p83==1))||(p2==0))&&(!((p63==0)||(p34==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!(((((p245==0)||(p83==1))||(p2==0))&&(!((p63==0)||(p34==1))))) U (!((p73==1)) * !(((((p245==0)...288
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t8, t11, t16, t18, t20, t22, t24, t27, t28, t30, t33, t34, t36, t49, Interse...245
(forward)formula 0,1,2.64239,98824,1,0,760,538269,132,407,1357,720219,706
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Graph (trivial) has 221 edges and 250 vertex of which 7 / 250 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 374 edges and 244 vertex of which 228 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 227 transition count 132
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 141 rules applied. Total rules applied 264 place count 106 transition count 112
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 272 place count 99 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 273 place count 98 transition count 111
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 273 place count 98 transition count 86
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 323 place count 73 transition count 86
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 336 place count 60 transition count 73
Iterating global reduction 4 with 13 rules applied. Total rules applied 349 place count 60 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 349 place count 60 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 59 transition count 72
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 401 place count 34 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 33 transition count 46
Applied a total of 402 rules in 29 ms. Remains 33 /250 variables (removed 217) and now considering 46/264 (removed 218) transitions.
// Phase 1: matrix 46 rows 33 cols
[2024-05-23 23:58:45] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:58:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 23:58:45] [INFO ] Invariant cache hit.
[2024-05-23 23:58:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:58:45] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-23 23:58:45] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-23 23:58:45] [INFO ] Invariant cache hit.
[2024-05-23 23:58:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 12/78 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/79 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 34 constraints, problems are : Problem set: 0 solved, 33 unsolved in 294 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 45/66 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 12/78 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 22/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 67 constraints, problems are : Problem set: 0 solved, 33 unsolved in 357 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 659ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/250 places, 46/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 746 ms. Remains : 33/250 places, 46/264 transitions.
[2024-05-23 23:58:46] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:58:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:58:46] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-23 23:58:46] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:58:46] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:58:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality5641969392525153921.gal : 1 ms
[2024-05-23 23:58:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality9026698845730056480.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/CTLCardinality5641969392525153921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9026698845730056480.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.
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,4.30074e+07,0.063692,6080,2,396,5,15560,6,0,177,12557,0


Converting to forward existential form...Done !
original formula: EF(((p43==1) * EF(AG((p102==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p43==1)),TRUE) * !(E(TRUE U !((p102==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t8, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t32, Intersection...240
(forward)formula 0,0,0.151257,8456,1,0,118,30739,113,51,1112,31589,104
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 226 transition count 240
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 226 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 226 transition count 234
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 219 transition count 227
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 219 transition count 227
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 219 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 218 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 218 transition count 221
Applied a total of 75 rules in 27 ms. Remains 218 /250 variables (removed 32) and now considering 221/264 (removed 43) transitions.
// Phase 1: matrix 221 rows 218 cols
[2024-05-23 23:58:46] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 23:58:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 23:58:46] [INFO ] Invariant cache hit.
[2024-05-23 23:58:46] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-23 23:58:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/439 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 231 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8220 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 220/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 1/439 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 451 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10335 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 18583ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 18585ms
Starting structural reductions in LTL mode, iteration 1 : 218/250 places, 221/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18996 ms. Remains : 218/250 places, 221/264 transitions.
[2024-05-23 23:59:05] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:59:05] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:59:05] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-23 23:59:05] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:59:05] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:59:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality3901587481525349095.gal : 2 ms
[2024-05-23 23:59:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality11732879414034034111.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/CTLCardinality3901587481525349095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11732879414034034111.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-23 23:59:35] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:59:35] [INFO ] Applying decomposition
[2024-05-23 23:59:35] [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/graph1120644657076584797.txt' '-o' '/tmp/graph1120644657076584797.bin' '-w' '/tmp/graph1120644657076584797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1120644657076584797.bin' '-l' '-1' '-v' '-w' '/tmp/graph1120644657076584797.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:59:35] [INFO ] Decomposing Gal with order
[2024-05-23 23:59:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:59:35] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-23 23:59:35] [INFO ] Flatten gal took : 11 ms
[2024-05-23 23:59:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-23 23:59:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9366267666860926481.gal : 2 ms
[2024-05-23 23:59:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13584525721213314245.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/CTLCardinality9366267666860926481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13584525721213314245.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.
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.71462e+15,0.10494,8580,630,28,9803,301,441,12915,36,721,0


Converting to forward existential form...Done !
original formula: (EF(((EX(((i1.i1.u11.p13==0)||(i12.i1.u82.p211==1))) * EF((i10.i0.u64.p176==0))) * (i11.i0.u72.p198==1))) + AX((EX(AF((i0.i2.u4.p8==0))) ...178
=> equivalent forward existential formula: [((EY((Init * !(E(TRUE U ((EX(((i1.i1.u11.p13==0)||(i12.i1.u82.p211==1))) * E(TRUE U (i10.i0.u64.p176==0))) * (i...249
Reverse transition relation is NOT exact ! Due to transitions t2, t195, i1.t190, i1.i1.u11.t183, i2.i0.t170, i2.i0.u15.t177, i3.t163, i3.i1.u18.t156, i4.t1...518
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 13
(forward)formula 0,1,2.03092,77748,1,0,189186,301,2706,167365,171,721,203756
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 226 transition count 240
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 226 transition count 240
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 226 transition count 235
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 218 transition count 227
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 218 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 218 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 217 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 217 transition count 220
Applied a total of 77 rules in 18 ms. Remains 217 /250 variables (removed 33) and now considering 220/264 (removed 44) transitions.
// Phase 1: matrix 220 rows 217 cols
[2024-05-23 23:59:37] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 23:59:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 23:59:37] [INFO ] Invariant cache hit.
[2024-05-23 23:59:37] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-23 23:59:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/437 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 230 constraints, problems are : Problem set: 0 solved, 219 unsolved in 8160 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 219/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 1/437 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 449 constraints, problems are : Problem set: 0 solved, 219 unsolved in 8346 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 16535ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 16537ms
Starting structural reductions in LTL mode, iteration 1 : 217/250 places, 220/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16735 ms. Remains : 217/250 places, 220/264 transitions.
[2024-05-23 23:59:54] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:59:54] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:59:54] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-23 23:59:54] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:59:54] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:59:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality9636931855133701802.gal : 3 ms
[2024-05-23 23:59:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality4922577070633054808.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/CTLCardinality9636931855133701802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4922577070633054808.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-24 00:00:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:00:24] [INFO ] Applying decomposition
[2024-05-24 00:00:24] [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/graph17779421840449861746.txt' '-o' '/tmp/graph17779421840449861746.bin' '-w' '/tmp/graph17779421840449861746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17779421840449861746.bin' '-l' '-1' '-v' '-w' '/tmp/graph17779421840449861746.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:00:24] [INFO ] Decomposing Gal with order
[2024-05-24 00:00:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:00:24] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-24 00:00:24] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:00:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:00:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10689200025657957884.gal : 2 ms
[2024-05-24 00:00:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality13437077403898381566.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/CTLCardinality10689200025657957884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13437077403898381566.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.
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.20805e+15,0.081021,6976,571,30,6407,239,475,9785,36,526,0


Converting to forward existential form...Done !
original formula: AF(!(A(!(((i10.i0.u69.p195==0)||(i9.i0.u83.p263==1))) U (EX(EG((i6.i1.u44.p131==0))) * AF((i12.u87.p260==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((EX(EG((i6.i1.u44.p131==0))) * !(EG(!((i12.u87.p260==0)))))) U (!(!(((i10.i0.u69.p195==0)|...328
Reverse transition relation is NOT exact ! Due to transitions t2, t194, i0.t189, i0.i3.t182, i1.t176, i1.i1.u12.t169, i2.t162, i2.i1.u23.t155, i3.t148, i3....525
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,5.8321,166432,1,0,317175,258,3147,444015,185,668,286666
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 226 transition count 240
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 226 transition count 240
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 226 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 219 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 219 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 72 place count 219 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 218 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 218 transition count 222
Applied a total of 74 rules in 10 ms. Remains 218 /250 variables (removed 32) and now considering 222/264 (removed 42) transitions.
// Phase 1: matrix 222 rows 218 cols
[2024-05-24 00:00:30] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:00:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 00:00:30] [INFO ] Invariant cache hit.
[2024-05-24 00:00:30] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-24 00:00:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 222/439 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/440 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/440 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 231 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8356 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 222/439 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 221/451 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/440 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 452 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8651 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 17039ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 17045ms
Starting structural reductions in LTL mode, iteration 1 : 218/250 places, 222/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17227 ms. Remains : 218/250 places, 222/264 transitions.
[2024-05-24 00:00:47] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:00:47] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:00:47] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-24 00:00:47] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:00:47] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:00:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18265870599096099104.gal : 1 ms
[2024-05-24 00:00:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality7062301136215143600.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/CTLCardinality18265870599096099104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7062301136215143600.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-24 00:01:17] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:01:17] [INFO ] Applying decomposition
[2024-05-24 00:01:17] [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/graph10607303996776478238.txt' '-o' '/tmp/graph10607303996776478238.bin' '-w' '/tmp/graph10607303996776478238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10607303996776478238.bin' '-l' '-1' '-v' '-w' '/tmp/graph10607303996776478238.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:01:17] [INFO ] Decomposing Gal with order
[2024-05-24 00:01:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:01:17] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-24 00:01:17] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:01:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:01:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality16612876528452908283.gal : 3 ms
[2024-05-24 00:01:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality16958832185612856526.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/CTLCardinality16612876528452908283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16958832185612856526.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.
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.74542e+15,0.072521,6512,620,23,5215,231,450,8276,35,514,0


Converting to forward existential form...Done !
original formula: A(AG((EX((i7.i0.u55.p144==1)) + (EG(((i9.i2.u71.p175==0)||(i7.i0.u54.p148==1))) * (i3.i0.u30.p77==0)))) U (AF(!(EX(TRUE))) + !(A(AX(((i6....238
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(!(EX(TRUE))))) + !(!((E(!(((i7.i1.u58.p153==0)||(i0.i1.u8.p22==1))) U (!(!(EX(!(((i6.i1...916
Reverse transition relation is NOT exact ! Due to transitions t196, i0.i0.t182, i0.i0.u6.t191, i1.t176, i1.i2.t169, i2.t162, i2.i0.t155, i3.t148, i3.i1.u27...531
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,5.22199,148808,1,0,262691,231,3063,397654,173,585,280819
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 230 transition count 244
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 230 transition count 244
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 230 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 225 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 225 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 225 transition count 230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 224 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 224 transition count 229
Applied a total of 61 rules in 15 ms. Remains 224 /250 variables (removed 26) and now considering 229/264 (removed 35) transitions.
// Phase 1: matrix 229 rows 224 cols
[2024-05-24 00:01:22] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 00:01:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 00:01:23] [INFO ] Invariant cache hit.
[2024-05-24 00:01:23] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-24 00:01:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 229/452 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 1/453 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/453 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 237 constraints, problems are : Problem set: 0 solved, 228 unsolved in 8835 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 229/452 variables, 223/236 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 228/464 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 1/453 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/453 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 465 constraints, problems are : Problem set: 0 solved, 228 unsolved in 10119 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
After SMT, in 18980ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 18982ms
Starting structural reductions in LTL mode, iteration 1 : 224/250 places, 229/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19164 ms. Remains : 224/250 places, 229/264 transitions.
[2024-05-24 00:01:42] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:01:42] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:01:42] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-24 00:01:42] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:01:42] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:01:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15759361881101932660.gal : 1 ms
[2024-05-24 00:01:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality3547507461242698858.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/CTLCardinality15759361881101932660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3547507461242698858.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-24 00:02:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:02:12] [INFO ] Applying decomposition
[2024-05-24 00:02:12] [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/graph532018019566098910.txt' '-o' '/tmp/graph532018019566098910.bin' '-w' '/tmp/graph532018019566098910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph532018019566098910.bin' '-l' '-1' '-v' '-w' '/tmp/graph532018019566098910.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:02:12] [INFO ] Decomposing Gal with order
[2024-05-24 00:02:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:02:12] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-24 00:02:12] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:02:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:02:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8661685999677498502.gal : 3 ms
[2024-05-24 00:02:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality8110778920186137131.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/CTLCardinality8661685999677498502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8110778920186137131.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.
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.26733e+16,0.093746,7616,509,24,7438,385,473,11849,35,1266,0


Converting to forward existential form...Done !
original formula: (A(((AX(!(AF((i6.i0.u48.p131==0)))) * A(AG(((i5.i0.u40.p104==0)||(i13.i1.u91.p250==1))) U EG((i8.i0.u62.p166==1)))) + A(EG(AX((i8.i1.u65....442
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(!(E(TRUE U !(!(EG(!((i3.i2.u32.p80==1)))))))) U (!(((!(EX(!(!(!(EG(!((i6.i0.u48.p131==0)...820
Reverse transition relation is NOT exact ! Due to transitions t203, i0.t198, i0.i2.t191, i1.t185, i1.i2.t178, i2.t171, i2.i2.t164, i3.i1.t150, i3.i1.u29.t1...538
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,11.1421,287984,1,0,509129,457,3768,730041,194,1567,507844
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Graph (trivial) has 209 edges and 250 vertex of which 7 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 243 transition count 142
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 130 rules applied. Total rules applied 245 place count 129 transition count 126
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 252 place count 124 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 254 place count 122 transition count 124
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 254 place count 122 transition count 97
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 308 place count 95 transition count 97
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 311 place count 92 transition count 94
Iterating global reduction 4 with 3 rules applied. Total rules applied 314 place count 92 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 314 place count 92 transition count 93
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 91 transition count 93
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 360 place count 69 transition count 71
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 361 place count 69 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 68 transition count 70
Applied a total of 362 rules in 20 ms. Remains 68 /250 variables (removed 182) and now considering 70/264 (removed 194) transitions.
// Phase 1: matrix 70 rows 68 cols
[2024-05-24 00:02:23] [INFO ] Computed 13 invariants in 0 ms
[2024-05-24 00:02:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 00:02:23] [INFO ] Invariant cache hit.
[2024-05-24 00:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:02:23] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-24 00:02:23] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-24 00:02:23] [INFO ] Invariant cache hit.
[2024-05-24 00:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/137 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 82 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1024 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/137 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 68/149 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 150 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1816 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2864ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2865ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/250 places, 70/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3040 ms. Remains : 68/250 places, 70/264 transitions.
[2024-05-24 00:02:26] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:02:26] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:02:26] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-24 00:02:26] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:02:26] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:02:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality12550639829147570027.gal : 1 ms
[2024-05-24 00:02:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11465862410417704609.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/CTLCardinality12550639829147570027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11465862410417704609.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,1.61316e+09,1.19801,44680,2,7124,5,224487,6,0,343,144556,0


Converting to forward existential form...Done !
original formula: AG((A(((!((p97==1)&&(p245==1)))||(!((p153==0)||(p252==1)))) U E(((p60==0)||(p197==1)) U A((p7==1) U (p234==0)))) * ((p58==0)||(p257==1)))...156
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(E(((p60==0)||(p197==1)) U !((E(!((p234==0)) U (!((p7==1)) * !((p234==0)))) + EG(!((p...534
(forward)formula 0,0,1.21085,44680,1,0,8,224487,9,2,354,144556,1
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Graph (trivial) has 223 edges and 250 vertex of which 7 / 250 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 374 edges and 244 vertex of which 228 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 227 transition count 130
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 143 rules applied. Total rules applied 268 place count 104 transition count 110
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 275 place count 97 transition count 110
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 275 place count 97 transition count 84
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 327 place count 71 transition count 84
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 339 place count 59 transition count 72
Iterating global reduction 3 with 12 rules applied. Total rules applied 351 place count 59 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 351 place count 59 transition count 71
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 353 place count 58 transition count 71
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 405 place count 32 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 406 place count 31 transition count 44
Applied a total of 406 rules in 19 ms. Remains 31 /250 variables (removed 219) and now considering 44/264 (removed 220) transitions.
// Phase 1: matrix 44 rows 31 cols
[2024-05-24 00:02:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 00:02:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 00:02:27] [INFO ] Invariant cache hit.
[2024-05-24 00:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:02:27] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 00:02:27] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-24 00:02:27] [INFO ] Invariant cache hit.
[2024-05-24 00:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 43/62 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 12/74 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 32 constraints, problems are : Problem set: 0 solved, 31 unsolved in 279 ms.
Refiners :[State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 43/62 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 12/74 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/75 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 63 constraints, problems are : Problem set: 0 solved, 31 unsolved in 298 ms.
Refiners :[State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 583ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/250 places, 44/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 666 ms. Remains : 31/250 places, 44/264 transitions.
[2024-05-24 00:02:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:02:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:02:28] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-24 00:02:28] [INFO ] Flatten gal took : 0 ms
[2024-05-24 00:02:28] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:02:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2099093413762069867.gal : 0 ms
[2024-05-24 00:02:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality16799945388014883004.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/CTLCardinality2099093413762069867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16799945388014883004.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,2.92293e+07,0.114415,8440,2,315,5,30452,6,0,168,25408,0


Converting to forward existential form...Done !
original formula: EG(AF((p232==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p232==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t26, t29, t30, Intersection ...239
(forward)formula 0,0,0.275771,12664,1,0,251,58110,114,122,1082,63677,267
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 264/264 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 226 transition count 240
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 226 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 226 transition count 234
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 218 transition count 226
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 218 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 218 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 217 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 217 transition count 219
Applied a total of 78 rules in 14 ms. Remains 217 /250 variables (removed 33) and now considering 219/264 (removed 45) transitions.
// Phase 1: matrix 219 rows 217 cols
[2024-05-24 00:02:28] [INFO ] Computed 13 invariants in 5 ms
[2024-05-24 00:02:28] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 00:02:28] [INFO ] Invariant cache hit.
[2024-05-24 00:02:28] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-24 00:02:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 1/436 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 230 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8094 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 218/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 1/436 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 448 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9508 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
After SMT, in 17637ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 17640ms
Starting structural reductions in LTL mode, iteration 1 : 217/250 places, 219/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17825 ms. Remains : 217/250 places, 219/264 transitions.
[2024-05-24 00:02:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:02:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:02:46] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-24 00:02:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:02:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:02:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6793853746025681690.gal : 16 ms
[2024-05-24 00:02:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality15213524296640797675.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/CTLCardinality6793853746025681690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15213524296640797675.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-24 00:03:16] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:03:16] [INFO ] Applying decomposition
[2024-05-24 00:03:16] [INFO ] Flatten gal took : 3 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/graph12442985402685753221.txt' '-o' '/tmp/graph12442985402685753221.bin' '-w' '/tmp/graph12442985402685753221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12442985402685753221.bin' '-l' '-1' '-v' '-w' '/tmp/graph12442985402685753221.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:03:16] [INFO ] Decomposing Gal with order
[2024-05-24 00:03:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:03:16] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-24 00:03:16] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:03:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:03:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6496936881033577904.gal : 3 ms
[2024-05-24 00:03:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality2833921499668463989.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/CTLCardinality6496936881033577904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2833921499668463989.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 : 250/250 places, 264/264 transitions.
Graph (trivial) has 211 edges and 250 vertex of which 7 / 250 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 374 edges and 244 vertex of which 228 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 227 transition count 139
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 134 rules applied. Total rules applied 250 place count 113 transition count 119
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 259 place count 106 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 261 place count 104 transition count 117
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 261 place count 104 transition count 91
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 313 place count 78 transition count 91
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 326 place count 65 transition count 78
Iterating global reduction 4 with 13 rules applied. Total rules applied 339 place count 65 transition count 78
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 387 place count 41 transition count 54
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 389 place count 41 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 40 transition count 53
Applied a total of 390 rules in 20 ms. Remains 40 /250 variables (removed 210) and now considering 53/264 (removed 211) transitions.
[2024-05-24 00:03:46] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
// Phase 1: matrix 52 rows 40 cols
[2024-05-24 00:03:46] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 00:03:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 00:03:46] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-05-24 00:03:46] [INFO ] Invariant cache hit.
[2024-05-24 00:03:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 00:03:46] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-24 00:03:46] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-24 00:03:46] [INFO ] Flow matrix only has 52 transitions (discarded 1 similar events)
[2024-05-24 00:03:46] [INFO ] Invariant cache hit.
[2024-05-24 00:03:46] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 51/87 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 4/91 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 1/92 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 54 constraints, problems are : Problem set: 0 solved, 48 unsolved in 667 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 51/87 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 44/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 4/91 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/92 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 102 constraints, problems are : Problem set: 0 solved, 48 unsolved in 702 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1380ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1381ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/250 places, 53/264 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1486 ms. Remains : 40/250 places, 53/264 transitions.
[2024-05-24 00:03:48] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:03:48] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:03:48] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-24 00:03:48] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:03:48] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:03:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8381844318941585566.gal : 1 ms
[2024-05-24 00:03:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality167657917101474900.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/CTLCardinality8381844318941585566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality167657917101474900.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,1.37635e+08,1.68918,54444,2,2331,5,256594,6,0,209,286942,0


Converting to forward existential form...Done !
original formula: AG(E(!(AG((p109==1))) U (EF(((p261==1)||(!((p228==0)||(p154==1))))) + EG(!(A((p199==1) U ((p244==0)||(p169==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(E(TRUE U !((p109==1))))) U (E(TRUE U ((p261==1)||(!((p228==0)||(p154==1))))) + EG(!(...280
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t6, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t23, t24, t25...295
Using saturation style SCC detection
(forward)formula 0,0,2.67439,58436,1,0,237,372010,146,119,1372,325353,275
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 00:03:51] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:03:51] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:03:51] [INFO ] Applying decomposition
[2024-05-24 00:03:51] [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/graph17520358134667436676.txt' '-o' '/tmp/graph17520358134667436676.bin' '-w' '/tmp/graph17520358134667436676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17520358134667436676.bin' '-l' '-1' '-v' '-w' '/tmp/graph17520358134667436676.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:03:51] [INFO ] Decomposing Gal with order
[2024-05-24 00:03:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:03:51] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-24 00:03:51] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:03:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-24 00:03:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality4007618098570239331.gal : 2 ms
[2024-05-24 00:03:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3614433187648255163.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/CTLCardinality4007618098570239331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3614433187648255163.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.
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,4.48505e+16,0.142222,9312,770,29,11643,274,503,16732,36,596,0


Converting to forward existential form...Done !
original formula: EX((EF((AF(((i9.u71.p172==0)||(i10.u73.p178==1))) * (i5.i1.i2.u41.p100==1))) * ((i4.u30.p77==0) + EF((i9.u70.p168==0)))))
=> equivalent forward existential formula: ([((EY(Init) * E(TRUE U (!(EG(!(((i9.u71.p172==0)||(i10.u73.p178==1))))) * (i5.i1.i2.u41.p100==1)))) * (i4.u30.p...316
Reverse transition relation is NOT exact ! Due to transitions t4, t17, t28, t238, i0.t233, i0.t224, i1.t219, i1.i1.i1.u18.t209, i3.t201, i3.t192, i4.t176, ...501
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 14
(forward)formula 0,1,8.50436,221568,1,0,459799,274,3462,549901,172,596,410618
FORMULA GPUForwardProgress-PT-12b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 515369 ms.

BK_STOP 1716509039690

--------------------
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="GPUForwardProgress-PT-12b"
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 GPUForwardProgress-PT-12b, 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 r180-tall-171640603600505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-12b.tgz
mv GPUForwardProgress-PT-12b 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 ;