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.r576-smll-171734919800025.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 MedleyA-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 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 MedleyA-PT-04-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717352597252

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:23:19] [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-06-02 18:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:23:20] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-02 18:23:20] [INFO ] Transformed 115 places.
[2024-06-02 18:23:20] [INFO ] Transformed 107 transitions.
[2024-06-02 18:23:20] [INFO ] Found NUPN structural information;
[2024-06-02 18:23:20] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 109 transition count 102
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 109 transition count 102
Applied a total of 11 rules in 75 ms. Remains 109 /115 variables (removed 6) and now considering 102/107 (removed 5) transitions.
// Phase 1: matrix 102 rows 109 cols
[2024-06-02 18:23:20] [INFO ] Computed 8 invariants in 22 ms
[2024-06-02 18:23:20] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-02 18:23:20] [INFO ] Invariant cache hit.
[2024-06-02 18:23:21] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-02 18:23:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 32 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 3 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 3 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:23:22] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:23:23] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 102/211 variables, 109/136 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 3 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:28] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/211 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 146 constraints, problems are : Problem set: 0 solved, 101 unsolved in 10163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/211 variables, 109/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 101/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/211 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:41] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/211 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/211 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 254 constraints, problems are : Problem set: 0 solved, 101 unsolved in 24186 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 36/36 constraints]
After SMT, in 34528ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 34555ms
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 102/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35379 ms. Remains : 109/115 places, 102/107 transitions.
Support contains 55 out of 109 places after structural reductions.
[2024-06-02 18:23:55] [INFO ] Flatten gal took : 49 ms
[2024-06-02 18:23:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA MedleyA-PT-04-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:23:55] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:23:56] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 41 out of 109 places (down from 55) after GAL structural reductions.
FORMULA MedleyA-PT-04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1131 resets) in 2924 ms. (13 steps per ms) remains 6/36 properties
BEST_FIRST walk for 40001 steps (303 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (291 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (295 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (298 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (332 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (267 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
[2024-06-02 18:23:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 31/89 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 102/191 variables, 89/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 18:23:57] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:23:57] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:23:57] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 8 (OVERLAPS) 20/211 variables, 20/120 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 120 constraints, problems are : Problem set: 1 solved, 5 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 38/45 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 18:23:57] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 42/87 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 18:23:57] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 102/189 variables, 87/100 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 22/211 variables, 22/123 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 4/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 18:23:58] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/211 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 128 constraints, problems are : Problem set: 1 solved, 5 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 1148ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2192 ms.
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 102/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 109 transition count 83
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 90 transition count 83
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 38 place count 90 transition count 75
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 82 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 77 transition count 70
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 77 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 77 transition count 69
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 76 transition count 69
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 102 place count 58 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 58 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 57 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 55 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 54 transition count 48
Applied a total of 108 rules in 49 ms. Remains 54 /109 variables (removed 55) and now considering 48/102 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 54/109 places, 48/102 transitions.
RANDOM walk for 40000 steps (3540 resets) in 318 ms. (125 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (1353 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1375 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1383 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1209 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
// Phase 1: matrix 48 rows 54 cols
[2024-06-02 18:24:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:24:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/34 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 38/72 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/74 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 27/101 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/101 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/101 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/102 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 62 constraints, problems are : Problem set: 0 solved, 4 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:24:01] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/34 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 38/72 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/74 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/74 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/74 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 27/101 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/101 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:24:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/101 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/101 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/102 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/102 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:24:01] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/102 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/102 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/102 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 69 constraints, problems are : Problem set: 0 solved, 4 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 489ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 687 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 48/48 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 54/54 places, 48/48 transitions.
RANDOM walk for 40000 steps (3562 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1367 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1349 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1353 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1240 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2039 steps, run visited all 4 properties in 35 ms. (steps per millisecond=58 )
Probabilistic random walk after 2039 steps, saw 968 distinct states, run finished after 41 ms. (steps per millisecond=49 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-06-02 18:24:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:24:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:24:02] [INFO ] Input system was already deterministic with 102 transitions.
Computed a total of 109 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA MedleyA-PT-04-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 92
Applied a total of 20 rules in 16 ms. Remains 99 /109 variables (removed 10) and now considering 92/102 (removed 10) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:24:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:24:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:24:02] [INFO ] Invariant cache hit.
[2024-06-02 18:24:02] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:24:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:03] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:24:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:24:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:24:03] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:24:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:24:04] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:24:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:24:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:04] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:24:05] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:24:05] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:24:05] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 119 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4595 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/210 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:09] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:11] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:14] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 213 constraints, problems are : Problem set: 0 solved, 91 unsolved in 15351 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 15/15 constraints]
After SMT, in 19994ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 19997ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20268 ms. Remains : 99/109 places, 92/102 transitions.
[2024-06-02 18:24:22] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:22] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:22] [INFO ] Input system was already deterministic with 92 transitions.
[2024-06-02 18:24:22] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:24:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality4504804605510599514.gal : 5 ms
[2024-06-02 18:24:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15381235634478933472.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4504804605510599514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15381235634478933472.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,4.15299e+07,0.058855,4692,2,1679,5,5593,6,0,490,4567,0


Converting to forward existential form...Done !
original formula: EF((EX(((EX((p45==0)) + (p6==0)) + ((p16==1)||((p34==0)&&(p111==1))))) * EG((p8==0))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * EX(((EX((p45==0)) + (p6==0)) + ((p16==1)||((p34==0)&&(p111==1)))))),(p8==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t21, t26, t28, t33, t35, t40, t42, t48, t51, t52, t78, Intersecti...242
Hit Full ! (commute/partial/dont) 90/0/2
(forward)formula 0,1,2.26604,64508,1,0,1209,319859,211,96,3049,319758,1201
FORMULA MedleyA-PT-04-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 108 transition count 82
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 89 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 38 place count 89 transition count 74
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 81 transition count 74
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 76 transition count 69
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 76 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 76 transition count 68
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 66 place count 75 transition count 68
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 94 place count 61 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 60 transition count 53
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 97 place count 59 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 58 transition count 52
Applied a total of 98 rules in 26 ms. Remains 58 /109 variables (removed 51) and now considering 52/102 (removed 50) transitions.
// Phase 1: matrix 52 rows 58 cols
[2024-06-02 18:24:25] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:24:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:24:25] [INFO ] Invariant cache hit.
[2024-06-02 18:24:25] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 18:24:25] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 18:24:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:24:25] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:24:25] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:24:25] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:24:25] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:24:25] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:24:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 71 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/109 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 51/121 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:24:28] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 123 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2810 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 7/7 constraints]
After SMT, in 4564ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 4566ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/109 places, 52/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4811 ms. Remains : 58/109 places, 52/102 transitions.
[2024-06-02 18:24:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:24:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:24:30] [INFO ] Input system was already deterministic with 52 transitions.
[2024-06-02 18:24:30] [INFO ] Flatten gal took : 18 ms
RANDOM walk for 17965 steps (2695 resets) in 83 ms. (213 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-04-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 18:24:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:24:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9988351968417736601.gal : 4 ms
[2024-06-02 18:24:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6389516312082335238.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9988351968417736601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6389516312082335238.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 108 transition count 84
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 91 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 34 place count 91 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 85 transition count 78
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 81 transition count 74
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 81 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 54 place count 81 transition count 73
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 56 place count 80 transition count 73
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 86 place count 65 transition count 58
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 65 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 64 transition count 57
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 90 place count 63 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 62 transition count 56
Applied a total of 91 rules in 27 ms. Remains 62 /109 variables (removed 47) and now considering 56/102 (removed 46) transitions.
// Phase 1: matrix 56 rows 62 cols
[2024-06-02 18:24:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:24:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 18:24:30] [INFO ] Invariant cache hit.
[2024-06-02 18:24:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-02 18:24:30] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-06-02 18:24:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 18:24:30] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:24:30] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:24:30] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-02 18:24:30] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:24:30] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:24:30] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 56/117 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 1/118 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 75 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 56/117 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 55/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 130 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2733 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 6/6 constraints]
After SMT, in 4516ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4517ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/109 places, 56/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4721 ms. Remains : 62/109 places, 56/102 transitions.
[2024-06-02 18:24:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:24:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:34] [INFO ] Input system was already deterministic with 56 transitions.
[2024-06-02 18:24:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality4776585135308819461.gal : 2 ms
[2024-06-02 18:24:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6024348594147003056.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/CTLCardinality4776585135308819461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6024348594147003056.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,673742,0.040067,4096,2,669,5,2963,6,0,306,2286,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p109==0)||(p66==1))) * AG(((p68!=0)&&(p104!=1)))) * (!(A((p38==1) U (p57==1))) + (p36!=1))))
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * (!(EG(!(((p109==0)||(p66==1))))) * !(E(TRUE U !(((p68!=0)&&(p104!=1))))))),!((p57==1...446
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t8, t11, t15, t51, t52, Intersection with reachable at each step enabled...204
(forward)formula 0,0,0.742179,20248,1,0,688,93656,155,63,1974,82132,679
FORMULA MedleyA-PT-04-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 92
Applied a total of 20 rules in 5 ms. Remains 99 /109 variables (removed 10) and now considering 92/102 (removed 10) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:24:35] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:24:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:24:35] [INFO ] Invariant cache hit.
[2024-06-02 18:24:35] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:24:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:36] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:24:36] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:24:36] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:24:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:24:37] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 3 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:24:41] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:24:41] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 130 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7670 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/130 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 221 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6976 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 23/23 constraints]
After SMT, in 14696ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 14697ms
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 92/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14955 ms. Remains : 99/109 places, 92/102 transitions.
[2024-06-02 18:24:50] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:24:50] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:24:50] [INFO ] Input system was already deterministic with 92 transitions.
[2024-06-02 18:24:50] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:24:50] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:24:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality4676030144000979901.gal : 2 ms
[2024-06-02 18:24:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality8258166414572414470.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/CTLCardinality4676030144000979901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8258166414572414470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.16799e+07,0.045943,4772,2,1668,5,5530,6,0,490,4464,0


Converting to forward existential form...Done !
original formula: EG(E(EF(EX(((p54==0)||(p5==1)))) U AF((p95==0))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U EX(((p54==0)||(p5==1)))) U !(EG(!((p95==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t14, t19, t22, t25, t27, t29, t34, t36, t41, t43, t48, t51, t78, t86, Inter...247
(forward)formula 0,1,7.11409,203768,1,0,3718,1.09408e+06,218,2150,3015,1.47472e+06,3369
FORMULA MedleyA-PT-04-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 108 transition count 82
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 89 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 38 place count 89 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 82 transition count 75
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 77 transition count 70
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 77 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 62 place count 77 transition count 69
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 64 place count 76 transition count 69
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 90 place count 63 transition count 56
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 62 transition count 55
Applied a total of 92 rules in 29 ms. Remains 62 /109 variables (removed 47) and now considering 55/102 (removed 47) transitions.
// Phase 1: matrix 55 rows 62 cols
[2024-06-02 18:24:57] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:24:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:24:57] [INFO ] Invariant cache hit.
[2024-06-02 18:24:58] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 18:24:58] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 18:24:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:24:58] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
[2024-06-02 18:24:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:24:58] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:24:59] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:24:59] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:24:59] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 55/116 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 1/117 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 76 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2255 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 55/116 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 53/128 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 1/117 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 129 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 6/6 constraints]
After SMT, in 5340ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 5342ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/109 places, 55/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5640 ms. Remains : 62/109 places, 55/102 transitions.
[2024-06-02 18:25:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:25:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:25:03] [INFO ] Input system was already deterministic with 55 transitions.
[2024-06-02 18:25:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:03] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11022384115179403940.gal : 2 ms
[2024-06-02 18:25:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17386632121755050393.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/CTLCardinality11022384115179403940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17386632121755050393.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,856118,0.042451,4096,2,832,5,3250,6,0,305,2647,0


Converting to forward existential form...Done !
original formula: AF((EG((p23==0)) * ((p40==0)||(p87==1))))
=> equivalent forward existential formula: [FwdG(Init,!((EG((p23==0)) * ((p40==0)||(p87==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t7, t9, t13, t49, t50, Intersection with reachable at each step enabled. (de...198
(forward)formula 0,1,1.37057,40912,1,0,776,231411,135,112,1931,253399,764
FORMULA MedleyA-PT-04-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 102 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 102 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 94
Applied a total of 16 rules in 21 ms. Remains 101 /109 variables (removed 8) and now considering 94/102 (removed 8) transitions.
// Phase 1: matrix 94 rows 101 cols
[2024-06-02 18:25:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:05] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 18:25:05] [INFO ] Invariant cache hit.
[2024-06-02 18:25:05] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-06-02 18:25:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:25:06] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:25:07] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:25:07] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:25:07] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/195 variables, 101/119 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5826 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 94/195 variables, 101/129 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 93/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 18:25:12] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 18:25:15] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:25:15] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 18:25:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 226 constraints, problems are : Problem set: 0 solved, 93 unsolved in 14637 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 24/24 constraints]
After SMT, in 20497ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 20500ms
Starting structural reductions in LTL mode, iteration 1 : 101/109 places, 94/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20889 ms. Remains : 101/109 places, 94/102 transitions.
[2024-06-02 18:25:25] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:25] [INFO ] Input system was already deterministic with 94 transitions.
[2024-06-02 18:25:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:25:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17890292348542004845.gal : 5 ms
[2024-06-02 18:25:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17353055065070776846.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17890292348542004845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17353055065070776846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.16831e+07,0.046772,4780,2,1657,5,5440,6,0,500,4435,0


Converting to forward existential form...Done !
original formula: !(A(A(!(E(AG((p56==0)) U EX(TRUE))) U ((EX((p44==0)) + (p61!=1)) * !(E((p77==1) U (p26==1))))) U !(((EX(E((p68==1) U ((p36==0)||(p102==1)...255
=> equivalent forward existential formula: ((([(FwdU(EY((FwdU(Init,!(!(((EX(E((p68==1) U ((p36==0)||(p102==1)))) + (p66==1)) + (E(TRUE U EX(TRUE)) + E(E(TR...2089
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t13, t15, t16, t20, t23, t26, t28, t30, t35, t37, t42, t45, t48, t50, t53, t80, ...252
Hit Full ! (commute/partial/dont) 92/0/2
(forward)formula 0,1,6.21901,177352,1,0,1528,1.06794e+06,240,268,3286,1.22638e+06,1554
FORMULA MedleyA-PT-04-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 108 transition count 84
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 91 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 91 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 86 transition count 79
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 83 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 83 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 83 transition count 75
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 52 place count 82 transition count 75
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 84 place count 66 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 65 transition count 58
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 87 place count 64 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 63 transition count 57
Applied a total of 88 rules in 17 ms. Remains 63 /109 variables (removed 46) and now considering 57/102 (removed 45) transitions.
// Phase 1: matrix 57 rows 63 cols
[2024-06-02 18:25:32] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:25:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 18:25:32] [INFO ] Invariant cache hit.
[2024-06-02 18:25:32] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 18:25:32] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-06-02 18:25:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 18:25:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:25:32] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-02 18:25:32] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 18:25:33] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:25:33] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 57/119 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 75 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 57/119 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 55/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 1/120 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 130 constraints, problems are : Problem set: 0 solved, 55 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 5/5 constraints]
After SMT, in 5760ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 5761ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/109 places, 57/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5970 ms. Remains : 63/109 places, 57/102 transitions.
[2024-06-02 18:25:38] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:25:38] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:38] [INFO ] Input system was already deterministic with 57 transitions.
[2024-06-02 18:25:38] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:38] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality2859888192535455673.gal : 2 ms
[2024-06-02 18:25:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality12100021593182185477.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/CTLCardinality2859888192535455673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12100021593182185477.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,910267,0.033344,4100,2,641,5,2895,6,0,311,2190,0


Converting to forward existential form...Done !
original formula: EF(((p13==1) * (EF(((p40==0)||(p102==1))) + (EF(((p44==0)||(p14==1))) * AF((p24==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (p13==1)),TRUE) * ((p40==0)||(p102==1)))] != FALSE + [(((FwdU(Init,TRUE) * (p13==1)) ...221
(forward)formula 0,1,0.047951,4364,1,0,10,4322,10,2,585,2977,4
FORMULA MedleyA-PT-04-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 91
Applied a total of 22 rules in 3 ms. Remains 98 /109 variables (removed 11) and now considering 91/102 (removed 11) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:25:38] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:25:38] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 18:25:38] [INFO ] Invariant cache hit.
[2024-06-02 18:25:38] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:25:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
[2024-06-02 18:25:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:42] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6477 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:46] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:48] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 13502 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 20011ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 20013ms
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 91/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20311 ms. Remains : 98/109 places, 91/102 transitions.
[2024-06-02 18:25:58] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:25:58] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:25:58] [INFO ] Input system was already deterministic with 91 transitions.
[2024-06-02 18:25:58] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:25:58] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:25:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality278310063651378807.gal : 2 ms
[2024-06-02 18:25:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8941367905543882281.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/CTLCardinality278310063651378807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8941367905543882281.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15274e+07,0.072023,4764,2,1685,5,5606,6,0,485,4533,0


Converting to forward existential form...Done !
original formula: AX(AG(((p61==1) + (!(E((p20==1) U (p111==1))) * AG((p28==0))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),TRUE) * !((p61==1))),(p20==1)) * (p111==1))] = FALSE * [(FwdU((FwdU(EY(Init),TRUE) * !((p...194
(forward)formula 0,0,0.158241,5820,1,0,13,11828,12,4,973,13430,7
FORMULA MedleyA-PT-04-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:25:58] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:25:58] [INFO ] Flatten gal took : 8 ms
Total runtime 158997 ms.

BK_STOP 1717352758819

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r576-smll-171734919800025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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