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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 08:54 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 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0010N0000000100-CTLCardinality-2024-00
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-01
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-02
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-03
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-04
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-05
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-06
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-07
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-08
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-09
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-10
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-11
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-12
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-13
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-14
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716497401140

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0010N0000000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-23 20:50:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:50:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:50:02] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-23 20:50:02] [INFO ] Transformed 33 places.
[2024-05-23 20:50:02] [INFO ] Transformed 22 transitions.
[2024-05-23 20:50:02] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-23 20:50:02] [INFO ] Computed 12 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 1 solved, 20 unsolved in 2458 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 2921ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 2931ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-23 20:50:05] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 20:50:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-23 20:50:05] [INFO ] Invariant cache hit.
[2024-05-23 20:50:05] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 21/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3086 ms. Remains : 33/33 places, 21/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-23 20:50:05] [INFO ] Flatten gal took : 18 ms
[2024-05-23 20:50:05] [INFO ] Flatten gal took : 5 ms
[2024-05-23 20:50:05] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40054 steps (95 resets) in 1376 ms. (29 steps per ms) remains 58/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
[2024-05-23 20:50:06] [INFO ] Invariant cache hit.
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 25 solved, 31 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/10 constraints. Problems are: Problem set: 28 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 28 solved, 28 unsolved
Problem AtomicPropp67 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/11 constraints. Problems are: Problem set: 29 solved, 27 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/13 constraints. Problems are: Problem set: 51 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 51 solved, 5 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 53 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 53 solved, 3 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 5/5 constraints. Problems are: Problem set: 53 solved, 3 unsolved
[2024-05-23 20:50:06] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 53 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp35 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 28/54 variables, and 11 constraints, problems are : Problem set: 55 solved, 1 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 5/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/56 constraints, Known Traps: 1/1 constraints]
After SMT, in 1303ms problems are : Problem set: 55 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 78 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 31 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 29 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 26 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 24 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 23 transition count 13
Applied a total of 15 rules in 29 ms. Remains 23 /33 variables (removed 10) and now considering 13/21 (removed 8) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 23 cols
[2024-05-23 20:50:08] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 45 constraints, problems are : Problem set: 0 solved, 12 unsolved in 6825 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 6954ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 6954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6983 ms. Remains : 23/33 places, 13/21 transitions.
RANDOM walk for 40017 steps (220 resets) in 356 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (59 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3324227 steps, run timeout after 3001 ms. (steps per millisecond=1107 ) properties seen :0 out of 1
Probabilistic random walk after 3324227 steps, saw 522508 distinct states, run finished after 3006 ms. (steps per millisecond=1105 ) properties seen :0
[2024-05-23 20:50:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 33 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 20:50:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 1 solved, 0 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 154ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 56 atomic propositions for a total of 16 simplifications.
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 20:50:18] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2024-05-23 20:50:18] [INFO ] Flatten gal took : 9 ms
[2024-05-23 20:50:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 20:50:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 20:50:18] [INFO ] Input system was already deterministic with 21 transitions.
Support contains 16 out of 33 places (down from 24) after GAL structural reductions.
Computed a total of 31 stabilizing places and 19 stable transitions
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 29 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 26 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 24 transition count 15
Applied a total of 14 rules in 7 ms. Remains 24 /33 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-23 20:50:18] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 20:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 49 constraints, problems are : Problem set: 0 solved, 14 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 486ms
[2024-05-23 20:50:18] [INFO ] Invariant cache hit.
[2024-05-23 20:50:18] [INFO ] Implicit Places using invariants in 52 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/33 places, 15/21 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 14
Applied a total of 2 rules in 3 ms. Remains 22 /23 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-23 20:50:18] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 20:50:18] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 20:50:18] [INFO ] Invariant cache hit.
[2024-05-23 20:50:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:50:19] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [1, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 105 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 20/33 places, 14/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 657 ms. Remains : 20/33 places, 14/21 transitions.
[2024-05-23 20:50:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:50:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:50:19] [INFO ] Input system was already deterministic with 14 transitions.
[2024-05-23 20:50:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:50:19] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:50:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10249365048372487005.gal : 1 ms
[2024-05-23 20:50:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality13723299511857834167.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/CTLCardinality10249365048372487005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13723299511857834167.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.36543e+06,0.416751,16288,2,14983,5,76012,6,0,97,73280,0


Converting to forward existential form...Done !
original formula: AG(AF((ADP>=55)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((ADP>=55)))] = FALSE
Hit Full ! (commute/partial/dont) 9/0/5
(forward)formula 0,1,2.28776,57720,1,0,127,282246,20,2,1021,237518,128
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-23 20:50:21] [INFO ] Computed 13 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1255ms
[2024-05-23 20:50:22] [INFO ] Invariant cache hit.
[2024-05-23 20:50:22] [INFO ] Implicit Places using invariants in 40 ms returned [1, 2, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1298 ms. Remains : 30/33 places, 21/21 transitions.
[2024-05-23 20:50:22] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:50:22] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:50:22] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-23 20:50:22] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:50:22] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:50:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality17295607557951134602.gal : 1 ms
[2024-05-23 20:50:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12488613151962279069.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/CTLCardinality17295607557951134602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12488613151962279069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 29 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 28 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 25 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 23 transition count 14
Applied a total of 14 rules in 4 ms. Remains 23 /33 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-23 20:51:22] [INFO ] Computed 10 invariants in 0 ms
[2024-05-23 20:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6487 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6666ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 6668ms
[2024-05-23 20:51:29] [INFO ] Invariant cache hit.
[2024-05-23 20:51:29] [INFO ] Implicit Places using invariants in 36 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/33 places, 14/21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 16 transition count 11
Applied a total of 7 rules in 2 ms. Remains 16 /20 variables (removed 4) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-23 20:51:29] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 20:51:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 20:51:29] [INFO ] Invariant cache hit.
[2024-05-23 20:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:51:29] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 81 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 15/33 places, 11/21 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 9
Applied a total of 2 rules in 7 ms. Remains 13 /15 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-23 20:51:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 20:51:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 20:51:29] [INFO ] Invariant cache hit.
[2024-05-23 20:51:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 20:51:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 13/33 places, 9/21 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 6857 ms. Remains : 13/33 places, 9/21 transitions.
[2024-05-23 20:51:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:29] [INFO ] Input system was already deterministic with 9 transitions.
[2024-05-23 20:51:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14631398097034316667.gal : 1 ms
[2024-05-23 20:51:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6072340500167059421.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/CTLCardinality14631398097034316667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6072340500167059421.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,14986,0.026265,4476,2,2597,5,6821,6,0,65,4851,0


Converting to forward existential form...Done !
original formula: EF(AG((b2>c1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((b2>c1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.093331,7116,1,0,32,14432,39,14,716,9345,27
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 11 ms. Remains 25 /33 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-23 20:51:29] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/41 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/41 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1757ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1757ms
[2024-05-23 20:51:31] [INFO ] Invariant cache hit.
[2024-05-23 20:51:31] [INFO ] Implicit Places using invariants in 37 ms returned [0, 3, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 22/33 places, 16/21 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 14
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 20 cols
[2024-05-23 20:51:31] [INFO ] Computed 7 invariants in 0 ms
[2024-05-23 20:51:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 20:51:31] [INFO ] Invariant cache hit.
[2024-05-23 20:51:31] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 73 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/33 places, 14/21 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 12
Applied a total of 2 rules in 3 ms. Remains 16 /18 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 16 cols
[2024-05-23 20:51:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 20:51:31] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 20:51:31] [INFO ] Invariant cache hit.
[2024-05-23 20:51:31] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 16/33 places, 12/21 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1958 ms. Remains : 16/33 places, 12/21 transitions.
[2024-05-23 20:51:31] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:51:31] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:51:31] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-23 20:51:31] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:31] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality14408181011776909618.gal : 1 ms
[2024-05-23 20:51:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality2927358008753797755.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/CTLCardinality14408181011776909618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2927358008753797755.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,381979,0.039223,5024,2,2796,5,9892,6,0,77,8103,0


Converting to forward existential form...Done !
original formula: AF((AF(EG((GAP<=_1_3_BPG))) * ((b1<=a2)||(Ru5P>172))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(EG((GAP<=_1_3_BPG))))) * ((b1<=a2)||(Ru5P>172)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...172
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.98226,93072,1,0,1434,472486,57,713,884,644629,1432
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-11 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 : 33/33 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-23 20:51:34] [INFO ] Computed 13 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1241ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1242ms
[2024-05-23 20:51:36] [INFO ] Invariant cache hit.
[2024-05-23 20:51:36] [INFO ] Implicit Places using invariants in 83 ms returned [1, 2, 3, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1330 ms. Remains : 29/33 places, 21/21 transitions.
[2024-05-23 20:51:36] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:51:36] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:51:36] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-23 20:51:36] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:36] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:51:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1327593768063350749.gal : 0 ms
[2024-05-23 20:51:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality13295264782259179621.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/CTLCardinality1327593768063350749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13295264782259179621.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX((gu10.c2<=gu10.Lac))
=> equivalent forward existential formula: [(EY(Init) * (gu10.c2<=gu10.Lac))] != FALSE
(forward)formula 0,1,6.45872,142444,1,0,7,805289,8,1,197,744462,2
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 29 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 28 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 25 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 23 transition count 14
Applied a total of 14 rules in 4 ms. Remains 23 /33 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-23 20:52:12] [INFO ] Computed 10 invariants in 1 ms
[2024-05-23 20:52:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6506 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6672ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 6673ms
[2024-05-23 20:52:19] [INFO ] Invariant cache hit.
[2024-05-23 20:52:19] [INFO ] Implicit Places using invariants in 38 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/33 places, 14/21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 16 transition count 11
Applied a total of 7 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-23 20:52:19] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 20:52:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 20:52:19] [INFO ] Invariant cache hit.
[2024-05-23 20:52:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:52:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 55 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 15/33 places, 11/21 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 9
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-23 20:52:19] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 20:52:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 20:52:19] [INFO ] Invariant cache hit.
[2024-05-23 20:52:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 20:52:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 13/33 places, 9/21 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 6833 ms. Remains : 13/33 places, 9/21 transitions.
[2024-05-23 20:52:19] [INFO ] Flatten gal took : 13 ms
[2024-05-23 20:52:19] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:52:19] [INFO ] Input system was already deterministic with 9 transitions.
[2024-05-23 20:52:19] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:52:19] [INFO ] Flatten gal took : 0 ms
[2024-05-23 20:52:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10350383665431350996.gal : 1 ms
[2024-05-23 20:52:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14419239815662553867.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/CTLCardinality10350383665431350996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14419239815662553867.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,14986,0.027387,4476,2,2597,5,6821,6,0,65,4851,0


Converting to forward existential form...Done !
original formula: !(E(EG(EF((Xu5P<=c1))) U (b1<=a1)))
=> equivalent forward existential formula: [(FwdU(Init,EG(E(TRUE U (Xu5P<=c1)))) * (b1<=a1))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.252069,12660,1,0,358,42008,51,253,794,53629,419
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-23 20:52:19] [INFO ] Flatten gal took : 1 ms
[2024-05-23 20:52:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:52:19] [INFO ] Applying decomposition
[2024-05-23 20:52:19] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14017666277548499301.txt' '-o' '/tmp/graph14017666277548499301.bin' '-w' '/tmp/graph14017666277548499301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14017666277548499301.bin' '-l' '-1' '-v' '-w' '/tmp/graph14017666277548499301.weights' '-q' '0' '-e' '0.001'
[2024-05-23 20:52:19] [INFO ] Decomposing Gal with order
[2024-05-23 20:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 20:52:19] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-23 20:52:19] [INFO ] Flatten gal took : 2 ms
[2024-05-23 20:52:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 20:52:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15366648892584240071.gal : 1 ms
[2024-05-23 20:52:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5571078283197905660.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/CTLCardinality15366648892584240071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5571078283197905660.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,1.76895e+11,181.381,2292012,2,2.02086e+06,5,1.30041e+07,6,0,153,1.30079e+07,0


Converting to forward existential form...Done !
original formula: AG(AX(((gu6.start<=gu6._3PG)||((gu7.S7P>gu7.Lac)&&((gi0.gi1.gu0.NADH<=241)||(gi0.gi1.gu9.Ru5P>=148))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((gu6.start<=gu6._3PG)||((gu7.S7P>gu7.Lac)&&((gi0.gi1.gu0.NADH<=241)||(gi0.gi1.gu9.Ru5...176
(forward)formula 0,1,240.212,2415480,1,0,6,1.38716e+07,9,2,1086,1.30079e+07,2
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 378847 ms.

BK_STOP 1716497781188

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0010N0000000100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640603300385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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