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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 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 27K 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-04b-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716507453203

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-23 23:37:34] [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:37:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:37:34] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-23 23:37:34] [INFO ] Transformed 112 places.
[2024-05-23 23:37:34] [INFO ] Transformed 117 transitions.
[2024-05-23 23:37:34] [INFO ] Found NUPN structural information;
[2024-05-23 23:37:34] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 89 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Applied a total of 0 rules in 28 ms. Remains 112 /112 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 112 cols
[2024-05-23 23:37:34] [INFO ] Computed 6 invariants in 6 ms
[2024-05-23 23:37:34] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-23 23:37:34] [INFO ] Invariant cache hit.
[2024-05-23 23:37:34] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-23 23:37:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/228 variables, 111/228 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 1/229 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 230 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2848 ms.
Refiners :[Domain max(s): 112/112 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/228 variables, 111/228 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 116/344 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/229 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 346 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3567 ms.
Refiners :[Domain max(s): 112/112 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 6459ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6471ms
Finished structural reductions in LTL mode , in 1 iterations and 6847 ms. Remains : 112/112 places, 117/117 transitions.
Support contains 89 out of 112 places after structural reductions.
[2024-05-23 23:37:41] [INFO ] Flatten gal took : 26 ms
[2024-05-23 23:37:41] [INFO ] Flatten gal took : 10 ms
[2024-05-23 23:37:41] [INFO ] Input system was already deterministic with 117 transitions.
Reduction of identical properties reduced properties to check from 87 to 86
RANDOM walk for 40000 steps (878 resets) in 1448 ms. (27 steps per ms) remains 5/86 properties
BEST_FIRST walk for 40003 steps (183 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (202 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (199 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (202 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (204 resets) in 69 ms. (571 steps per ms) remains 4/5 properties
[2024-05-23 23:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 97/111 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 97/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 117/228 variables, 111/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/229 variables, 1/229 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 1/230 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/230 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/230 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 230 constraints, problems are : Problem set: 3 solved, 1 unsolved in 142 ms.
Refiners :[Domain max(s): 112/112 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 87/93 variables, 4/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 87/98 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/98 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/111 variables, 1/99 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 18/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 117/228 variables, 111/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 1/229 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/229 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/229 variables, 1/230 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 1/231 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 0/231 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/229 variables, 0/231 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 231 constraints, problems are : Problem set: 3 solved, 1 unsolved in 88 ms.
Refiners :[Domain max(s): 112/112 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 117/117 transitions.
Graph (trivial) has 102 edges and 112 vertex of which 7 / 112 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 106 transition count 50
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 125 place count 47 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 46 transition count 44
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 126 place count 46 transition count 35
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 144 place count 37 transition count 35
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 34 transition count 32
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 34 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 150 place count 34 transition count 31
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 152 place count 33 transition count 31
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 178 place count 20 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 182 place count 20 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 184 place count 19 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 18 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 17 transition count 14
Applied a total of 187 rules in 62 ms. Remains 17 /112 variables (removed 95) and now considering 14/117 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 17/112 places, 14/117 transitions.
RANDOM walk for 354 steps (53 resets) in 7 ms. (44 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-23 23:37:42] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:37:42] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:37:42] [INFO ] Input system was already deterministic with 117 transitions.
Support contains 86 out of 112 places (down from 87) after GAL structural reductions.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 164 edges and 112 vertex of which 103 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 97 transition count 103
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 97 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 92 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 92 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 92 transition count 95
Applied a total of 42 rules in 11 ms. Remains 92 /112 variables (removed 20) and now considering 95/117 (removed 22) transitions.
// Phase 1: matrix 95 rows 92 cols
[2024-05-23 23:37:42] [INFO ] Computed 5 invariants in 7 ms
[2024-05-23 23:37:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 23:37:42] [INFO ] Invariant cache hit.
[2024-05-23 23:37:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-23 23:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 97 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1637 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 94/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 191 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1709 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 3365ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 3367ms
Starting structural reductions in LTL mode, iteration 1 : 92/112 places, 95/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3475 ms. Remains : 92/112 places, 95/117 transitions.
[2024-05-23 23:37:46] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:37:46] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:37:46] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-23 23:37:46] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:37:46] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:37:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16464575939201956526.gal : 2 ms
[2024-05-23 23:37:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8189335870095421999.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/CTLFireability16464575939201956526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8189335870095421999.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.01618e+06,0.129705,9380,2,2351,5,25170,6,0,465,25765,0


Converting to forward existential form...Done !
original formula: EX(E(AF(((p75!=1)&&((p65!=1)||((p82==1)&&(p105==1))))) U ((p100==1) + ((!(EX((p25==1))) * AG((((p70==1)&&(p93==1))&&(p108==1)))) * ((p54=...179
=> equivalent forward existential formula: ([(FwdU(EY(Init),!(EG(!(((p75!=1)&&((p65!=1)||((p82==1)&&(p105==1)))))))) * (p100==1))] != FALSE + [FwdG(((FwdU(...327
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t11, t14, t22, t23, t24, t30, t38, t44, t51, t58, t67, t73, t80, t85, Intersecti...242
(forward)formula 0,1,4.40374,162996,1,0,733,828682,218,409,2594,1.03013e+06,806
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 99 transition count 105
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 99 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 96 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 96 transition count 101
Applied a total of 32 rules in 9 ms. Remains 96 /112 variables (removed 16) and now considering 101/117 (removed 16) transitions.
// Phase 1: matrix 101 rows 96 cols
[2024-05-23 23:37:50] [INFO ] Computed 5 invariants in 3 ms
[2024-05-23 23:37:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 23:37:50] [INFO ] Invariant cache hit.
[2024-05-23 23:37:50] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-23 23:37:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/196 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/197 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 101 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1931 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/196 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/197 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1885 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 3830ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 3831ms
Starting structural reductions in LTL mode, iteration 1 : 96/112 places, 101/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3947 ms. Remains : 96/112 places, 101/117 transitions.
[2024-05-23 23:37:54] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:37:54] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:37:54] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-23 23:37:54] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:37:54] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:37:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9204407627987946465.gal : 2 ms
[2024-05-23 23:37:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15292662737159968393.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/CTLFireability9204407627987946465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15292662737159968393.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.98178e+06,0.119596,8972,2,2335,5,23642,6,0,487,24209,0


Converting to forward existential form...Done !
original formula: E(A(A((EG((p15==1)) + ((p37==1)&&(p77==1))) U !(AX((p67==1)))) U (!((((AF((p111==1)) + (p6!=1)) * ((p25==1)||(p92==1))) * (p29==1))) + ((...278
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((!((((!(EG(!((p111==1)))) + (p6!=1)) * ((p25==1)||(p92==1))) * (p29==1))) + (((p16==1)&&(p93=...680
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t7, t12, t14, t23, t24, t25, t30, t40, t47, t54, t61, t70, t76, t86, t91, Inters...247
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.6874,259532,1,0,1338,1.69049e+06,268,646,3153,1.49956e+06,1609
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 99 transition count 105
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 99 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 97 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 97 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 96 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 96 transition count 102
Applied a total of 31 rules in 18 ms. Remains 96 /112 variables (removed 16) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 96 cols
[2024-05-23 23:38:02] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 23:38:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 23:38:02] [INFO ] Invariant cache hit.
[2024-05-23 23:38:02] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-23 23:38:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 102/197 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/198 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/198 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 101 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1841 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 102/197 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 101/201 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/198 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 202 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1847 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3704ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3706ms
Starting structural reductions in LTL mode, iteration 1 : 96/112 places, 102/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3829 ms. Remains : 96/112 places, 102/117 transitions.
[2024-05-23 23:38:06] [INFO ] Flatten gal took : 9 ms
[2024-05-23 23:38:06] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:38:06] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-23 23:38:06] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:38:06] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10134214930835246901.gal : 2 ms
[2024-05-23 23:38:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17643053310343135321.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/CTLFireability10134214930835246901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17643053310343135321.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,4.05561e+06,0.159143,10560,2,2339,5,30504,6,0,488,32446,0


Converting to forward existential form...Done !
original formula: E((((AX((p60==1)) * AF((p111==1))) * (!(AF((p15!=1))) * (p2!=1))) * (((!(((p43==1)||(p105==1))) + EG((p33==1))) * (!((((p66==1)&&(p44==1)...375
=> equivalent forward existential formula: [(FwdU(Init,(((!(EX(!((p60==1)))) * !(EG(!((p111==1))))) * (!(!(EG(!((p15!=1))))) * (p2!=1))) * (((!(((p43==1)||...463
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t11, t22, t23, t28, t38, t46, t56, t62, t71, t77, t87, t92, Intersection with re...233
(forward)formula 0,0,9.00601,262696,1,0,1007,1.72547e+06,263,464,2886,1.50692e+06,1185
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 98 transition count 104
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 98 transition count 104
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 94 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 94 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 94 transition count 97
Applied a total of 38 rules in 5 ms. Remains 94 /112 variables (removed 18) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 94 cols
[2024-05-23 23:38:15] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 23:38:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-23 23:38:15] [INFO ] Invariant cache hit.
[2024-05-23 23:38:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-23 23:38:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 99 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1721 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 96/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 195 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1823 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 3557ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 3558ms
Starting structural reductions in LTL mode, iteration 1 : 94/112 places, 97/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3652 ms. Remains : 94/112 places, 97/117 transitions.
[2024-05-23 23:38:19] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:38:19] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:38:19] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-23 23:38:19] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:19] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1540235583262426043.gal : 1 ms
[2024-05-23 23:38:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1350097741300692226.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/CTLFireability1540235583262426043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1350097741300692226.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,3.02445e+06,0.144556,9992,2,2444,5,26977,6,0,475,27871,0


Converting to forward existential form...Done !
original formula: AG(((EF((p20==0)) + EG(!(E((p101==1) U (p65==1))))) + ((!(A((p110==1) U (p75==1))) * (p14==0)) + (EX(E(((p94==1)||(p105==1)) U A((p33==1)...184
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((!(!((E(!((p75==1)) U (!((p110==1)) * !((p75==1)))) + EG(!((p75==1)))))) * (p14==0)) + ...340
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t11, t16, t24, t26, t27, t32, t40, t46, t53, t60, t67, t73, t82, t87, Intersecti...242
(forward)formula 0,1,0.778123,33128,1,0,171,137197,215,97,2626,112795,204
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 98 transition count 104
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 92 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 92 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 92 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 91 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 91 transition count 93
Applied a total of 45 rules in 6 ms. Remains 91 /112 variables (removed 21) and now considering 93/117 (removed 24) transitions.
// Phase 1: matrix 93 rows 91 cols
[2024-05-23 23:38:19] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:38:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 23:38:19] [INFO ] Invariant cache hit.
[2024-05-23 23:38:19] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-23 23:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 96 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1642 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 92/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 188 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1681 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3333ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3334ms
Starting structural reductions in LTL mode, iteration 1 : 91/112 places, 93/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3433 ms. Remains : 91/112 places, 93/117 transitions.
[2024-05-23 23:38:23] [INFO ] Flatten gal took : 10 ms
[2024-05-23 23:38:23] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:23] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-23 23:38:23] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:38:23] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6189910824762864470.gal : 1 ms
[2024-05-23 23:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14618322329445857797.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/CTLFireability6189910824762864470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14618322329445857797.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.29023e+06,0.127215,9444,2,2235,5,24590,6,0,459,27094,0


Converting to forward existential form...Done !
original formula: A(EG((!((((((p10==1)&&(p93==1))&&(p108==1))||(p73==1))||((p92!=1)||(p39==1)))) * ((p21==1) + (E((p71==1) U (p59==1)) * (((p106==1)||(p48=...232
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(EX(!((((p34==1)&&(p93==1))&&(p108==1)))))))))) * !(E(!(E(TRUE U !(EX(!((((p34==1)&&(...427
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t22, t23, t28, t35, t42, t49, t57, t65, t71, t79, t83, Intersection wit...236
(forward)formula 0,1,1.58188,60496,1,0,237,309312,220,112,2697,274451,274
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Graph (complete) has 164 edges and 112 vertex of which 103 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 102 transition count 64
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 53 transition count 60
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 52 transition count 56
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 113 place count 48 transition count 55
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 113 place count 48 transition count 48
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 127 place count 41 transition count 48
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 131 place count 37 transition count 44
Iterating global reduction 4 with 4 rules applied. Total rules applied 135 place count 37 transition count 44
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 153 place count 28 transition count 35
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 155 place count 27 transition count 34
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 156 place count 27 transition count 34
Applied a total of 156 rules in 18 ms. Remains 27 /112 variables (removed 85) and now considering 34/117 (removed 83) transitions.
// Phase 1: matrix 34 rows 27 cols
[2024-05-23 23:38:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 23:38:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-23 23:38:25] [INFO ] Invariant cache hit.
[2024-05-23 23:38:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 23:38:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-23 23:38:25] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2024-05-23 23:38:25] [INFO ] Invariant cache hit.
[2024-05-23 23:38:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 34/60 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 28 constraints, problems are : Problem set: 0 solved, 33 unsolved in 285 ms.
Refiners :[State Equation: 27/27 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 34/60 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 61 constraints, problems are : Problem set: 0 solved, 33 unsolved in 267 ms.
Refiners :[State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 564ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 564ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/112 places, 34/117 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 650 ms. Remains : 27/112 places, 34/117 transitions.
[2024-05-23 23:38:25] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:25] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:38:25] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-23 23:38:25] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:38:25] [INFO ] Flatten gal took : 1 ms
[2024-05-23 23:38:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11353449593705207969.gal : 1 ms
[2024-05-23 23:38:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8685425017424664688.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/CTLFireability11353449593705207969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8685425017424664688.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,6964,0.011584,3828,2,152,5,2203,6,0,142,2347,0


Converting to forward existential form...Done !
original formula: A((p87==1) U (A(((AF((p86==1)) + (p87==1)) + (p15==1)) U AG((p44==1))) * (!(((!((p7==1)||(p85==1)))&&(p77==1))) + !(E((p13!=1) U (p51!=1)...160
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(E(TRUE U !((p44==1))))) U (!(((!(EG(!((p86==1)))) + (p87==1)) + (p15==1))) * !(!(E(TR...778
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t15, t16, t20, t21, t22, t23, t24, t25, t26, t33, Intersection with reachable a...223
(forward)formula 0,0,0.112608,9108,1,0,273,32420,109,145,857,39360,325
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 96 transition count 102
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 96 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 90 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 90 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 89 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 89 transition count 92
Applied a total of 48 rules in 5 ms. Remains 89 /112 variables (removed 23) and now considering 92/117 (removed 25) transitions.
// Phase 1: matrix 92 rows 89 cols
[2024-05-23 23:38:25] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 23:38:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-23 23:38:25] [INFO ] Invariant cache hit.
[2024-05-23 23:38:25] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-23 23:38:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/180 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 1/181 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 94 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1603 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/180 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 91/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/181 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 185 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1689 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 3305ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3306ms
Starting structural reductions in LTL mode, iteration 1 : 89/112 places, 92/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3412 ms. Remains : 89/112 places, 92/117 transitions.
[2024-05-23 23:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:38:29] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:29] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-23 23:38:29] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:29] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6806477238332044332.gal : 0 ms
[2024-05-23 23:38:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4948196920360617446.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/CTLFireability6806477238332044332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4948196920360617446.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,2.82645e+06,0.115189,9172,2,2246,5,23815,6,0,450,25002,0


Converting to forward existential form...Done !
original formula: AF(((AF(AG((((p16==1)&&(p93==1))&&(p108==1)))) + (((p16==1)&&(p93==1))&&(p108==1))) * ((EG((EX((p61==1)) + A((p30==1) U (p58==1)))) + EF(...184
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(E(TRUE U !((((p16==1)&&(p93==1))&&(p108==1)))))))) + (((p16==1)&&(p93==1))&&(p108==1))) ...298
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t21, t22, t27, t36, t43, t50, t57, t64, t70, t77, t82, Intersection wit...236
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,18.4351,560568,1,0,1377,3.59921e+06,232,770,2796,3.35838e+06,1385
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 99 transition count 104
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 99 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 94 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 94 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 94 transition count 96
Applied a total of 39 rules in 2 ms. Remains 94 /112 variables (removed 18) and now considering 96/117 (removed 21) transitions.
// Phase 1: matrix 96 rows 94 cols
[2024-05-23 23:38:47] [INFO ] Computed 6 invariants in 2 ms
[2024-05-23 23:38:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 23:38:47] [INFO ] Invariant cache hit.
[2024-05-23 23:38:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-23 23:38:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/189 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/190 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/190 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 100 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1734 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/189 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 95/194 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/190 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 195 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1739 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 3483ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 3485ms
Starting structural reductions in LTL mode, iteration 1 : 94/112 places, 96/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3587 ms. Remains : 94/112 places, 96/117 transitions.
[2024-05-23 23:38:51] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:38:51] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:38:51] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-23 23:38:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:51] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:38:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15928483126177847182.gal : 0 ms
[2024-05-23 23:38:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17178685862351349523.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/CTLFireability15928483126177847182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17178685862351349523.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,3.01824e+06,0.105241,8672,2,2258,5,21623,6,0,474,23668,0


Converting to forward existential form...Done !
original formula: E((p69==1) U ((AF((((p31==1)&&(p5!=1)) + AG((p109==1)))) + A((p2!=1) U ((A((p101==1) U (p96==1)) * AF((p77==1))) * (p59==1)))) + (EG(AX(!...286
=> equivalent forward existential formula: (([(FwdU(Init,(p69==1)) * !(EG(!((((p31==1)&&(p5!=1)) + !(E(TRUE U !((p109==1)))))))))] != FALSE + [((FwdU(Init,...715
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t12, t13, t15, t23, t24, t25, t30, t37, t44, t51, t58, t68, t74, t81, t86, Inter...247
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 94/0/2
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,14.3733,481520,1,0,2379,3.35389e+06,267,1457,2938,2.82052e+06,2718
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 98 transition count 104
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 92 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 92 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 92 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 91 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 91 transition count 93
Applied a total of 45 rules in 9 ms. Remains 91 /112 variables (removed 21) and now considering 93/117 (removed 24) transitions.
// Phase 1: matrix 93 rows 91 cols
[2024-05-23 23:39:05] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:39:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 23:39:05] [INFO ] Invariant cache hit.
[2024-05-23 23:39:05] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-23 23:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 96 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1649 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 92/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 188 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1628 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3289ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3289ms
Starting structural reductions in LTL mode, iteration 1 : 91/112 places, 93/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3400 ms. Remains : 91/112 places, 93/117 transitions.
[2024-05-23 23:39:09] [INFO ] Flatten gal took : 10 ms
[2024-05-23 23:39:09] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:09] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-23 23:39:09] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:09] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17199954751012982203.gal : 1 ms
[2024-05-23 23:39:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11341044113822355952.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/CTLFireability17199954751012982203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11341044113822355952.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.71142e+06,0.108247,8916,2,2168,5,23084,6,0,459,24427,0


Converting to forward existential form...Done !
original formula: AF(E((EX((EF((p83==1)) + E((p89==1) U (((p34==1)&&(p93==1))&&(p108==1))))) * AG(((p106!=1)&&(p109==1)))) U ((p79==1)&&(p99==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E((EX((E(TRUE U (p83==1)) + E((p89==1) U (((p34==1)&&(p93==1))&&(p108==1))))) * !(E(TRUE U !(((p106...210
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t12, t13, t24, t26, t30, t37, t44, t51, t58, t65, t71, t78, t83, Intersection wi...237
(forward)formula 0,0,3.0909,123412,1,0,538,561543,219,346,2688,819230,495
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 97 transition count 103
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 97 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 92 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 92 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 92 transition count 95
Applied a total of 42 rules in 3 ms. Remains 92 /112 variables (removed 20) and now considering 95/117 (removed 22) transitions.
// Phase 1: matrix 95 rows 92 cols
[2024-05-23 23:39:12] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:39:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-23 23:39:12] [INFO ] Invariant cache hit.
[2024-05-23 23:39:12] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-23 23:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 97 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1642 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 94/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 191 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1772 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 3422ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 3423ms
Starting structural reductions in LTL mode, iteration 1 : 92/112 places, 95/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3516 ms. Remains : 92/112 places, 95/117 transitions.
[2024-05-23 23:39:15] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:39:15] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:39:15] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-23 23:39:15] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:15] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4996998809904899355.gal : 1 ms
[2024-05-23 23:39:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16558596913553673072.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/CTLFireability4996998809904899355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16558596913553673072.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((AX(EF(AX((p94==1)))) * ((AF((p90==0)) + (p107==0)) + EX(((p33==1)||(p7==0))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(EX(!((p94==1)))))))] = FALSE * [FwdG(((FwdU(Init,TRUE) * !(EX(((p33==1)||(...204
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t15, t23, t25, t26, t30, t37, t44, t51, t58, t65, t71, t80, t85, Inters...246
(forward)formula 0,1,1.49203,61280,1,0,249,309900,225,120,2727,279180,286
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 97 transition count 103
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 97 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 91 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 91 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 90 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 90 transition count 93
Applied a total of 46 rules in 4 ms. Remains 90 /112 variables (removed 22) and now considering 93/117 (removed 24) transitions.
// Phase 1: matrix 93 rows 90 cols
[2024-05-23 23:39:17] [INFO ] Computed 5 invariants in 6 ms
[2024-05-23 23:39:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 23:39:17] [INFO ] Invariant cache hit.
[2024-05-23 23:39:17] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-23 23:39:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/182 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/183 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 95 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1586 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/182 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 92/186 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/183 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 187 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1588 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 3182ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 3183ms
Starting structural reductions in LTL mode, iteration 1 : 90/112 places, 93/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3290 ms. Remains : 90/112 places, 93/117 transitions.
[2024-05-23 23:39:20] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:39:20] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:39:20] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-23 23:39:20] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:39:20] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:39:20] [INFO ] Time to serialize gal into /tmp/CTLFireability17104146070618564026.gal : 1 ms
[2024-05-23 23:39:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11702760106623007924.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/CTLFireability17104146070618564026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11702760106623007924.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.99476e+06,0.110196,8916,2,2158,5,22482,6,0,455,25796,0


Converting to forward existential form...Done !
original formula: A((p49==1) U AF(AX((p33==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(EX(!((p33==1))))))))))) * !(E(!(!(EG(!(!(EX(!((p33==1)))))))) U (!((p49==1)) * !(!(EG(...193
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t21, t22, t27, t34, t41, t51, t58, t65, t71, t78, t83, Intersection wit...236
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.94011,241416,1,0,376,1.63619e+06,216,226,2658,1.13498e+06,449
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 96 transition count 102
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 96 transition count 102
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 89 transition count 95
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 89 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 88 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 88 transition count 90
Applied a total of 51 rules in 8 ms. Remains 88 /112 variables (removed 24) and now considering 90/117 (removed 27) transitions.
// Phase 1: matrix 90 rows 88 cols
[2024-05-23 23:39:27] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 23:39:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 23:39:27] [INFO ] Invariant cache hit.
[2024-05-23 23:39:27] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-23 23:39:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1522 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1629 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 3159ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 3162ms
Starting structural reductions in LTL mode, iteration 1 : 88/112 places, 90/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3287 ms. Remains : 88/112 places, 90/117 transitions.
[2024-05-23 23:39:31] [INFO ] Flatten gal took : 5 ms
[2024-05-23 23:39:31] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:31] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-23 23:39:31] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:31] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15165805158130158069.gal : 1 ms
[2024-05-23 23:39:31] [INFO ] Time to serialize properties into /tmp/CTLFireability86068291467996071.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/CTLFireability15165805158130158069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability86068291467996071.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.65806e+06,0.110936,8904,2,2142,5,23075,6,0,444,24685,0


Converting to forward existential form...Done !
original formula: AX(EF(EG(AX((p89==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG(!(EX(!((p89==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t21, t22, t27, t34, t41, t48, t55, t62, t68, t75, t80, Intersection wit...236
Using saturation style SCC detection
(forward)formula 0,1,1.35838,56080,1,0,237,280456,210,113,2724,252456,276
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 98 transition count 104
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 92 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 92 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 92 transition count 94
Applied a total of 43 rules in 4 ms. Remains 92 /112 variables (removed 20) and now considering 94/117 (removed 23) transitions.
// Phase 1: matrix 94 rows 92 cols
[2024-05-23 23:39:32] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:39:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 23:39:32] [INFO ] Invariant cache hit.
[2024-05-23 23:39:32] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-23 23:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/185 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/186 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 97 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1626 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/185 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 93/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 190 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1633 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 3269ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 3270ms
Starting structural reductions in LTL mode, iteration 1 : 92/112 places, 94/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3361 ms. Remains : 92/112 places, 94/117 transitions.
[2024-05-23 23:39:35] [INFO ] Flatten gal took : 8 ms
[2024-05-23 23:39:35] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:35] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-23 23:39:35] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:35] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15749550344911583798.gal : 1 ms
[2024-05-23 23:39:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7311716926286945242.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/CTLFireability15749550344911583798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7311716926286945242.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX((!(A((p19==1) U ((p75==1)||(p80==1)))) * AX(((AF((p101==1)) + (p56==1)) + (((p46==1)&&(p93==1))&&(p108==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(!((E(!(((p75==1)||(p80==1))) U (!((p19==1)) * !(((p75==1)||(p80==1))))) + EG(!(((p75==1)||(p80==...258
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t22, t23, t26, t31, t39, t45, t52, t59, t66, t72, t79, t84, Inters...246
(forward)formula 0,0,7.36471,258080,1,0,1096,1.71376e+06,223,513,2585,1.54556e+06,1230
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 100 transition count 106
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 100 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 95 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 95 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 95 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 94 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 94 transition count 97
Applied a total of 38 rules in 5 ms. Remains 94 /112 variables (removed 18) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 94 cols
[2024-05-23 23:39:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:39:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-23 23:39:43] [INFO ] Invariant cache hit.
[2024-05-23 23:39:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-23 23:39:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 99 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1718 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 96/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 195 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1799 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 3527ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 3530ms
Starting structural reductions in LTL mode, iteration 1 : 94/112 places, 97/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3623 ms. Remains : 94/112 places, 97/117 transitions.
[2024-05-23 23:39:46] [INFO ] Flatten gal took : 6 ms
[2024-05-23 23:39:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:46] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-23 23:39:46] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:46] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13477761565759360823.gal : 1 ms
[2024-05-23 23:39:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12497812337253259478.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/CTLFireability13477761565759360823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12497812337253259478.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,3.57801e+06,0.108365,8668,2,2100,5,21944,6,0,475,23748,0


Converting to forward existential form...Done !
original formula: EF((AX(E((((p64==1)&&(p93==1))&&(p108==1)) U AX((p74==1)))) * ((EF((p103==1)) + EG((p97==1))) + (!(E(A((p89==1) U (p66==1)) U EF((((p64==...230
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(EX(!(E((((p64==1)&&(p93==1))&&(p108==1)) U !(EX(!((p74==1))))))))),TRUE) * (p103==...672
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t10, t15, t25, t26, t31, t41, t48, t55, t62, t69, t75, t82, t87, Intersection with r...233
(forward)formula 0,1,0.826211,37984,1,0,322,186142,217,178,2705,166652,360
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 97 transition count 103
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 97 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 90 transition count 96
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 90 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 89 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 89 transition count 91
Applied a total of 49 rules in 6 ms. Remains 89 /112 variables (removed 23) and now considering 91/117 (removed 26) transitions.
// Phase 1: matrix 91 rows 89 cols
[2024-05-23 23:39:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 23:39:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 23:39:47] [INFO ] Invariant cache hit.
[2024-05-23 23:39:47] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-23 23:39:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/180 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 94 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1545 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 90/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 184 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1609 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 3169ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 3171ms
Starting structural reductions in LTL mode, iteration 1 : 89/112 places, 91/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3260 ms. Remains : 89/112 places, 91/117 transitions.
[2024-05-23 23:39:50] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:39:50] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:51] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-23 23:39:51] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:51] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6860768342863395317.gal : 1 ms
[2024-05-23 23:39:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8195455582671026706.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/CTLFireability6860768342863395317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8195455582671026706.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,2.69483e+06,0.11335,8908,2,2216,5,22956,6,0,449,24440,0


Converting to forward existential form...Done !
original formula: AX(EX(AX((EX((p83==1)) + AF((p111==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EX(!((EX((p83==1)) + !(EG(!((p111==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t22, t24, t28, t35, t42, t49, t56, t63, t69, t76, t81, Intersection wit...236
(forward)formula 0,1,4.90024,179896,1,0,654,1.12453e+06,206,305,2485,1.0589e+06,728
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 99 transition count 105
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 99 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 95 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 95 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 95 transition count 99
Applied a total of 35 rules in 1 ms. Remains 95 /112 variables (removed 17) and now considering 99/117 (removed 18) transitions.
// Phase 1: matrix 99 rows 95 cols
[2024-05-23 23:39:55] [INFO ] Computed 5 invariants in 2 ms
[2024-05-23 23:39:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 23:39:56] [INFO ] Invariant cache hit.
[2024-05-23 23:39:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-23 23:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/193 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 100 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1791 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/193 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 98/197 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 1/194 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 198 constraints, problems are : Problem set: 0 solved, 98 unsolved in 1751 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 3551ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 3553ms
Starting structural reductions in LTL mode, iteration 1 : 95/112 places, 99/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3657 ms. Remains : 95/112 places, 99/117 transitions.
[2024-05-23 23:39:59] [INFO ] Flatten gal took : 4 ms
[2024-05-23 23:39:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:59] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-23 23:39:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 23:39:59] [INFO ] Flatten gal took : 2 ms
[2024-05-23 23:39:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15871169768233590731.gal : 0 ms
[2024-05-23 23:39:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17529898705296083805.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/CTLFireability15871169768233590731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17529898705296083805.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,3.58628e+06,0.123975,9468,2,2309,5,24428,6,0,481,26820,0


Converting to forward existential form...Done !
original formula: A(A((!(AG((p30!=1))) * (p33==1)) U !((((AG((p26==1)) + A((p17==1) U (p76==1))) + ((p13==1)&&(p53==1))) * AX(((p72==1)||(p88==1)))))) U (!...194
=> equivalent forward existential formula: [((Init * !(EG(!((!(((p23==1)&&(p42==1))) * E(TRUE U (p81==1))))))) * !(E(!((!(((p23==1)&&(p42==1))) * E(TRUE U ...791
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t22, t24, t29, t36, t43, t53, t61, t69, t74, t84, t89, Intersectio...241
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,11.0093,375528,1,0,1185,2.57374e+06,250,661,2971,2.14958e+06,1280
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-23 23:40:10] [INFO ] Flatten gal took : 7 ms
[2024-05-23 23:40:10] [INFO ] Flatten gal took : 2 ms
Total runtime 156472 ms.

BK_STOP 1716507610812

--------------------
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-04b"
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-04b, 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-171640603500474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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