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-171640603600506.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603600506
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-12b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716508522229

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
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
CTLFireability PT
Running Version 202405141337
[2024-05-23 23:55:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 23:55:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:55:23] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-23 23:55:23] [INFO ] Transformed 264 places.
[2024-05-23 23:55:23] [INFO ] Transformed 277 transitions.
[2024-05-23 23:55:23] [INFO ] Found NUPN structural information;
[2024-05-23 23:55:23] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 63 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 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 242 transition count 256
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 242 transition count 256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 240 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 240 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 240 transition count 252
Applied a total of 49 rules in 55 ms. Remains 240 /264 variables (removed 24) and now considering 252/277 (removed 25) transitions.
// Phase 1: matrix 252 rows 240 cols
[2024-05-23 23:55:23] [INFO ] Computed 13 invariants in 23 ms
[2024-05-23 23:55:23] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-23 23:55:23] [INFO ] Invariant cache hit.
[2024-05-23 23:55:24] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-23 23:55:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 252/491 variables, 239/252 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 1/492 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 253 constraints, problems are : Problem set: 0 solved, 251 unsolved in 10778 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 252/491 variables, 239/252 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 251/503 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 1/492 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 504 constraints, problems are : Problem set: 0 solved, 251 unsolved in 11509 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 22375ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 22397ms
Starting structural reductions in LTL mode, iteration 1 : 240/264 places, 252/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22910 ms. Remains : 240/264 places, 252/277 transitions.
Support contains 63 out of 240 places after structural reductions.
[2024-05-23 23:55:46] [INFO ] Flatten gal took : 38 ms
[2024-05-23 23:55:46] [INFO ] Flatten gal took : 15 ms
[2024-05-23 23:55:46] [INFO ] Input system was already deterministic with 252 transitions.
Support contains 58 out of 240 places (down from 63) after GAL structural reductions.
RANDOM walk for 40000 steps (352 resets) in 1503 ms. (26 steps per ms) remains 3/49 properties
BEST_FIRST walk for 40004 steps (53 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (30 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
[2024-05-23 23:55:47] [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) 230/239 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 252/491 variables, 239/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/492 variables, 1/253 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 253 constraints, problems are : Problem set: 2 solved, 1 unsolved in 168 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 138/142 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/239 variables, 6/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 252/491 variables, 239/252 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 1/253 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp48 is UNSAT
After SMT solving in domain Int declared 492/492 variables, and 254 constraints, problems are : Problem set: 3 solved, 0 unsolved in 124 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 23:55:47] [INFO ] Flatten gal took : 13 ms
[2024-05-23 23:55:47] [INFO ] Flatten gal took : 11 ms
[2024-05-23 23:55:47] [INFO ] Input system was already deterministic with 252 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 369 edges and 240 vertex of which 224 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 207 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 218 transition count 133
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 127 rules applied. Total rules applied 238 place count 109 transition count 115
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 246 place count 101 transition count 115
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 246 place count 101 transition count 89
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 298 place count 75 transition count 89
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 310 place count 63 transition count 77
Iterating global reduction 3 with 12 rules applied. Total rules applied 322 place count 63 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 63 transition count 76
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 324 place count 62 transition count 76
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 376 place count 36 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 378 place count 36 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 380 place count 34 transition count 48
Applied a total of 380 rules in 39 ms. Remains 34 /240 variables (removed 206) and now considering 48/252 (removed 204) transitions.
// Phase 1: matrix 48 rows 34 cols
[2024-05-23 23:55:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:55:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 23:55:47] [INFO ] Invariant cache hit.
[2024-05-23 23:55:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:55:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-23 23:55:47] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-23 23:55:47] [INFO ] Invariant cache hit.
[2024-05-23 23:55:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 47/69 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 12/81 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 35 constraints, problems are : Problem set: 0 solved, 33 unsolved in 336 ms.
Refiners :[State Equation: 34/34 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 47/69 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 12/81 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/82 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 68 constraints, problems are : Problem set: 0 solved, 33 unsolved in 350 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 702ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/240 places, 48/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 809 ms. Remains : 34/240 places, 48/252 transitions.
[2024-05-23 23:55:48] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:55:48] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:55:48] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-23 23:55:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:55:48] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:55:48] [INFO ] Time to serialize gal into /tmp/CTLFireability4658624775296523338.gal : 2 ms
[2024-05-23 23:55:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1875896757948776882.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/CTLFireability4658624775296523338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1875896757948776882.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,6.92842e+07,0.326708,16044,2,1020,5,67989,6,0,184,66610,0


Converting to forward existential form...Done !
original formula: AF(!(A(E((p124==1) U (p178==1)) U (p256!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((p256!=1)) U (!(E((p124==1) U (p178==1))) * !((p256!=1)))) + EG(!((p256!=1))))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t8, t10, t12, t14, t16, t19, t21, t24, t26, t28, t31, t44, t45, t46, t47, Inters...246
(forward)formula 0,0,3.15609,101308,1,0,372,491609,127,261,1273,734941,402
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 207 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 218 transition count 132
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 128 rules applied. Total rules applied 240 place count 108 transition count 114
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 248 place count 100 transition count 114
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 248 place count 100 transition count 87
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 302 place count 73 transition count 87
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 315 place count 60 transition count 74
Iterating global reduction 3 with 13 rules applied. Total rules applied 328 place count 60 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 329 place count 60 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 59 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 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 381 place count 34 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 383 place count 33 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 384 place count 32 transition count 45
Applied a total of 384 rules in 22 ms. Remains 32 /240 variables (removed 208) and now considering 45/252 (removed 207) transitions.
// Phase 1: matrix 45 rows 32 cols
[2024-05-23 23:55:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:55:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 23:55:51] [INFO ] Invariant cache hit.
[2024-05-23 23:55:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:55:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-23 23:55:51] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-23 23:55:51] [INFO ] Invariant cache hit.
[2024-05-23 23:55:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 3/76 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 33 constraints, problems are : Problem set: 0 solved, 42 unsolved in 410 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 3/76 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 42/74 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 75 constraints, problems are : Problem set: 0 solved, 42 unsolved in 478 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 900ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 900ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/240 places, 45/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 984 ms. Remains : 32/240 places, 45/252 transitions.
[2024-05-23 23:55:52] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:55:52] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:55:52] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 27 steps (1 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 23:55:52] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:55:52] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:55:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality531542017502999539.gal : 1 ms
[2024-05-23 23:55:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2523491324290060186.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality531542017502999539.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2523491324290060186.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality2523491324290060186.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.015035,3736,2,34,5,84,6,0,173,36,0
Total reachable state count : 2

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 206 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 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 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 218 transition count 135
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 123 rules applied. Total rules applied 232 place count 111 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 241 place count 104 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 243 place count 102 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 243 place count 102 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 295 place count 76 transition count 91
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 307 place count 64 transition count 79
Iterating global reduction 4 with 12 rules applied. Total rules applied 319 place count 64 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 319 place count 64 transition count 78
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 321 place count 63 transition count 78
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 371 place count 38 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 373 place count 37 transition count 51
Iterating global reduction 5 with 1 rules applied. Total rules applied 374 place count 37 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 376 place count 36 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 378 place count 36 transition count 50
Applied a total of 378 rules in 24 ms. Remains 36 /240 variables (removed 204) and now considering 50/252 (removed 202) transitions.
// Phase 1: matrix 50 rows 36 cols
[2024-05-23 23:55:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 23:55:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-23 23:55:53] [INFO ] Invariant cache hit.
[2024-05-23 23:55:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 23:55:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-23 23:55:53] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-23 23:55:53] [INFO ] Invariant cache hit.
[2024-05-23 23:55:53] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 49/84 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/86 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 38 constraints, problems are : Problem set: 0 solved, 49 unsolved in 501 ms.
Refiners :[State Equation: 36/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 49/84 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 49/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 87 constraints, problems are : Problem set: 0 solved, 49 unsolved in 816 ms.
Refiners :[State Equation: 36/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1328ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/240 places, 50/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1420 ms. Remains : 36/240 places, 50/252 transitions.
[2024-05-23 23:55:54] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:55:54] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:55:54] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-23 23:55:54] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:55:54] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:55:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11199160069609623958.gal : 1 ms
[2024-05-23 23:55:54] [INFO ] Time to serialize properties into /tmp/CTLFireability18386688868509142595.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/CTLFireability11199160069609623958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18386688868509142595.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,5.6195e+07,0.279919,15000,2,423,5,73370,6,0,193,56342,0


Converting to forward existential form...Done !
original formula: (AF(((EG((p124==1)) * (p141==0)) * (p229==1))) * EF((p224==1)))
=> equivalent forward existential formula: ([FwdG(Init,!(((EG((p124==1)) * (p141==0)) * (p229==1))))] = FALSE * [(Init * !(E(TRUE U (p224==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t23, t24,...299
(forward)formula 0,0,0.695597,24472,1,0,271,133234,131,115,1369,115885,281
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 222 transition count 234
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 222 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 222 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 218 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 218 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 218 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 217 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 217 transition count 219
Applied a total of 56 rules in 19 ms. Remains 217 /240 variables (removed 23) and now considering 219/252 (removed 33) transitions.
// Phase 1: matrix 219 rows 217 cols
[2024-05-23 23:55:55] [INFO ] Computed 13 invariants in 5 ms
[2024-05-23 23:55:55] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 23:55:55] [INFO ] Invariant cache hit.
[2024-05-23 23:55:55] [INFO ] Implicit Places using invariants and state equation in 108 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-23 23:55:55] [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 8089 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 10895 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 19015ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 19019ms
Starting structural reductions in LTL mode, iteration 1 : 217/240 places, 219/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19209 ms. Remains : 217/240 places, 219/252 transitions.
[2024-05-23 23:56:14] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:56:14] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:56:14] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-23 23:56:14] [INFO ] Flatten gal took : 10 ms
[2024-05-23 23:56:14] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:56:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6348672718091045387.gal : 5 ms
[2024-05-23 23:56:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5223878112889085107.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/CTLFireability6348672718091045387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5223878112889085107.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-23 23:56:44] [INFO ] Flatten gal took : 15 ms
[2024-05-23 23:56:44] [INFO ] Applying decomposition
[2024-05-23 23:56:44] [INFO ] Flatten gal took : 7 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/graph13299377993367223518.txt' '-o' '/tmp/graph13299377993367223518.bin' '-w' '/tmp/graph13299377993367223518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13299377993367223518.bin' '-l' '-1' '-v' '-w' '/tmp/graph13299377993367223518.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:56:44] [INFO ] Decomposing Gal with order
[2024-05-23 23:56:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:56:44] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-23 23:56:44] [INFO ] Flatten gal took : 41 ms
[2024-05-23 23:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-23 23:56:44] [INFO ] Time to serialize gal into /tmp/CTLFireability9476574219814575801.gal : 5 ms
[2024-05-23 23:56:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10254302965836133846.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/CTLFireability9476574219814575801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10254302965836133846.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.20572e+15,0.068327,6412,521,27,5049,224,433,7643,36,480,0


Converting to forward existential form...Done !
original formula: EX(AF(EG((((i1.i1.u18.p47==1)&&(i3.i0.u25.p74==0))&&(i5.i0.u39.p113==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG((((i1.i1.u18.p47==1)&&(i3.i0.u25.p74==0))&&(i5.i0.u39.p113==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t193, i0.t188, i0.i2.u6.t181, i1.i1.t168, i1.i1.u13.t176, i2.t160, i2.i1.u24.t153, i3.t146, i...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
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,9.13299,256948,1,0,409750,224,2544,700442,175,530,326952
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 194 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 218 transition count 144
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 111 rules applied. Total rules applied 211 place count 120 transition count 131
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 219 place count 114 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 221 place count 112 transition count 129
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 221 place count 112 transition count 104
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 271 place count 87 transition count 104
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 283 place count 75 transition count 92
Iterating global reduction 4 with 12 rules applied. Total rules applied 295 place count 75 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 295 place count 75 transition count 91
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 297 place count 74 transition count 91
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 341 place count 52 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 342 place count 52 transition count 68
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 343 place count 51 transition count 67
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 51 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 346 place count 50 transition count 66
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 50 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 351 place count 49 transition count 65
Applied a total of 351 rules in 19 ms. Remains 49 /240 variables (removed 191) and now considering 65/252 (removed 187) transitions.
[2024-05-23 23:56:53] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 49 cols
[2024-05-23 23:56:53] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 23:56:54] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 23:56:54] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
[2024-05-23 23:56:54] [INFO ] Invariant cache hit.
[2024-05-23 23:56:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:56:54] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-23 23:56:54] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-23 23:56:54] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
[2024-05-23 23:56:54] [INFO ] Invariant cache hit.
[2024-05-23 23:56:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 63/105 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 7/112 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 50 constraints, problems are : Problem set: 0 solved, 55 unsolved in 688 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 63/105 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 33/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 7/112 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 105 constraints, problems are : Problem set: 0 solved, 55 unsolved in 787 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 1493ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1493ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/240 places, 65/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1719 ms. Remains : 49/240 places, 65/252 transitions.
[2024-05-23 23:56:55] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:56:55] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:56:55] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-23 23:56:55] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:56:55] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:56:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16654256006373909144.gal : 1 ms
[2024-05-23 23:56:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17124211453707740948.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/CTLFireability16654256006373909144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17124211453707740948.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,5.44818e+08,0.227535,12840,2,1118,5,50415,6,0,259,49869,0


Converting to forward existential form...Done !
original formula: (AF((((p21==1) + EF((p133==1))) * (((!(E((p27==1) U (p217==1))) * !(E((p55==1) U (p166==1)))) * ((p115==1)||(p103==1))) + ((p112==0)&&(p1...180
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (p19==1)))),!((((p21==1) + E(TRUE U (p133==1))) * (((!(E((p27==1) U (p217==1))) * !(E((...240
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t9, t14, t18, t20, t23, t25, t28, t30, t33, t35, t37, t39, t42, t43, t45, t46, t47, t...257
(forward)formula 0,1,1.26591,44840,1,0,220,245566,170,112,1671,280439,233
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 211 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 218 transition count 132
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 128 rules applied. Total rules applied 240 place count 108 transition count 114
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 249 place count 100 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 99 transition count 113
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 250 place count 99 transition count 87
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 302 place count 73 transition count 87
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 314 place count 61 transition count 75
Iterating global reduction 4 with 12 rules applied. Total rules applied 326 place count 61 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 326 place count 61 transition count 74
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 328 place count 60 transition count 74
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 376 place count 36 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 377 place count 36 transition count 49
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 378 place count 35 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 379 place count 35 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 381 place count 34 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 33 transition count 46
Applied a total of 382 rules in 17 ms. Remains 33 /240 variables (removed 207) and now considering 46/252 (removed 206) transitions.
// Phase 1: matrix 46 rows 33 cols
[2024-05-23 23:56:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:56:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 23:56:56] [INFO ] Invariant cache hit.
[2024-05-23 23:56:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:56:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-23 23:56:56] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2024-05-23 23:56:56] [INFO ] Invariant cache hit.
[2024-05-23 23:56:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 45/68 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 10/78 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1/79 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 34 constraints, problems are : Problem set: 0 solved, 35 unsolved in 331 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 45/68 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 10/78 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 69 constraints, problems are : Problem set: 0 solved, 35 unsolved in 373 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 710ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/240 places, 46/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 794 ms. Remains : 33/240 places, 46/252 transitions.
[2024-05-23 23:56:57] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:56:57] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:56:57] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-23 23:56:57] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:56:57] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:56:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15699437927715024845.gal : 2 ms
[2024-05-23 23:56:57] [INFO ] Time to serialize properties into /tmp/CTLFireability11122620717848222609.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/CTLFireability15699437927715024845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11122620717848222609.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,2.96032e+07,0.077598,6608,2,385,5,18836,6,0,177,15721,0


Converting to forward existential form...Done !
original formula: AF(EG((EF((p12==1)) * EG((p62!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((E(TRUE U (p12==1)) * EG((p62!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t10, t12, t14, t16, t18, t20, t23, t24, t26, t28, t30, t31, t32, t33, Inters...246
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.94498,37748,1,0,447,218099,129,228,1206,242716,486
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 198 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 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 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 218 transition count 141
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 118 rules applied. Total rules applied 221 place count 117 transition count 124
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 233 place count 109 transition count 120
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 238 place count 105 transition count 119
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 238 place count 105 transition count 94
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 288 place count 80 transition count 94
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 301 place count 67 transition count 81
Iterating global reduction 4 with 13 rules applied. Total rules applied 314 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 316 place count 66 transition count 79
Iterating global reduction 5 with 1 rules applied. Total rules applied 317 place count 66 transition count 79
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 5 with 46 rules applied. Total rules applied 363 place count 43 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 365 place count 42 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 366 place count 42 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 367 place count 41 transition count 54
Applied a total of 367 rules in 22 ms. Remains 41 /240 variables (removed 199) and now considering 54/252 (removed 198) transitions.
// Phase 1: matrix 54 rows 41 cols
[2024-05-23 23:56:58] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:56:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 23:56:58] [INFO ] Invariant cache hit.
[2024-05-23 23:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:56:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-23 23:56:58] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-23 23:56:58] [INFO ] Invariant cache hit.
[2024-05-23 23:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 53/91 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 3/94 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/95 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 42 constraints, problems are : Problem set: 0 solved, 51 unsolved in 578 ms.
Refiners :[State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 53/91 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 3/94 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 41/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/95 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 93 constraints, problems are : Problem set: 0 solved, 51 unsolved in 792 ms.
Refiners :[State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 1378ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1379ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/240 places, 54/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1457 ms. Remains : 41/240 places, 54/252 transitions.
[2024-05-23 23:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:57:00] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:57:00] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-23 23:57:00] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:57:00] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:57:00] [INFO ] Time to serialize gal into /tmp/CTLFireability357061694304172465.gal : 1 ms
[2024-05-23 23:57:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6276512054905607131.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/CTLFireability357061694304172465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6276512054905607131.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,2.15411e+08,0.531451,21252,2,1138,5,93132,6,0,217,88358,0


Converting to forward existential form...Done !
original formula: AF(((!(E(((!(((p150==1)&&(p245==1))&&(p260==1)))&&(p131!=1)) U (p63==1))) * (p45==0)) * ((EF(((p5==0)&&(p34==0))) + (p60==0)) + ((p245==0...171
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(((!(((p150==1)&&(p245==1))&&(p260==1)))&&(p131!=1)) U (p63==1))) * (p45==0)) * ((E(TRUE U ((p...222
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t13, t16, t19, t21, t23, t25, t28, t30, t32, t34, t37, t38, t39, t40, t53, Inter...247
(forward)formula 0,0,11.6047,346996,1,0,416,1.54648e+06,142,322,1536,2.77136e+06,411
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 221 transition count 233
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 221 transition count 233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 221 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 217 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 217 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 216 transition count 218
Applied a total of 58 rules in 8 ms. Remains 216 /240 variables (removed 24) and now considering 218/252 (removed 34) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-23 23:57:11] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 23:57:11] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 23:57:11] [INFO ] Invariant cache hit.
[2024-05-23 23:57:11] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-23 23:57:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8048 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10092 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18173ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18175ms
Starting structural reductions in LTL mode, iteration 1 : 216/240 places, 218/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18381 ms. Remains : 216/240 places, 218/252 transitions.
[2024-05-23 23:57:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:57:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:57:30] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-23 23:57:30] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:57:30] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:57:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14238099748692294350.gal : 14 ms
[2024-05-23 23:57:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3557354541522285384.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/CTLFireability14238099748692294350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3557354541522285384.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:00] [INFO ] Flatten gal took : 11 ms
[2024-05-23 23:58:00] [INFO ] Applying decomposition
[2024-05-23 23:58:00] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1593908256907575825.txt' '-o' '/tmp/graph1593908256907575825.bin' '-w' '/tmp/graph1593908256907575825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1593908256907575825.bin' '-l' '-1' '-v' '-w' '/tmp/graph1593908256907575825.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:58:00] [INFO ] Decomposing Gal with order
[2024-05-23 23:58:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:58:00] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-23 23:58:00] [INFO ] Flatten gal took : 20 ms
[2024-05-23 23:58:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-23 23:58:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9637749831189022195.gal : 4 ms
[2024-05-23 23:58:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16294570641304833520.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/CTLFireability9637749831189022195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16294570641304833520.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,7.70148e+15,0.113165,8856,585,27,10123,329,495,15511,35,967,0


Converting to forward existential form...Done !
original formula: EX(AX(EG((AF((i12.i1.u86.p252==1)) * EF((i10.i2.u74.p210==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG((!(EG(!((i12.i1.u86.p252==1)))) * E(TRUE U (i10.i2.u74.p210==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t192, i0.t187, i0.i2.t180, i1.t174, i1.i2.t167, i2.t160, i2.i0.t153, i3.t146, i3.i0.t139, i4....539
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 12
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,0,3.20774,112608,1,0,258161,329,3142,275770,177,967,256897
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 208 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 218 transition count 132
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 126 rules applied. Total rules applied 238 place count 108 transition count 116
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 246 place count 101 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 100 transition count 115
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 247 place count 100 transition count 90
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 297 place count 75 transition count 90
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 309 place count 63 transition count 78
Iterating global reduction 4 with 12 rules applied. Total rules applied 321 place count 63 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 321 place count 63 transition count 77
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 323 place count 62 transition count 77
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 369 place count 39 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 370 place count 39 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 371 place count 38 transition count 52
Iterating global reduction 5 with 1 rules applied. Total rules applied 372 place count 38 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 374 place count 37 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 375 place count 37 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 376 place count 36 transition count 50
Applied a total of 376 rules in 19 ms. Remains 36 /240 variables (removed 204) and now considering 50/252 (removed 202) transitions.
// Phase 1: matrix 50 rows 36 cols
[2024-05-23 23:58:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:58:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 23:58:03] [INFO ] Invariant cache hit.
[2024-05-23 23:58:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:58:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-23 23:58:03] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-23 23:58:03] [INFO ] Invariant cache hit.
[2024-05-23 23:58:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 49/78 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 7/85 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/86 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 37 constraints, problems are : Problem set: 0 solved, 41 unsolved in 431 ms.
Refiners :[State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 49/78 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 29/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 7/85 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/86 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 78 constraints, problems are : Problem set: 0 solved, 41 unsolved in 558 ms.
Refiners :[State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 996ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 998ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/240 places, 50/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1083 ms. Remains : 36/240 places, 50/252 transitions.
[2024-05-23 23:58:04] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:58:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:58:04] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-23 23:58:04] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:58:04] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:58:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11550361058886395466.gal : 0 ms
[2024-05-23 23:58:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4437709471710378134.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11550361058886395466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4437709471710378134.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,5.00966e+07,0.119524,8240,2,619,5,22791,6,0,193,26978,0


Converting to forward existential form...Done !
original formula: E(EF((p141==1)) U E(EF(EG(((p81==1)||(p244==1)))) U EG((p9==1))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,E(TRUE U (p141==1))),E(TRUE U EG(((p81==1)||(p244==1))))),(p9==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t9, t11, t13, t16, t17, t19, t21, t23, t26, t27, t29, t31, t33, t34, t35, t36, Inter...247
Hit Full ! (commute/partial/dont) 48/0/2
(forward)formula 0,1,1.94479,73236,1,0,430,369960,143,282,1346,512900,542
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 221 transition count 233
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 221 transition count 233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 221 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 217 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 217 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 216 transition count 218
Applied a total of 58 rules in 19 ms. Remains 216 /240 variables (removed 24) and now considering 218/252 (removed 34) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-23 23:58:06] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 23:58:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 23:58:06] [INFO ] Invariant cache hit.
[2024-05-23 23:58:06] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-23 23:58:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8066 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10004 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18095ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18097ms
Starting structural reductions in LTL mode, iteration 1 : 216/240 places, 218/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18325 ms. Remains : 216/240 places, 218/252 transitions.
[2024-05-23 23:58:25] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:58:25] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:58:25] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-23 23:58:25] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:58:25] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:58:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4390875105449496127.gal : 2 ms
[2024-05-23 23:58:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4554299511717411412.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/CTLFireability4390875105449496127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4554299511717411412.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-23 23:58:55] [INFO ] Flatten gal took : 10 ms
[2024-05-23 23:58:55] [INFO ] Applying decomposition
[2024-05-23 23:58:55] [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/graph11030265396610225738.txt' '-o' '/tmp/graph11030265396610225738.bin' '-w' '/tmp/graph11030265396610225738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11030265396610225738.bin' '-l' '-1' '-v' '-w' '/tmp/graph11030265396610225738.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:58:55] [INFO ] Decomposing Gal with order
[2024-05-23 23:58:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:58:55] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-23 23:58:55] [INFO ] Flatten gal took : 11 ms
[2024-05-23 23:58:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-23 23:58:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16163522343331910460.gal : 3 ms
[2024-05-23 23:58:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15486043300918616993.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/CTLFireability16163522343331910460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15486043300918616993.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,7.70148e+15,0.111854,8568,651,28,10123,298,470,13617,36,722,0


Converting to forward existential form...Done !
original formula: EG(EX((i6.i1.u41.p116==0)))
=> equivalent forward existential formula: [FwdG(Init,EX((i6.i1.u41.p116==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t192, i1.i0.t180, i1.i0.t187, i2.t174, i2.i1.u17.t167, i3.t160, i3.i1.u18.t153, i4.t146, ...512
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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,7.2459,213168,1,0,483114,298,2389,390444,157,722,401620
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 211 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 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 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 218 transition count 130
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 128 rules applied. Total rules applied 242 place count 106 transition count 114
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 249 place count 99 transition count 114
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 249 place count 99 transition count 88
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 301 place count 73 transition count 88
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 313 place count 61 transition count 76
Iterating global reduction 3 with 12 rules applied. Total rules applied 325 place count 61 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 325 place count 61 transition count 75
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 327 place count 60 transition count 75
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 379 place count 34 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 380 place count 34 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 381 place count 33 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 382 place count 33 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 384 place count 32 transition count 46
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 385 place count 32 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 386 place count 31 transition count 45
Applied a total of 386 rules in 19 ms. Remains 31 /240 variables (removed 209) and now considering 45/252 (removed 207) transitions.
// Phase 1: matrix 45 rows 31 cols
[2024-05-23 23:59:02] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 23:59:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 23:59:02] [INFO ] Invariant cache hit.
[2024-05-23 23:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:59:02] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-23 23:59:02] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-23 23:59:02] [INFO ] Invariant cache hit.
[2024-05-23 23:59:02] [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) 44/63 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 12/75 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 32 constraints, problems are : Problem set: 0 solved, 31 unsolved in 297 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) 44/63 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 12/75 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/76 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/76 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 63 constraints, problems are : Problem set: 0 solved, 31 unsolved in 311 ms.
Refiners :[State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 613ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/240 places, 45/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 703 ms. Remains : 31/240 places, 45/252 transitions.
[2024-05-23 23:59:03] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:59:03] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:59:03] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-23 23:59:03] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:59:03] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:59:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13737172853367846088.gal : 0 ms
[2024-05-23 23:59:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12238913940788817923.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/CTLFireability13737172853367846088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12238913940788817923.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,2.66311e+07,0.209408,12940,2,342,5,60835,6,0,169,45925,0


Converting to forward existential form...Done !
original formula: EF(EG((p94==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p94==0))] != FALSE
Hit Full ! (commute/partial/dont) 43/0/2
(forward)formula 0,1,0.22892,12940,1,0,8,60835,19,3,900,45925,8
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 211 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 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 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 218 transition count 130
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 130 rules applied. Total rules applied 244 place count 106 transition count 112
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 252 place count 98 transition count 112
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 252 place count 98 transition count 86
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 304 place count 72 transition count 86
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 316 place count 60 transition count 74
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 60 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 60 transition count 73
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 330 place count 59 transition count 73
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 382 place count 33 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 383 place count 33 transition count 46
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 384 place count 32 transition count 45
Iterating global reduction 4 with 1 rules applied. Total rules applied 385 place count 32 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 387 place count 31 transition count 44
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 388 place count 31 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 30 transition count 43
Applied a total of 389 rules in 12 ms. Remains 30 /240 variables (removed 210) and now considering 43/252 (removed 209) transitions.
// Phase 1: matrix 43 rows 30 cols
[2024-05-23 23:59:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:59:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 23:59:03] [INFO ] Invariant cache hit.
[2024-05-23 23:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:59:03] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-23 23:59:03] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-23 23:59:03] [INFO ] Invariant cache hit.
[2024-05-23 23:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 42/60 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 12/72 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1/73 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 31 constraints, problems are : Problem set: 0 solved, 29 unsolved in 265 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 42/60 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 12/72 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 60 constraints, problems are : Problem set: 0 solved, 29 unsolved in 269 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 539ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/240 places, 43/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 609 ms. Remains : 30/240 places, 43/252 transitions.
[2024-05-23 23:59:03] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:59:03] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:59:04] [INFO ] Input system was already deterministic with 43 transitions.
RANDOM walk for 273 steps (11 resets) in 8 ms. (30 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 23:59:04] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:59:04] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:59:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11519674148669030126.gal : 1 ms
[2024-05-23 23:59:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14442421949066808055.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11519674148669030126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14442421949066808055.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14442421949066808055.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Graph (trivial) has 206 edges and 240 vertex of which 6 / 240 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 363 edges and 235 vertex of which 219 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 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 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 218 transition count 134
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 123 rules applied. Total rules applied 233 place count 110 transition count 119
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 243 place count 104 transition count 115
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 249 place count 100 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 99 transition count 113
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 250 place count 99 transition count 88
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 300 place count 74 transition count 88
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 312 place count 62 transition count 76
Iterating global reduction 5 with 12 rules applied. Total rules applied 324 place count 62 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 324 place count 62 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 326 place count 61 transition count 75
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 378 place count 35 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 379 place count 35 transition count 48
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 380 place count 34 transition count 47
Iterating global reduction 6 with 1 rules applied. Total rules applied 381 place count 34 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 383 place count 33 transition count 46
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 384 place count 33 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 385 place count 32 transition count 45
Applied a total of 385 rules in 11 ms. Remains 32 /240 variables (removed 208) and now considering 45/252 (removed 207) transitions.
// Phase 1: matrix 45 rows 32 cols
[2024-05-23 23:59:04] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:59:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 23:59:04] [INFO ] Invariant cache hit.
[2024-05-23 23:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:59:04] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-23 23:59:04] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-23 23:59:04] [INFO ] Invariant cache hit.
[2024-05-23 23:59:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 44/64 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 12/76 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 33 constraints, problems are : Problem set: 0 solved, 32 unsolved in 277 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 44/64 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 12/76 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 65 constraints, problems are : Problem set: 0 solved, 32 unsolved in 345 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 630ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/240 places, 45/252 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 698 ms. Remains : 32/240 places, 45/252 transitions.
[2024-05-23 23:59:04] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:59:04] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:59:04] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-23 23:59:04] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:59:04] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:59:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13563261602084165992.gal : 0 ms
[2024-05-23 23:59:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6708329801623055195.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/CTLFireability13563261602084165992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6708329801623055195.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,3.48192e+07,0.165307,11088,2,1148,5,40785,6,0,173,38845,0


Converting to forward existential form...Done !
original formula: (EF(!(A(EG((p199==1)) U (p74!=1)))) + AG((p203==0)))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U !(!((E(!((p74!=1)) U (!(EG((p199==1))) * !((p74!=1)))) + EG(!((p74!=1))))))))),TRUE) *...178
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t9, t11, t14, t16, t18, t20, t22, t25, t26, t28, t30, t31, Intersection with...235
(forward)formula 0,1,1.24516,53080,1,0,370,317546,124,162,1142,298180,428
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 221 transition count 233
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 221 transition count 233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 221 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 217 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 217 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 216 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 216 transition count 218
Applied a total of 58 rules in 14 ms. Remains 216 /240 variables (removed 24) and now considering 218/252 (removed 34) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-05-23 23:59:06] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 23:59:06] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 23:59:06] [INFO ] Invariant cache hit.
[2024-05-23 23:59:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-23 23:59:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8039 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10151 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18213ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18215ms
Starting structural reductions in LTL mode, iteration 1 : 216/240 places, 218/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18417 ms. Remains : 216/240 places, 218/252 transitions.
[2024-05-23 23:59:24] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:59:24] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:59:24] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-23 23:59:24] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:59:24] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1018315228273165467.gal : 1 ms
[2024-05-23 23:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16377957621226919092.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/CTLFireability1018315228273165467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16377957621226919092.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:54] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:59:54] [INFO ] Applying decomposition
[2024-05-23 23:59:54] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10839231426514228089.txt' '-o' '/tmp/graph10839231426514228089.bin' '-w' '/tmp/graph10839231426514228089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10839231426514228089.bin' '-l' '-1' '-v' '-w' '/tmp/graph10839231426514228089.weights' '-q' '0' '-e' '0.001'
[2024-05-23 23:59:54] [INFO ] Decomposing Gal with order
[2024-05-23 23:59:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 23:59:54] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-23 23:59:54] [INFO ] Flatten gal took : 11 ms
[2024-05-23 23:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-23 23:59:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18046094756388711018.gal : 2 ms
[2024-05-23 23:59:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8863966732225474150.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/CTLFireability18046094756388711018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8863966732225474150.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,7.70148e+15,0.109428,8564,614,28,10011,300,435,13270,36,718,0


Converting to forward existential form...Done !
original formula: AX(AG(E((i4.i0.u26.p74==1) U !(EX((((i7.i0.u46.p126==1)&&(i13.u86.p245==1))&&(i13.u90.p260==1)))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E((i4.i0.u26.p74==1) U !(EX((((i7.i0.u46.p126==1)&&(i13.u86.p245==1))&&(i13.u90.p260==...172
Reverse transition relation is NOT exact ! Due to transitions t2, t192, i1.t187, i1.i1.u6.t180, i2.t174, i2.i0.t167, i3.i0.t153, i3.i0.u24.t160, i4.t146, i...515
(forward)formula 0,0,0.296761,15428,1,0,22253,343,2905,36893,168,948,82624
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 252/252 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 222 transition count 234
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 222 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 222 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 218 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 218 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 218 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 217 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 217 transition count 219
Applied a total of 56 rules in 7 ms. Remains 217 /240 variables (removed 23) and now considering 219/252 (removed 33) transitions.
// Phase 1: matrix 219 rows 217 cols
[2024-05-23 23:59:54] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 23:59:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 23:59:54] [INFO ] Invariant cache hit.
[2024-05-23 23:59:55] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-23 23:59:55] [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 8019 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 8605 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 16652ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 16654ms
Starting structural reductions in LTL mode, iteration 1 : 217/240 places, 219/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16833 ms. Remains : 217/240 places, 219/252 transitions.
[2024-05-24 00:00:11] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:00:11] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:00:11] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-24 00:00:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:00:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:00:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1866992178989179910.gal : 2 ms
[2024-05-24 00:00:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7373982369947976117.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/CTLFireability1866992178989179910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7373982369947976117.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:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:00:41] [INFO ] Applying decomposition
[2024-05-24 00:00:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1279836980593776407.txt' '-o' '/tmp/graph1279836980593776407.bin' '-w' '/tmp/graph1279836980593776407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1279836980593776407.bin' '-l' '-1' '-v' '-w' '/tmp/graph1279836980593776407.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:00:41] [INFO ] Decomposing Gal with order
[2024-05-24 00:00:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:00:41] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-24 00:00:41] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:00:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4507702593432976013.gal : 2 ms
[2024-05-24 00:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2628586725140148511.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/CTLFireability4507702593432976013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2628586725140148511.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.
[2024-05-24 00:01:11] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:01:11] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:01:11] [INFO ] Applying decomposition
[2024-05-24 00:01:11] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12035436112464907368.txt' '-o' '/tmp/graph12035436112464907368.bin' '-w' '/tmp/graph12035436112464907368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12035436112464907368.bin' '-l' '-1' '-v' '-w' '/tmp/graph12035436112464907368.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:01:11] [INFO ] Decomposing Gal with order
[2024-05-24 00:01:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:01:11] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-24 00:01:11] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:01:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:01:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15198977835927537036.gal : 2 ms
[2024-05-24 00:01:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9873103849313792526.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/CTLFireability15198977835927537036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9873103849313792526.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.
ITS-tools command line returned an error code 137
[2024-05-24 00:20:25] [INFO ] Applying decomposition
[2024-05-24 00:20:25] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:20:25] [INFO ] Decomposing Gal with order
[2024-05-24 00:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:20:25] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-24 00:20:25] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 11 ms.
[2024-05-24 00:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5484243224122566037.gal : 2 ms
[2024-05-24 00:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17630043339946542551.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/CTLFireability5484243224122566037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17630043339946542551.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,2.99648e+16,0.201587,12752,283,364,15767,1599,293,53617,171,9476,0


Converting to forward existential form...Done !
original formula: AF(((EX((i0.i0.i0.i0.i0.i0.i0.i0.u18.p115==1)) + (i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p70==1)) + ((i0.i0.i0.i0.i0.i0.u20.p156==1)&&(i0.i0.i...184
=> equivalent forward existential formula: [FwdG(Init,!(((EX((i0.i0.i0.i0.i0.i0.i0.i0.u18.p115==1)) + (i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p70==1)) + ((i0.i0...229
Reverse transition relation is NOT exact ! Due to transitions t226, u26.t3, u26.t7, u26.t8, u26.t12, i0.u25.t16, i0.u25.t25, i0.u25.t26, i0.u25.t29, i0.i0....1014
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,0,16.423,408568,1,0,673434,43824,5531,1.97858e+06,1259,336030,245583
FORMULA GPUForwardProgress-PT-12b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1518985 ms.

BK_STOP 1716510042440

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-12b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603600506"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;