Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640602500026.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 FlexibleBarrier-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2023-12
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2023-13
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2023-14
FORMULA_NAME FlexibleBarrier-PT-06b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716416102142

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 22:15:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:15:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:15:03] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-22 22:15:03] [INFO ] Transformed 542 places.
[2024-05-22 22:15:03] [INFO ] Transformed 621 transitions.
[2024-05-22 22:15:03] [INFO ] Found NUPN structural information;
[2024-05-22 22:15:03] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 96 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 142 places :
Symmetric choice reduction at 0 with 142 rule applications. Total rules 142 place count 400 transition count 479
Iterating global reduction 0 with 142 rules applied. Total rules applied 284 place count 400 transition count 479
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 333 place count 351 transition count 430
Iterating global reduction 0 with 49 rules applied. Total rules applied 382 place count 351 transition count 430
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 402 place count 331 transition count 410
Iterating global reduction 0 with 20 rules applied. Total rules applied 422 place count 331 transition count 410
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 427 place count 331 transition count 405
Applied a total of 427 rules in 97 ms. Remains 331 /542 variables (removed 211) and now considering 405/621 (removed 216) transitions.
// Phase 1: matrix 405 rows 331 cols
[2024-05-22 22:15:03] [INFO ] Computed 8 invariants in 24 ms
[2024-05-22 22:15:03] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-22 22:15:03] [INFO ] Invariant cache hit.
[2024-05-22 22:15:04] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-22 22:15:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:09] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:12] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 2 ms to minimize.
[2024-05-22 22:15:12] [INFO ] Deduced a trap composed of 174 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:15:12] [INFO ] Deduced a trap composed of 194 places in 110 ms of which 3 ms to minimize.
[2024-05-22 22:15:14] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 7 ms to minimize.
[2024-05-22 22:15:14] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:17] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:15:17] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 3 ms to minimize.
[2024-05-22 22:15:17] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:15:17] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:15:18] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:15:18] [INFO ] Deduced a trap composed of 90 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:15:19] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:15:19] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:20] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:23] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:15:23] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2024-05-22 22:15:24] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-22 22:15:24] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 1 ms to minimize.
[2024-05-22 22:15:24] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (OVERLAPS) 405/736 variables, 331/359 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:33] [INFO ] Deduced a trap composed of 219 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 736/736 variables, and 360 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 405/736 variables, 331/360 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 404/764 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:40] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:15:40] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:15:40] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:15:40] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:15:40] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:15:40] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:15:41] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 2 ms to minimize.
[2024-05-22 22:15:41] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:15:42] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:15:42] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 22:15:43] [INFO ] Deduced a trap composed of 150 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:15:44] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-05-22 22:15:44] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:15:44] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 3 ms to minimize.
[2024-05-22 22:15:45] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 2 ms to minimize.
[2024-05-22 22:15:45] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:15:45] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:15:45] [INFO ] Deduced a trap composed of 140 places in 84 ms of which 1 ms to minimize.
[2024-05-22 22:15:46] [INFO ] Deduced a trap composed of 122 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:15:46] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:49] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:15:51] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-05-22 22:15:52] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:15:54] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 5/789 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:16:03] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 736/736 variables, and 790 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 47/47 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 331/542 places, 405/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60995 ms. Remains : 331/542 places, 405/621 transitions.
Support contains 96 out of 331 places after structural reductions.
[2024-05-22 22:16:04] [INFO ] Flatten gal took : 46 ms
[2024-05-22 22:16:04] [INFO ] Flatten gal took : 19 ms
[2024-05-22 22:16:04] [INFO ] Input system was already deterministic with 405 transitions.
Support contains 95 out of 331 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (771 resets) in 1758 ms. (22 steps per ms) remains 15/71 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (11 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 13/14 properties
[2024-05-22 22:16:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 308/331 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 22:16:05] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:16:05] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:16:05] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:16:05] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2024-05-22 22:16:06] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:16:06] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:16:06] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:16:06] [INFO ] Deduced a trap composed of 89 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 405/736 variables, 331/347 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/736 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/736 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 736/736 variables, and 347 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1540 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 311/331 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 22:16:07] [INFO ] Deduced a trap composed of 189 places in 108 ms of which 7 ms to minimize.
[2024-05-22 22:16:07] [INFO ] Deduced a trap composed of 109 places in 85 ms of which 1 ms to minimize.
[2024-05-22 22:16:07] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2024-05-22 22:16:07] [INFO ] Deduced a trap composed of 112 places in 84 ms of which 1 ms to minimize.
[2024-05-22 22:16:07] [INFO ] Deduced a trap composed of 114 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 22:16:07] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:16:07] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 405/736 variables, 331/354 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 12/366 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 22:16:08] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 1/367 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/367 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-22 22:16:08] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/736 variables, 1/368 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/736 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/736 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 736/736 variables, and 368 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2281 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 17/17 constraints]
After SMT, in 3832ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 7 properties in 3563 ms.
Support contains 12 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 405/405 transitions.
Graph (trivial) has 282 edges and 331 vertex of which 26 / 331 are part of one of the 4 SCC in 3 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 309 transition count 323
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 254 transition count 323
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 111 place count 254 transition count 303
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 151 place count 234 transition count 303
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 203 place count 182 transition count 251
Iterating global reduction 2 with 52 rules applied. Total rules applied 255 place count 182 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 182 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 256 place count 182 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 258 place count 181 transition count 249
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 273 place count 166 transition count 234
Iterating global reduction 3 with 15 rules applied. Total rules applied 288 place count 166 transition count 234
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 302 place count 166 transition count 220
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 386 place count 124 transition count 178
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 389 place count 124 transition count 175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 390 place count 123 transition count 174
Iterating global reduction 5 with 1 rules applied. Total rules applied 391 place count 123 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 392 place count 123 transition count 173
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 398 place count 120 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 403 place count 120 transition count 176
Free-agglomeration rule applied 57 times.
Iterating global reduction 6 with 57 rules applied. Total rules applied 460 place count 120 transition count 119
Reduce places removed 57 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 66 rules applied. Total rules applied 526 place count 63 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 533 place count 63 transition count 103
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 534 place count 63 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 535 place count 62 transition count 102
Applied a total of 535 rules in 88 ms. Remains 62 /331 variables (removed 269) and now considering 102/405 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 62/331 places, 102/405 transitions.
RANDOM walk for 36451 steps (91 resets) in 309 ms. (117 steps per ms) remains 0/5 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 22:16:13] [INFO ] Flatten gal took : 17 ms
[2024-05-22 22:16:13] [INFO ] Flatten gal took : 18 ms
[2024-05-22 22:16:13] [INFO ] Input system was already deterministic with 405 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 274 transition count 348
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 274 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 274 transition count 347
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 141 place count 248 transition count 321
Iterating global reduction 1 with 26 rules applied. Total rules applied 167 place count 248 transition count 321
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 176 place count 248 transition count 312
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 186 place count 238 transition count 302
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 238 transition count 302
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 203 place count 238 transition count 295
Applied a total of 203 rules in 22 ms. Remains 238 /331 variables (removed 93) and now considering 295/405 (removed 110) transitions.
// Phase 1: matrix 295 rows 238 cols
[2024-05-22 22:16:13] [INFO ] Computed 8 invariants in 5 ms
[2024-05-22 22:16:13] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 22:16:13] [INFO ] Invariant cache hit.
[2024-05-22 22:16:13] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-22 22:16:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 22:16:15] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/533 variables, 238/247 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/533 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 247 constraints, problems are : Problem set: 0 solved, 294 unsolved in 11770 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/533 variables, 238/247 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 294/541 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 22:16:28] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:16:28] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:16:29] [INFO ] Deduced a trap composed of 143 places in 80 ms of which 1 ms to minimize.
[2024-05-22 22:16:29] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-22 22:16:29] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:16:30] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:16:30] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:16:31] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:16:31] [INFO ] Deduced a trap composed of 184 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 9/550 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 22:16:34] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:16:35] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-22 22:16:36] [INFO ] Deduced a trap composed of 161 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 3/553 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 22:16:39] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:16:39] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (OVERLAPS) 0/533 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 533/533 variables, and 555 constraints, problems are : Problem set: 0 solved, 294 unsolved in 29455 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 15/15 constraints]
After SMT, in 41292ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 41298ms
Starting structural reductions in LTL mode, iteration 1 : 238/331 places, 295/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41550 ms. Remains : 238/331 places, 295/405 transitions.
[2024-05-22 22:16:54] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:16:54] [INFO ] Flatten gal took : 18 ms
[2024-05-22 22:16:54] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-22 22:16:54] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:16:54] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:16:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1378293768701411073.gal : 19 ms
[2024-05-22 22:16:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17725784513760431563.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1378293768701411073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17725784513760431563.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29355e+11,26.6496,625604,2,62250,5,2.29849e+06,6,0,1249,3.55728e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:17:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:17:24] [INFO ] Applying decomposition
[2024-05-22 22:17:25] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph186460665093276179.txt' '-o' '/tmp/graph186460665093276179.bin' '-w' '/tmp/graph186460665093276179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph186460665093276179.bin' '-l' '-1' '-v' '-w' '/tmp/graph186460665093276179.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:17:25] [INFO ] Decomposing Gal with order
[2024-05-22 22:17:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:17:25] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-22 22:17:25] [INFO ] Flatten gal took : 71 ms
[2024-05-22 22:17:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-22 22:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2174047283839962934.gal : 6 ms
[2024-05-22 22:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17882019617277710087.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2174047283839962934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17882019617277710087.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29355e+11,1.32624,49520,2606,593,84136,11354,772,158804,240,34491,0


Converting to forward existential form...Done !
original formula: A((!((AX(((EG((i11.u63.p430==1)) * (i6.i0.u40.p266==1)) * (i11.u64.p422==1))) + AG((i7.i0.u48.p315!=1)))) * (AF(AX((i11.u62.p400!=1))) + ...254
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (i2.u19.p130==1)))))) * !(E(!(E(TRUE U (i2.u19.p130==1))) U (!((!((!(EX(!(((EG((i11.u6...431
Reverse transition relation is NOT exact ! Due to transitions t1, t69, t70, t99, t100, t129, t130, t160, t161, t243, t244, t245, t246, t248, i0.i0.u3.t191,...796
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 277 transition count 351
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 277 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 277 transition count 350
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 135 place count 251 transition count 324
Iterating global reduction 1 with 26 rules applied. Total rules applied 161 place count 251 transition count 324
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 168 place count 251 transition count 317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 180 place count 239 transition count 305
Iterating global reduction 2 with 12 rules applied. Total rules applied 192 place count 239 transition count 305
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 199 place count 239 transition count 298
Applied a total of 199 rules in 22 ms. Remains 239 /331 variables (removed 92) and now considering 298/405 (removed 107) transitions.
// Phase 1: matrix 298 rows 239 cols
[2024-05-22 22:17:55] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:17:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 22:17:55] [INFO ] Invariant cache hit.
[2024-05-22 22:17:55] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-05-22 22:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 298/537 variables, 239/247 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 0/537 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 247 constraints, problems are : Problem set: 0 solved, 297 unsolved in 9636 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (OVERLAPS) 298/537 variables, 239/247 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 297/544 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 22:18:08] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:18:09] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:18:09] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:18:10] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:18:10] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:18:10] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-22 22:18:10] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:18:11] [INFO ] Deduced a trap composed of 164 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:18:11] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 9/553 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 22:18:14] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-22 22:18:14] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:18:14] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-22 22:18:16] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:18:16] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 5/558 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/537 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 558 constraints, problems are : Problem set: 0 solved, 297 unsolved in 24169 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 14/14 constraints]
After SMT, in 33864ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 33867ms
Starting structural reductions in LTL mode, iteration 1 : 239/331 places, 298/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34134 ms. Remains : 239/331 places, 298/405 transitions.
[2024-05-22 22:18:29] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:18:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:18:29] [INFO ] Input system was already deterministic with 298 transitions.
[2024-05-22 22:18:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:18:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:18:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5380521992486486902.gal : 2 ms
[2024-05-22 22:18:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9091397788009842838.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5380521992486486902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9091397788009842838.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3938e+11,20.326,445340,2,64999,5,1.77479e+06,6,0,1256,2.45432e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:18:59] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:18:59] [INFO ] Applying decomposition
[2024-05-22 22:18:59] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7392293876551584717.txt' '-o' '/tmp/graph7392293876551584717.bin' '-w' '/tmp/graph7392293876551584717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7392293876551584717.bin' '-l' '-1' '-v' '-w' '/tmp/graph7392293876551584717.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:18:59] [INFO ] Decomposing Gal with order
[2024-05-22 22:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:18:59] [INFO ] Removed a total of 130 redundant transitions.
[2024-05-22 22:18:59] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 22:18:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8085186921300194275.gal : 5 ms
[2024-05-22 22:18:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14287024673119120475.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8085186921300194275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14287024673119120475.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3938e+11,2.99557,85780,2498,515,144555,10579,788,315299,227,70674,0


Converting to forward existential form...Done !
original formula: AG((AX((((((EF((i12.u66.p454==1)) * ((i6.i1.u27.p184==1)||(i12.u66.p462==1))) + (i12.u66.p412==1)) + ((i10.i1.u48.p341==1)||(i6.i0.u23.p1...277
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(EX(!((((((E(TRUE U (i12.u66.p454==1)) * ((i6.i1.u27.p184==1)||(i12.u66.p462==1))) ...341
Reverse transition relation is NOT exact ! Due to transitions t1, t38, t68, t69, t98, t99, t129, t130, t162, t163, t191, t244, t245, t246, t247, i0.u58.t53...782
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 279 transition count 353
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 279 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 105 place count 279 transition count 352
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 127 place count 257 transition count 330
Iterating global reduction 1 with 22 rules applied. Total rules applied 149 place count 257 transition count 330
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 157 place count 257 transition count 322
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 165 place count 249 transition count 314
Iterating global reduction 2 with 8 rules applied. Total rules applied 173 place count 249 transition count 314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 178 place count 249 transition count 309
Applied a total of 178 rules in 12 ms. Remains 249 /331 variables (removed 82) and now considering 309/405 (removed 96) transitions.
// Phase 1: matrix 309 rows 249 cols
[2024-05-22 22:19:29] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:19:29] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 22:19:29] [INFO ] Invariant cache hit.
[2024-05-22 22:19:30] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-05-22 22:19:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/249 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 309/558 variables, 249/257 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 0/558 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 257 constraints, problems are : Problem set: 0 solved, 308 unsolved in 10306 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/249 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 309/558 variables, 249/257 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 308/565 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-22 22:19:43] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 10 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:19:45] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:19:45] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:19:45] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:19:46] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2024-05-22 22:19:47] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-05-22 22:19:47] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-22 22:19:48] [INFO ] Deduced a trap composed of 165 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:19:48] [INFO ] Deduced a trap composed of 169 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 18/583 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-22 22:19:50] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:19:50] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:19:50] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 3/586 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-22 22:19:55] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-05-22 22:20:02] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:20:02] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 2/589 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 589 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 24/24 constraints]
After SMT, in 40417ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 40420ms
Starting structural reductions in LTL mode, iteration 1 : 249/331 places, 309/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40814 ms. Remains : 249/331 places, 309/405 transitions.
[2024-05-22 22:20:10] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:20:10] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:20:10] [INFO ] Input system was already deterministic with 309 transitions.
[2024-05-22 22:20:10] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:20:10] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:20:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8736626928358207892.gal : 1 ms
[2024-05-22 22:20:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8030043512113418991.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8736626928358207892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8030043512113418991.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 22:20:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:20:40] [INFO ] Applying decomposition
[2024-05-22 22:20:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4376463529841538109.txt' '-o' '/tmp/graph4376463529841538109.bin' '-w' '/tmp/graph4376463529841538109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4376463529841538109.bin' '-l' '-1' '-v' '-w' '/tmp/graph4376463529841538109.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:20:40] [INFO ] Decomposing Gal with order
[2024-05-22 22:20:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:20:40] [INFO ] Removed a total of 139 redundant transitions.
[2024-05-22 22:20:40] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:20:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-22 22:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability18263176265469860846.gal : 16 ms
[2024-05-22 22:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10949849961070688552.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18263176265469860846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10949849961070688552.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.75565e+11,1.62302,56304,3495,466,103863,8546,814,173322,222,21902,0


Converting to forward existential form...Done !
original formula: EF((AG(((A((i11.u72.p462==1) U (i9.i0.u50.p286==1)) + EG((i10.u61.p347==1))) + (i11.u72.p527==0))) + (A((EF((i11.u71.p491==1)) + ((i3.i1....531
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((!((E(!((i9.i0.u50.p286==1)) U (!((i11.u72.p462==1)) * !((i9.i0.u50.p286==1))...1231
Reverse transition relation is NOT exact ! Due to transitions t1, t71, t104, t105, t165, t175, t200, t253, t254, t255, t256, t258, t306, i0.i0.u3.t224, i0....807
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 270 transition count 344
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 270 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 270 transition count 343
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 152 place count 241 transition count 314
Iterating global reduction 1 with 29 rules applied. Total rules applied 181 place count 241 transition count 314
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 191 place count 241 transition count 304
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 203 place count 229 transition count 292
Iterating global reduction 2 with 12 rules applied. Total rules applied 215 place count 229 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 222 place count 229 transition count 285
Applied a total of 222 rules in 19 ms. Remains 229 /331 variables (removed 102) and now considering 285/405 (removed 120) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-22 22:21:10] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:21:11] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 22:21:11] [INFO ] Invariant cache hit.
[2024-05-22 22:21:11] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 22:21:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 237 constraints, problems are : Problem set: 0 solved, 284 unsolved in 8805 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 284/521 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:21:23] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:21:23] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2024-05-22 22:21:23] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:21:24] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:21:24] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-05-22 22:21:25] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:21:25] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-22 22:21:25] [INFO ] Deduced a trap composed of 162 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:21:26] [INFO ] Deduced a trap composed of 160 places in 96 ms of which 1 ms to minimize.
[2024-05-22 22:21:26] [INFO ] Deduced a trap composed of 162 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 10/531 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:21:32] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:21:33] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/514 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:21:37] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:21:38] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:21:38] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 536 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 15/15 constraints]
After SMT, in 38874ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 38877ms
Starting structural reductions in LTL mode, iteration 1 : 229/331 places, 285/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39230 ms. Remains : 229/331 places, 285/405 transitions.
[2024-05-22 22:21:50] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:21:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:21:50] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-22 22:21:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:21:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:21:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8370015142658391912.gal : 2 ms
[2024-05-22 22:21:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17127436174463110798.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/CTLFireability8370015142658391912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17127436174463110798.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05187e+11,17.9512,474468,2,47890,5,1.82526e+06,6,0,1203,2.65671e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:22:20] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:22:20] [INFO ] Applying decomposition
[2024-05-22 22:22:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10387981734530520774.txt' '-o' '/tmp/graph10387981734530520774.bin' '-w' '/tmp/graph10387981734530520774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10387981734530520774.bin' '-l' '-1' '-v' '-w' '/tmp/graph10387981734530520774.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:22:20] [INFO ] Decomposing Gal with order
[2024-05-22 22:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:22:20] [INFO ] Removed a total of 113 redundant transitions.
[2024-05-22 22:22:20] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:22:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 22:22:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12750521653405532956.gal : 2 ms
[2024-05-22 22:22:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2754902456988066217.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12750521653405532956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2754902456988066217.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05187e+11,1.10524,38268,1705,530,62470,6675,691,115135,237,34134,0


Converting to forward existential form...Done !
original formula: EX(AG((EF(((i9.i1.u50.p308==0)&&(u59.p512==0))) + EX((i3.u20.p133==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((E(TRUE U ((i9.i1.u50.p308==0)&&(u59.p512==0))) + EX((i3.u20.p133==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t49, t64, t65, t96, t124, t138, t153, t154, t235, t236, t237, t238, t239, u59.t6, u59.t10...716
(forward)formula 0,1,2.9338,93708,1,0,143850,43248,4076,345364,1103,265588,344735
FORMULA FlexibleBarrier-PT-06b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 274 transition count 348
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 274 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 115 place count 274 transition count 347
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 141 place count 248 transition count 321
Iterating global reduction 1 with 26 rules applied. Total rules applied 167 place count 248 transition count 321
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 176 place count 248 transition count 312
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 186 place count 238 transition count 302
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 238 transition count 302
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 201 place count 238 transition count 297
Applied a total of 201 rules in 11 ms. Remains 238 /331 variables (removed 93) and now considering 297/405 (removed 108) transitions.
// Phase 1: matrix 297 rows 238 cols
[2024-05-22 22:22:23] [INFO ] Computed 8 invariants in 7 ms
[2024-05-22 22:22:23] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 22:22:23] [INFO ] Invariant cache hit.
[2024-05-22 22:22:23] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-05-22 22:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (OVERLAPS) 297/535 variables, 238/246 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 22:22:30] [INFO ] Deduced a trap composed of 190 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 0/535 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 247 constraints, problems are : Problem set: 0 solved, 296 unsolved in 13271 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 297/535 variables, 238/247 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 296/543 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 22:22:40] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:22:40] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:22:40] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:22:41] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:22:41] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-05-22 22:22:41] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:22:42] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:22:42] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:22:43] [INFO ] Deduced a trap composed of 165 places in 73 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 9/552 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-05-22 22:22:45] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:22:46] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:22:47] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 555 constraints, problems are : Problem set: 0 solved, 296 unsolved in 23666 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 13/13 constraints]
After SMT, in 36996ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 37000ms
Starting structural reductions in LTL mode, iteration 1 : 238/331 places, 297/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37277 ms. Remains : 238/331 places, 297/405 transitions.
[2024-05-22 22:23:00] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:23:00] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:23:00] [INFO ] Input system was already deterministic with 297 transitions.
[2024-05-22 22:23:00] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:23:00] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability18184839247752927682.gal : 1 ms
[2024-05-22 22:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6814997346510794247.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/CTLFireability18184839247752927682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6814997346510794247.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 22:23:30] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:23:30] [INFO ] Applying decomposition
[2024-05-22 22:23:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5006654691740936571.txt' '-o' '/tmp/graph5006654691740936571.bin' '-w' '/tmp/graph5006654691740936571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5006654691740936571.bin' '-l' '-1' '-v' '-w' '/tmp/graph5006654691740936571.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:23:30] [INFO ] Decomposing Gal with order
[2024-05-22 22:23:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:23:30] [INFO ] Removed a total of 124 redundant transitions.
[2024-05-22 22:23:30] [INFO ] Flatten gal took : 24 ms
[2024-05-22 22:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:23:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10350868206959538430.gal : 3 ms
[2024-05-22 22:23:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8305941242964030199.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10350868206959538430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8305941242964030199.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35399e+11,1.80706,60944,3106,614,113167,11005,762,167657,232,18670,0


Converting to forward existential form...Done !
original formula: EF((!(A(!(EF((i12.u64.p441==1))) U EX((i1.i0.u6.p22==1)))) * !(A(EX(((i10.u47.p304==1)||(i11.u56.p350==1))) U E(EF((i6.i1.u24.p168==1)) U...182
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * !(!((E(!(EX((i1.i0.u6.p22==1))) U (!(!(E(TRUE U (i12.u64.p441==1)))) * !(EX((i1.i0.u...636
Reverse transition relation is NOT exact ! Due to transitions t1, t38, t67, t99, t100, t128, t129, t159, t160, t188, t243, t244, t245, t247, t248, i0.t246,...805
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 271 transition count 345
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 271 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 271 transition count 344
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 150 place count 242 transition count 315
Iterating global reduction 1 with 29 rules applied. Total rules applied 179 place count 242 transition count 315
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 190 place count 242 transition count 304
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 202 place count 230 transition count 292
Iterating global reduction 2 with 12 rules applied. Total rules applied 214 place count 230 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 221 place count 230 transition count 285
Applied a total of 221 rules in 17 ms. Remains 230 /331 variables (removed 101) and now considering 285/405 (removed 120) transitions.
// Phase 1: matrix 285 rows 230 cols
[2024-05-22 22:24:00] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:24:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 22:24:00] [INFO ] Invariant cache hit.
[2024-05-22 22:24:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 22:24:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:24:03] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 1 ms to minimize.
[2024-05-22 22:24:04] [INFO ] Deduced a trap composed of 160 places in 57 ms of which 2 ms to minimize.
[2024-05-22 22:24:04] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:24:05] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:24:05] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:24:05] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:24:05] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:24:06] [INFO ] Deduced a trap composed of 159 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:24:08] [INFO ] Deduced a trap composed of 160 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 285/515 variables, 230/247 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:24:13] [INFO ] Deduced a trap composed of 160 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:24:13] [INFO ] Deduced a trap composed of 160 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/515 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 249 constraints, problems are : Problem set: 0 solved, 284 unsolved in 18369 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/515 variables, 230/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 284/533 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:24:22] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:24:22] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2024-05-22 22:24:23] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:24:23] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:24:23] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2024-05-22 22:24:24] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:24:24] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:24:29] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/544 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:24:33] [INFO ] Deduced a trap composed of 133 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/515 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 545 constraints, problems are : Problem set: 0 solved, 284 unsolved in 28093 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 23/23 constraints]
After SMT, in 46533ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 46536ms
Starting structural reductions in LTL mode, iteration 1 : 230/331 places, 285/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46747 ms. Remains : 230/331 places, 285/405 transitions.
[2024-05-22 22:24:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:47] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-22 22:24:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1305469441009616139.gal : 3 ms
[2024-05-22 22:24:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16931874879748085667.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/CTLFireability1305469441009616139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16931874879748085667.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03847e+11,21.2704,548044,2,40061,5,2.11358e+06,6,0,1207,3.07721e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:25:17] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:25:17] [INFO ] Applying decomposition
[2024-05-22 22:25:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13280067280461822766.txt' '-o' '/tmp/graph13280067280461822766.bin' '-w' '/tmp/graph13280067280461822766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13280067280461822766.bin' '-l' '-1' '-v' '-w' '/tmp/graph13280067280461822766.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:25:17] [INFO ] Decomposing Gal with order
[2024-05-22 22:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:25:17] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-22 22:25:17] [INFO ] Flatten gal took : 27 ms
[2024-05-22 22:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16326095657802819383.gal : 9 ms
[2024-05-22 22:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17455449653914326866.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16326095657802819383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17455449653914326866.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03847e+11,1.33027,45800,1749,563,75534,8843,713,139938,227,76574,0


Converting to forward existential form...Done !
original formula: EG((AX(EX(EF((i1.i1.u12.p66==1)))) * EF((AX((i12.u66.p529==1)) * EF((i3.i1.u14.p83==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(EX(E(TRUE U (i1.i1.u12.p66==1)))))) * E(TRUE U (!(EX(!((i12.u66.p529==1)))) * E(TRUE U (i3.i1...182
Reverse transition relation is NOT exact ! Due to transitions t36, t50, t64, t65, t93, t94, t122, t123, t152, t153, t182, t236, t237, t238, t239, t240, i0....738
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Graph (trivial) has 309 edges and 331 vertex of which 38 / 331 are part of one of the 6 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 298 transition count 316
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 243 transition count 316
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 111 place count 243 transition count 296
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 151 place count 223 transition count 296
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 212 place count 162 transition count 235
Iterating global reduction 2 with 61 rules applied. Total rules applied 273 place count 162 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 162 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 162 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 161 transition count 233
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 288 place count 149 transition count 221
Iterating global reduction 3 with 12 rules applied. Total rules applied 300 place count 149 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 311 place count 149 transition count 210
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 349 place count 130 transition count 191
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 356 place count 123 transition count 184
Iterating global reduction 4 with 7 rules applied. Total rules applied 363 place count 123 transition count 184
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 370 place count 123 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 376 place count 123 transition count 171
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 378 place count 121 transition count 169
Applied a total of 378 rules in 88 ms. Remains 121 /331 variables (removed 210) and now considering 169/405 (removed 236) transitions.
[2024-05-22 22:25:47] [INFO ] Flow matrix only has 164 transitions (discarded 5 similar events)
// Phase 1: matrix 164 rows 121 cols
[2024-05-22 22:25:47] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:25:48] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 22:25:48] [INFO ] Flow matrix only has 164 transitions (discarded 5 similar events)
[2024-05-22 22:25:48] [INFO ] Invariant cache hit.
[2024-05-22 22:25:48] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-22 22:25:48] [INFO ] Redundant transitions in 4 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-22 22:25:48] [INFO ] Flow matrix only has 164 transitions (discarded 5 similar events)
[2024-05-22 22:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 6/121 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 163/284 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/285 variables, and 129 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 6/121 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 163/284 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 100/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/285 variables, and 229 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4780ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4781ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/331 places, 169/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5090 ms. Remains : 121/331 places, 169/405 transitions.
[2024-05-22 22:25:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:25:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:25:53] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-22 22:25:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:25:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:25:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14616170196192166916.gal : 1 ms
[2024-05-22 22:25:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10438711556914130145.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14616170196192166916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10438711556914130145.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10438711556914130145.prop.
RANDOM walk for 30053 steps (2308 resets) in 235 ms. (127 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-06b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 270 transition count 344
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 270 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 270 transition count 343
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 152 place count 241 transition count 314
Iterating global reduction 1 with 29 rules applied. Total rules applied 181 place count 241 transition count 314
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 192 place count 241 transition count 303
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 204 place count 229 transition count 291
Iterating global reduction 2 with 12 rules applied. Total rules applied 216 place count 229 transition count 291
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 223 place count 229 transition count 284
Applied a total of 223 rules in 44 ms. Remains 229 /331 variables (removed 102) and now considering 284/405 (removed 121) transitions.
// Phase 1: matrix 284 rows 229 cols
[2024-05-22 22:25:53] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:25:53] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 22:25:53] [INFO ] Invariant cache hit.
[2024-05-22 22:25:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 22:25:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 237 constraints, problems are : Problem set: 0 solved, 283 unsolved in 8693 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 283/520 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 22:26:05] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:26:05] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:26:06] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:26:06] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:26:07] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:26:07] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:26:07] [INFO ] Deduced a trap composed of 159 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:26:07] [INFO ] Deduced a trap composed of 162 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:26:08] [INFO ] Deduced a trap composed of 181 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 9/529 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 529 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16729 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints]
After SMT, in 25485ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 25489ms
Starting structural reductions in LTL mode, iteration 1 : 229/331 places, 284/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25817 ms. Remains : 229/331 places, 284/405 transitions.
[2024-05-22 22:26:18] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:26:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:26:19] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-22 22:26:19] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:26:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:26:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13474004046174313279.gal : 4 ms
[2024-05-22 22:26:19] [INFO ] Time to serialize properties into /tmp/CTLFireability18156547500191431037.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/CTLFireability13474004046174313279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18156547500191431037.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04552e+11,18.1672,380144,2,44152,5,1.46293e+06,6,0,1202,2.12702e+06,0


Converting to forward existential form...Done !
original formula: EF(((p45==1) + ((p402==0) * AX((p76==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p45==1))] != FALSE + [((FwdU(Init,TRUE) * (p402==0)) * !(EX(!((p76==1)))))] != FALSE)
(forward)formula 0,1,18.1821,380144,1,0,7,1.46293e+06,8,1,1205,2.12702e+06,1
FORMULA FlexibleBarrier-PT-06b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Graph (trivial) has 309 edges and 331 vertex of which 38 / 331 are part of one of the 6 SCC in 3 ms
Free SCC test removed 32 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 298 transition count 315
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 242 transition count 315
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 113 place count 242 transition count 295
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 153 place count 222 transition count 295
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 213 place count 162 transition count 235
Iterating global reduction 2 with 60 rules applied. Total rules applied 273 place count 162 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 162 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 162 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 161 transition count 233
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 288 place count 149 transition count 221
Iterating global reduction 3 with 12 rules applied. Total rules applied 300 place count 149 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 311 place count 149 transition count 210
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 349 place count 130 transition count 191
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 355 place count 124 transition count 185
Iterating global reduction 4 with 6 rules applied. Total rules applied 361 place count 124 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 367 place count 124 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 373 place count 124 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 375 place count 122 transition count 171
Applied a total of 375 rules in 54 ms. Remains 122 /331 variables (removed 209) and now considering 171/405 (removed 234) transitions.
[2024-05-22 22:26:37] [INFO ] Flow matrix only has 166 transitions (discarded 5 similar events)
// Phase 1: matrix 166 rows 122 cols
[2024-05-22 22:26:37] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:26:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 22:26:37] [INFO ] Flow matrix only has 166 transitions (discarded 5 similar events)
[2024-05-22 22:26:37] [INFO ] Invariant cache hit.
[2024-05-22 22:26:37] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-22 22:26:37] [INFO ] Redundant transitions in 4 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-22 22:26:37] [INFO ] Flow matrix only has 166 transitions (discarded 5 similar events)
[2024-05-22 22:26:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 6/122 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 165/287 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/288 variables, and 130 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 6/122 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 165/287 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 101/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/288 variables, and 231 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 4021ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 4022ms
Starting structural reductions in SI_CTL mode, iteration 1 : 122/331 places, 171/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4234 ms. Remains : 122/331 places, 171/405 transitions.
[2024-05-22 22:26:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:26:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:26:41] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-22 22:26:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:26:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability18245358285182878595.gal : 1 ms
[2024-05-22 22:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17634282258180286016.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/CTLFireability18245358285182878595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17634282258180286016.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,7.63776e+08,0.203704,12424,2,1056,5,48218,6,0,656,28983,0


Converting to forward existential form...Done !
original formula: AG(!(E((p300==1) U (p15==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),(p300==1)) * (p15==1))] = FALSE
Hit Full ! (commute/partial/dont) 169/0/2
(forward)formula 0,0,0.223203,12688,1,0,8,48218,15,1,1139,28983,4
FORMULA FlexibleBarrier-PT-06b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Graph (trivial) has 294 edges and 331 vertex of which 32 / 331 are part of one of the 5 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 303 transition count 319
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 246 transition count 319
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 115 place count 246 transition count 299
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 155 place count 226 transition count 299
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 208 place count 173 transition count 246
Iterating global reduction 2 with 53 rules applied. Total rules applied 261 place count 173 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 173 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 262 place count 173 transition count 244
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 172 transition count 244
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 275 place count 161 transition count 233
Iterating global reduction 3 with 11 rules applied. Total rules applied 286 place count 161 transition count 233
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 296 place count 161 transition count 223
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 340 place count 139 transition count 201
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 343 place count 136 transition count 198
Iterating global reduction 4 with 3 rules applied. Total rules applied 346 place count 136 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 349 place count 136 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 355 place count 136 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 357 place count 134 transition count 187
Applied a total of 357 rules in 38 ms. Remains 134 /331 variables (removed 197) and now considering 187/405 (removed 218) transitions.
[2024-05-22 22:26:41] [INFO ] Flow matrix only has 183 transitions (discarded 4 similar events)
// Phase 1: matrix 183 rows 134 cols
[2024-05-22 22:26:41] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:26:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 22:26:41] [INFO ] Flow matrix only has 183 transitions (discarded 4 similar events)
[2024-05-22 22:26:41] [INFO ] Invariant cache hit.
[2024-05-22 22:26:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-22 22:26:41] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-22 22:26:41] [INFO ] Flow matrix only has 183 transitions (discarded 4 similar events)
[2024-05-22 22:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/134 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-22 22:26:42] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:26:42] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:26:42] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 4 ms to minimize.
[2024-05-22 22:26:42] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:26:42] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 182/316 variables, 134/147 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/317 variables, and 147 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3208 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/134 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 182/316 variables, 134/147 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 120/267 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/317 variables, and 267 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2629 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 5/5 constraints]
After SMT, in 5860ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 5862ms
Starting structural reductions in SI_CTL mode, iteration 1 : 134/331 places, 187/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6069 ms. Remains : 134/331 places, 187/405 transitions.
[2024-05-22 22:26:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:26:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:26:47] [INFO ] Input system was already deterministic with 187 transitions.
[2024-05-22 22:26:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:26:47] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:26:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11091888069294267009.gal : 3 ms
[2024-05-22 22:26:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14448759279427389076.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11091888069294267009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14448759279427389076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33944e+09,0.393651,18932,2,2242,5,79233,6,0,721,52298,0


Converting to forward existential form...Done !
original formula: E((AG((p502!=1)) * E(EF((((p404==1)&&(p306==1))&&(p337!=1))) U EG(!(AF((p19==1)))))) U (!(EF((p497==1))) * AG(!(AF(((p28==1)&&(p308==1)))...159
=> equivalent forward existential formula: [((FwdU(Init,(!(E(TRUE U !((p502!=1)))) * E(E(TRUE U (((p404==1)&&(p306==1))&&(p337!=1))) U EG(!(!(EG(!((p19==1)...253
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t20, t26, t28, t38, t51, t75, t83, t130, t134, t143, t147, t154, t157, Inter...249
Detected timeout of ITS tools.
[2024-05-22 22:27:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:27:17] [INFO ] Applying decomposition
[2024-05-22 22:27:17] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9859633586907112071.txt' '-o' '/tmp/graph9859633586907112071.bin' '-w' '/tmp/graph9859633586907112071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9859633586907112071.bin' '-l' '-1' '-v' '-w' '/tmp/graph9859633586907112071.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:27:17] [INFO ] Decomposing Gal with order
[2024-05-22 22:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:27:17] [INFO ] Removed a total of 72 redundant transitions.
[2024-05-22 22:27:17] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:27:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 1 ms.
[2024-05-22 22:27:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8842288233882085329.gal : 2 ms
[2024-05-22 22:27:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1130802711897578999.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/CTLFireability8842288233882085329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1130802711897578999.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33944e+09,0.037214,4856,86,114,1455,874,383,2141,230,1713,0


Converting to forward existential form...Done !
original formula: E((AG((u20.p502!=1)) * E(EF((((u20.p404==1)&&(i5.u16.p306==1))&&(i5.u15.p337!=1))) U EG(!(AF((i0.u2.p19==1)))))) U (!(EF((u20.p497==1))) ...204
=> equivalent forward existential formula: [((FwdU(Init,(!(E(TRUE U !((u20.p502!=1)))) * E(E(TRUE U (((u20.p404==1)&&(i5.u16.p306==1))&&(i5.u15.p337!=1))) ...298
Reverse transition relation is NOT exact ! Due to transitions t134, t143, t147, t154, t157, u20.t0, u20.t1, u20.t2, i0.u1.t75, i0.u2.t83, i0.u2.t130, i2.u7...320
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 269 transition count 343
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 269 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 269 transition count 342
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 155 place count 239 transition count 312
Iterating global reduction 1 with 30 rules applied. Total rules applied 185 place count 239 transition count 312
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 196 place count 239 transition count 301
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 208 place count 227 transition count 289
Iterating global reduction 2 with 12 rules applied. Total rules applied 220 place count 227 transition count 289
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 227 place count 227 transition count 282
Applied a total of 227 rules in 10 ms. Remains 227 /331 variables (removed 104) and now considering 282/405 (removed 123) transitions.
// Phase 1: matrix 282 rows 227 cols
[2024-05-22 22:27:48] [INFO ] Computed 8 invariants in 7 ms
[2024-05-22 22:27:48] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 22:27:48] [INFO ] Invariant cache hit.
[2024-05-22 22:27:48] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-22 22:27:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/509 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 0/509 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 235 constraints, problems are : Problem set: 0 solved, 281 unsolved in 8688 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 282/509 variables, 227/235 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/509 variables, 281/516 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-22 22:27:59] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-05-22 22:28:00] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:28:00] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 2 ms to minimize.
[2024-05-22 22:28:00] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:28:00] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:28:00] [INFO ] Deduced a trap composed of 141 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:28:00] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:28:01] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:28:01] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:28:02] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 10/526 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-22 22:28:04] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 527 constraints, problems are : Problem set: 0 solved, 281 unsolved in 21923 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 11/11 constraints]
After SMT, in 30662ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 30665ms
Starting structural reductions in LTL mode, iteration 1 : 227/331 places, 282/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30901 ms. Remains : 227/331 places, 282/405 transitions.
[2024-05-22 22:28:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:28:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:28:18] [INFO ] Input system was already deterministic with 282 transitions.
[2024-05-22 22:28:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:28:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:28:18] [INFO ] Time to serialize gal into /tmp/CTLFireability5434146469240314947.gal : 2 ms
[2024-05-22 22:28:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5812329589120675290.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5434146469240314947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5812329589120675290.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,9.83505e+10,16.2804,354324,2,42232,5,1.38273e+06,6,0,1192,1.95321e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:28:49] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:28:49] [INFO ] Applying decomposition
[2024-05-22 22:28:49] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12145092481249003125.txt' '-o' '/tmp/graph12145092481249003125.bin' '-w' '/tmp/graph12145092481249003125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12145092481249003125.bin' '-l' '-1' '-v' '-w' '/tmp/graph12145092481249003125.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:28:49] [INFO ] Decomposing Gal with order
[2024-05-22 22:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:28:49] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-22 22:28:49] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:28:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:28:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3538215201777291184.gal : 2 ms
[2024-05-22 22:28:49] [INFO ] Time to serialize properties into /tmp/CTLFireability790729860957016796.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3538215201777291184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability790729860957016796.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.83505e+10,1.56043,52560,1820,589,88305,9712,628,157179,228,82934,0


Converting to forward existential form...Done !
original formula: EF(AX(AX(AF(((u61.p444==1)||((i6.i0.u36.p250==1)&&(i8.u63.p539==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(EG(!(((u61.p444==1)||((i6.i0.u36.p250==1)&&(i8.u63.p539==1)))))))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t1, t36, t63, t77, t92, t93, t121, t151, t152, t180, t232, t233, t234, t235, t236, u61.t6, u6...708
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Graph (trivial) has 246 edges and 331 vertex of which 12 / 331 are part of one of the 2 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 320 transition count 344
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 270 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 269 transition count 343
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 103 place count 269 transition count 327
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 135 place count 253 transition count 327
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 187 place count 201 transition count 275
Iterating global reduction 3 with 52 rules applied. Total rules applied 239 place count 201 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 242 place count 201 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 243 place count 200 transition count 272
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 243 place count 200 transition count 268
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 251 place count 196 transition count 268
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 266 place count 181 transition count 253
Iterating global reduction 5 with 15 rules applied. Total rules applied 281 place count 181 transition count 253
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 294 place count 181 transition count 240
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 354 place count 151 transition count 210
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 356 place count 149 transition count 208
Iterating global reduction 6 with 2 rules applied. Total rules applied 358 place count 149 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 360 place count 149 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 366 place count 149 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 368 place count 147 transition count 198
Applied a total of 368 rules in 71 ms. Remains 147 /331 variables (removed 184) and now considering 198/405 (removed 207) transitions.
[2024-05-22 22:29:19] [INFO ] Flow matrix only has 197 transitions (discarded 1 similar events)
// Phase 1: matrix 197 rows 147 cols
[2024-05-22 22:29:19] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:29:19] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 22:29:19] [INFO ] Flow matrix only has 197 transitions (discarded 1 similar events)
[2024-05-22 22:29:19] [INFO ] Invariant cache hit.
[2024-05-22 22:29:19] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 22:29:19] [INFO ] Redundant transitions in 4 ms returned []
Running 151 sub problems to find dead transitions.
[2024-05-22 22:29:19] [INFO ] Flow matrix only has 197 transitions (discarded 1 similar events)
[2024-05-22 22:29:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 7/147 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-22 22:29:20] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-22 22:29:20] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:29:20] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 196/343 variables, 147/158 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/344 variables, and 158 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4123 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 7/147 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 196/343 variables, 147/158 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 151/309 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/343 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/344 variables, and 309 constraints, problems are : Problem set: 0 solved, 151 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 3/3 constraints]
After SMT, in 7719ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 7720ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/331 places, 198/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8339 ms. Remains : 147/331 places, 198/405 transitions.
[2024-05-22 22:29:27] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:29:27] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:29:27] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-22 22:29:27] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:29:27] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:29:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8754545461369617702.gal : 1 ms
[2024-05-22 22:29:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17699158045807486428.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8754545461369617702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17699158045807486428.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.99333e+09,0.803532,32392,2,10328,5,151716,6,0,787,125789,0


Converting to forward existential form...Done !
original formula: ((!(E(EG(((E(((p382==1)&&(p539==1)) U (p220==1)) * AF((p54==1))) + !(((p310==1)||(p391==1))))) U AF((p133==1)))) + !(E((((EF((p65==1)) * ...276
=> equivalent forward existential formula: [(FwdU((Init * !((!(E(EG(((E(((p382==1)&&(p539==1)) U (p220==1)) * !(EG(!((p54==1))))) + !(((p310==1)||(p391==1)...351
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t25, t30, t39, t51, t151, t154, t157, t159, Intersection with reachable at each step...214
Detected timeout of ITS tools.
[2024-05-22 22:29:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:29:57] [INFO ] Applying decomposition
[2024-05-22 22:29:57] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2766512251813781656.txt' '-o' '/tmp/graph2766512251813781656.bin' '-w' '/tmp/graph2766512251813781656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2766512251813781656.bin' '-l' '-1' '-v' '-w' '/tmp/graph2766512251813781656.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:29:57] [INFO ] Decomposing Gal with order
[2024-05-22 22:29:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:29:57] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-22 22:29:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:29:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 22:29:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2857235550396014221.gal : 2 ms
[2024-05-22 22:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability686067060749532116.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2857235550396014221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability686067060749532116.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.99333e+09,0.116085,7224,363,411,6220,2762,553,7624,236,4106,0


Converting to forward existential form...Done !
original formula: ((!(E(EG(((E(((i6.u25.p382==1)&&(i0.u31.p539==1)) U (i4.i1.u16.p220==1)) * AF((i0.u2.p54==1))) + !(((i5.u23.p310==1)||(i6.u27.p391==1))))...394
=> equivalent forward existential formula: [(FwdU((Init * !((!(E(EG(((E(((i6.u25.p382==1)&&(i0.u31.p539==1)) U (i4.i1.u16.p220==1)) * !(EG(!((i0.u2.p54==1)...469
Reverse transition relation is NOT exact ! Due to transitions t151, t154, t159, i3.u12.t51, i4.i0.u18.t39, i5.u21.t25, i5.u23.t30, i5.u23.t157, i7.t4, i7.t...258
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 268 transition count 342
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 268 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 127 place count 268 transition count 341
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 157 place count 238 transition count 311
Iterating global reduction 1 with 30 rules applied. Total rules applied 187 place count 238 transition count 311
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 198 place count 238 transition count 300
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 211 place count 225 transition count 287
Iterating global reduction 2 with 13 rules applied. Total rules applied 224 place count 225 transition count 287
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 232 place count 225 transition count 279
Applied a total of 232 rules in 13 ms. Remains 225 /331 variables (removed 106) and now considering 279/405 (removed 126) transitions.
// Phase 1: matrix 279 rows 225 cols
[2024-05-22 22:30:27] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:30:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 22:30:27] [INFO ] Invariant cache hit.
[2024-05-22 22:30:28] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-22 22:30:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8269 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 278/511 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-22 22:30:39] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:30:39] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 2 ms to minimize.
[2024-05-22 22:30:40] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:30:40] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:30:40] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:30:41] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:30:41] [INFO ] Deduced a trap composed of 158 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:30:41] [INFO ] Deduced a trap composed of 158 places in 82 ms of which 1 ms to minimize.
[2024-05-22 22:30:41] [INFO ] Deduced a trap composed of 158 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-22 22:30:49] [INFO ] Deduced a trap composed of 161 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/504 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 521 constraints, problems are : Problem set: 0 solved, 278 unsolved in 24582 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 10/10 constraints]
After SMT, in 32928ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 32931ms
Starting structural reductions in LTL mode, iteration 1 : 225/331 places, 279/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33241 ms. Remains : 225/331 places, 279/405 transitions.
[2024-05-22 22:31:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:31:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:31:00] [INFO ] Input system was already deterministic with 279 transitions.
[2024-05-22 22:31:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:31:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:31:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2652920638231897599.gal : 3 ms
[2024-05-22 22:31:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12487401868153360376.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/CTLFireability2652920638231897599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12487401868153360376.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,9.32468e+10,13.9405,364156,2,34115,5,1.41689e+06,6,0,1181,2.02363e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:31:31] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:31:31] [INFO ] Applying decomposition
[2024-05-22 22:31:31] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14710821491836935121.txt' '-o' '/tmp/graph14710821491836935121.bin' '-w' '/tmp/graph14710821491836935121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14710821491836935121.bin' '-l' '-1' '-v' '-w' '/tmp/graph14710821491836935121.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:31:31] [INFO ] Decomposing Gal with order
[2024-05-22 22:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:31:31] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-22 22:31:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 22:31:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10508477258571265094.gal : 3 ms
[2024-05-22 22:31:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5329343783801926876.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10508477258571265094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5329343783801926876.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.32468e+10,1.24582,38776,1542,568,65872,8187,608,112444,227,42884,0


Converting to forward existential form...Done !
original formula: EF(EX((AX(EG((i1.u10.p65==1))) * (EX((i9.u51.p337==0)) + AF((i11.u59.p389==1))))))
=> equivalent forward existential formula: ([(EY((EY(FwdU(Init,TRUE)) * !(EX(!(EG((i1.u10.p65==1))))))) * (i9.u51.p337==0))] != FALSE + [((EY(FwdU(Init,TRU...233
Reverse transition relation is NOT exact ! Due to transitions t1, t35, t62, t63, t91, t92, t120, t121, t149, t150, t178, t230, t232, t233, t234, t235, u62....681
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,25.1673,695284,1,0,1.10369e+06,228948,3567,2.15181e+06,1043,694649,1946140
FORMULA FlexibleBarrier-PT-06b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 270 transition count 344
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 270 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 123 place count 270 transition count 343
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 151 place count 242 transition count 315
Iterating global reduction 1 with 28 rules applied. Total rules applied 179 place count 242 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 188 place count 242 transition count 306
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 201 place count 229 transition count 293
Iterating global reduction 2 with 13 rules applied. Total rules applied 214 place count 229 transition count 293
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 222 place count 229 transition count 285
Applied a total of 222 rules in 11 ms. Remains 229 /331 variables (removed 102) and now considering 285/405 (removed 120) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-22 22:31:56] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:31:56] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 22:31:56] [INFO ] Invariant cache hit.
[2024-05-22 22:31:56] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 22:31:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 237 constraints, problems are : Problem set: 0 solved, 284 unsolved in 8670 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 284/521 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:32:08] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-05-22 22:32:09] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:32:09] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:32:09] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:32:10] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:32:10] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:32:11] [INFO ] Deduced a trap composed of 160 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:32:11] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:32:11] [INFO ] Deduced a trap composed of 190 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 9/530 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 530 constraints, problems are : Problem set: 0 solved, 284 unsolved in 17132 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints]
After SMT, in 25851ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 25854ms
Starting structural reductions in LTL mode, iteration 1 : 229/331 places, 285/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26153 ms. Remains : 229/331 places, 285/405 transitions.
[2024-05-22 22:32:22] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:32:22] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-22 22:32:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:32:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:32:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12260280516727883488.gal : 2 ms
[2024-05-22 22:32:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1020357809933124439.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/CTLFireability12260280516727883488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1020357809933124439.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06017e+11,20.3924,430380,2,38910,5,1.64369e+06,6,0,1203,2.40762e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:32:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:32:52] [INFO ] Applying decomposition
[2024-05-22 22:32:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3240608304916794761.txt' '-o' '/tmp/graph3240608304916794761.bin' '-w' '/tmp/graph3240608304916794761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3240608304916794761.bin' '-l' '-1' '-v' '-w' '/tmp/graph3240608304916794761.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:32:52] [INFO ] Decomposing Gal with order
[2024-05-22 22:32:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:32:52] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-22 22:32:52] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:32:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8665525846453441092.gal : 3 ms
[2024-05-22 22:32:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13302313095223472953.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8665525846453441092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13302313095223472953.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06017e+11,1.72358,58444,2022,562,110242,7526,700,160263,228,38254,0


Converting to forward existential form...Done !
original formula: AX(EF(EG(A(EF((i3.i0.u24.p100==1)) U (i9.i1.u47.p297==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG(!((E(!((i9.i1.u47.p297==1)) U (!(E(TRUE U (i3.i0.u24.p100==1))) * !((i9.i1.u47.p297==...204
Reverse transition relation is NOT exact ! Due to transitions t1, t35, t63, t64, t93, t94, t122, t123, t151, t152, t182, t235, t236, t237, t238, t239, u65....738
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 271 transition count 345
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 271 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 271 transition count 344
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 149 place count 243 transition count 316
Iterating global reduction 1 with 28 rules applied. Total rules applied 177 place count 243 transition count 316
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 188 place count 243 transition count 305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 200 place count 231 transition count 293
Iterating global reduction 2 with 12 rules applied. Total rules applied 212 place count 231 transition count 293
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 220 place count 231 transition count 285
Applied a total of 220 rules in 14 ms. Remains 231 /331 variables (removed 100) and now considering 285/405 (removed 120) transitions.
// Phase 1: matrix 285 rows 231 cols
[2024-05-22 22:33:22] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:33:22] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 22:33:22] [INFO ] Invariant cache hit.
[2024-05-22 22:33:23] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 22:33:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:33:25] [INFO ] Deduced a trap composed of 162 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 158 places in 69 ms of which 2 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 2 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 1 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 158 places in 58 ms of which 1 ms to minimize.
[2024-05-22 22:33:26] [INFO ] Deduced a trap composed of 158 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/516 variables, 231/251 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:33:31] [INFO ] Deduced a trap composed of 158 places in 64 ms of which 2 ms to minimize.
[2024-05-22 22:33:31] [INFO ] Deduced a trap composed of 158 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/516 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 253 constraints, problems are : Problem set: 0 solved, 284 unsolved in 13818 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/516 variables, 231/253 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 284/537 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:33:40] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:33:40] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-22 22:33:40] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-22 22:33:40] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:33:40] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:33:40] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:33:41] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:33:41] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:33:42] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:33:42] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:33:42] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 11/548 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:33:45] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 22:33:50] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/516 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 550 constraints, problems are : Problem set: 0 solved, 284 unsolved in 28151 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 27/27 constraints]
After SMT, in 42018ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 42021ms
Starting structural reductions in LTL mode, iteration 1 : 231/331 places, 285/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42339 ms. Remains : 231/331 places, 285/405 transitions.
[2024-05-22 22:34:05] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:34:05] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:34:05] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-22 22:34:05] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:34:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:34:05] [INFO ] Time to serialize gal into /tmp/CTLFireability742344448269346771.gal : 2 ms
[2024-05-22 22:34:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13352217852765218241.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/CTLFireability742344448269346771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13352217852765218241.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03492e+11,21.9142,489676,2,46386,5,1.96742e+06,6,0,1211,2.73014e+06,0


Converting to forward existential form...Done !
original formula: ((AX(AF(E((p61==1) U (p527==1)))) * AX(((EF((p196==1)) + ((AG((p527==0)) * (p252==0)) * ((p269==0)||(p527==0)))) + (p529==1)))) * AG((p43...162
=> equivalent forward existential formula: (([FwdG(EY(Init),!(E((p61==1) U (p527==1))))] = FALSE * (([(FwdU(((EY(Init) * !((p529==1))) * !(E(TRUE U (p196==...417
(forward)formula 0,0,21.9524,489676,1,0,8,1.96742e+06,9,2,1216,2.73014e+06,1
FORMULA FlexibleBarrier-PT-06b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 331/331 places, 405/405 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 273 transition count 347
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 273 transition count 347
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 143 place count 246 transition count 320
Iterating global reduction 0 with 27 rules applied. Total rules applied 170 place count 246 transition count 320
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 180 place count 246 transition count 310
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 190 place count 236 transition count 300
Iterating global reduction 1 with 10 rules applied. Total rules applied 200 place count 236 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 206 place count 236 transition count 294
Applied a total of 206 rules in 24 ms. Remains 236 /331 variables (removed 95) and now considering 294/405 (removed 111) transitions.
// Phase 1: matrix 294 rows 236 cols
[2024-05-22 22:34:27] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:34:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 22:34:27] [INFO ] Invariant cache hit.
[2024-05-22 22:34:27] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-22 22:34:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:34:30] [INFO ] Deduced a trap composed of 184 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/530 variables, 236/245 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 0/530 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 245 constraints, problems are : Problem set: 0 solved, 293 unsolved in 11513 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 294/530 variables, 236/245 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 293/538 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:34:42] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:34:42] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:34:43] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:34:43] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 3 ms to minimize.
[2024-05-22 22:34:43] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-22 22:34:44] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:34:44] [INFO ] Deduced a trap composed of 164 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:34:46] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:34:46] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:34:49] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:34:49] [INFO ] Deduced a trap composed of 166 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 4/549 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:34:56] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 3 ms to minimize.
[2024-05-22 22:34:56] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/530 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 0/530 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 551 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 14/14 constraints]
After SMT, in 41586ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 41591ms
Starting structural reductions in LTL mode, iteration 1 : 236/331 places, 294/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41846 ms. Remains : 236/331 places, 294/405 transitions.
[2024-05-22 22:35:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:35:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:35:09] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-22 22:35:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:35:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:35:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6700269425108253902.gal : 3 ms
[2024-05-22 22:35:09] [INFO ] Time to serialize properties into /tmp/CTLFireability18213989810571348408.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6700269425108253902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18213989810571348408.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27439e+11,22.4933,530444,2,53126,5,2.00355e+06,6,0,1240,2.9472e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:35:39] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:35:39] [INFO ] Applying decomposition
[2024-05-22 22:35:39] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph570937490189865385.txt' '-o' '/tmp/graph570937490189865385.bin' '-w' '/tmp/graph570937490189865385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph570937490189865385.bin' '-l' '-1' '-v' '-w' '/tmp/graph570937490189865385.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:35:39] [INFO ] Decomposing Gal with order
[2024-05-22 22:35:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:35:39] [INFO ] Removed a total of 128 redundant transitions.
[2024-05-22 22:35:39] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:35:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-05-22 22:35:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14071740360482733073.gal : 2 ms
[2024-05-22 22:35:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12491301939038701721.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14071740360482733073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12491301939038701721.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27439e+11,1.83628,55952,1805,481,83223,7326,739,214743,228,35719,0


Converting to forward existential form...Done !
original formula: EG((E(EF(((EG((i11.u66.p526==1)) * (i1.i1.u14.p138==1)) * ((i4.i0.u31.p167==1)&&(i11.u66.p448==1)))) U !(EX(((((i1.i1.u14.p138==1)&&(i6.i...314
=> equivalent forward existential formula: [FwdG(Init,(E(E(TRUE U ((EG((i11.u66.p526==1)) * (i1.i1.u14.p138==1)) * ((i4.i0.u31.p167==1)&&(i11.u66.p448==1))...428
Reverse transition relation is NOT exact ! Due to transitions t1, t38, t39, t66, t67, t96, t97, t128, t129, t159, t160, t189, t241, t242, t243, t245, t246,...801
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
[2024-05-22 22:36:09] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:36:09] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:36:09] [INFO ] Applying decomposition
[2024-05-22 22:36:09] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7787688713161547545.txt' '-o' '/tmp/graph7787688713161547545.bin' '-w' '/tmp/graph7787688713161547545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7787688713161547545.bin' '-l' '-1' '-v' '-w' '/tmp/graph7787688713161547545.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:36:09] [INFO ] Decomposing Gal with order
[2024-05-22 22:36:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:36:09] [INFO ] Removed a total of 185 redundant transitions.
[2024-05-22 22:36:09] [INFO ] Flatten gal took : 21 ms
[2024-05-22 22:36:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-05-22 22:36:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16260923580820712623.gal : 3 ms
[2024-05-22 22:36:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10775842625571785063.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/CTLFireability16260923580820712623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10775842625571785063.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.655e+11,10.8805,259356,10826,549,457101,8065,1034,883359,240,31993,0


Converting to forward existential form...Done !
original formula: A((!((AX(((EG((i12.u84.p430==1)) * (i5.i0.u52.p266==1)) * (i12.u83.p422==1))) + AG((i8.i0.u59.p315!=1)))) * (AF(AX((i12.u80.p400!=1))) + ...257
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (i2.i0.u25.p130==1)))))) * !(E(!(E(TRUE U (i2.i0.u25.p130==1))) U (!((!((!(EX(!(((EG((...440
Reverse transition relation is NOT exact ! Due to transitions t61, t63, t70, t71, t104, t116, t150, t230, t241, t271, t335, t337, t340, t402, i0.t276, i0.i...1518
Detected timeout of ITS tools.
[2024-05-22 23:03:11] [INFO ] Applying decomposition
[2024-05-22 23:03:11] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:03:11] [INFO ] Decomposing Gal with order
[2024-05-22 23:03:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:03:12] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-22 23:03:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:03:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 6 ms.
[2024-05-22 23:03:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1934456055091362697.gal : 3 ms
[2024-05-22 23:03:12] [INFO ] Time to serialize properties into /tmp/CTLFireability999039017078992103.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/CTLFireability1934456055091362697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability999039017078992103.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 23:12:30] [INFO ] Flatten gal took : 12 ms
[2024-05-22 23:12:30] [INFO ] Input system was already deterministic with 405 transitions.
[2024-05-22 23:12:30] [INFO ] Transformed 331 places.
[2024-05-22 23:12:30] [INFO ] Transformed 405 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 23:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3811872550698760539.gal : 9 ms
[2024-05-22 23:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1578402312201743467.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/CTLFireability3811872550698760539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1578402312201743467.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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