Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600466.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-03-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716333690534

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:21:31] [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-21 23:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:21:32] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-21 23:21:32] [INFO ] Transformed 274 places.
[2024-05-21 23:21:32] [INFO ] Transformed 237 transitions.
[2024-05-21 23:21:32] [INFO ] Found NUPN structural information;
[2024-05-21 23:21:32] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Support contains 114 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 249 transition count 214
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 249 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 249 transition count 213
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 241 transition count 205
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 241 transition count 205
Applied a total of 63 rules in 50 ms. Remains 241 /273 variables (removed 32) and now considering 205/236 (removed 31) transitions.
// Phase 1: matrix 205 rows 241 cols
[2024-05-21 23:21:32] [INFO ] Computed 41 invariants in 28 ms
[2024-05-21 23:21:32] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-21 23:21:32] [INFO ] Invariant cache hit.
[2024-05-21 23:21:32] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-21 23:21:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:21:40] [INFO ] Deduced a trap composed of 10 places in 4179 ms of which 57 ms to minimize.
[2024-05-21 23:21:40] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 3 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 11 places in 4037 ms of which 27 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 13 places in 3115 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 7 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 7 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:21:56] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:21:58] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 10 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:22:00] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:22:00] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:22:00] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:22:00] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 241/446 variables, and 119 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 78/119 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/446 variables, 241/363 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 204/567 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:22:07] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:22:08] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:08] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:22:08] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:22:08] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:22:09] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/587 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:22:13] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:22:16] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:22:16] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
[2024-05-21 23:22:16] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:17] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:22:17] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/607 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 52 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-05-21 23:22:32] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 628 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 142/142 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 241/273 places, 205/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60878 ms. Remains : 241/273 places, 205/236 transitions.
Support contains 114 out of 241 places after structural reductions.
[2024-05-21 23:22:33] [INFO ] Flatten gal took : 119 ms
[2024-05-21 23:22:33] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:22:33] [INFO ] Input system was already deterministic with 205 transitions.
RANDOM walk for 40000 steps (477 resets) in 1999 ms. (20 steps per ms) remains 16/83 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (9 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
[2024-05-21 23:22:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 136/167 variables, 30/30 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 51/218 variables, 11/41 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 189/407 variables, 218/259 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 7 (OVERLAPS) 36/443 variables, 21/280 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/280 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 3/446 variables, 2/282 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/446 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 282 constraints, problems are : Problem set: 3 solved, 13 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 100/123 variables, 19/19 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 2/21 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 94/217 variables, 22/43 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 6/49 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 188/405 variables, 217/266 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 9/275 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 19 places in 699 ms of which 28 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 7/282 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 25 places in 681 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 2/284 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 38/443 variables, 22/306 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 4/310 constraints. Problems are: Problem set: 3 solved, 13 unsolved
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
Problem AtomicPropp46 is UNSAT
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:39] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 20/330 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
SMT process timed out in 5710ms, After SMT, problems are : Problem set: 4 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 205/205 transitions.
Graph (complete) has 481 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 240 transition count 168
Reduce places removed 35 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 205 transition count 165
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 202 transition count 164
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 79 place count 202 transition count 126
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 164 place count 155 transition count 126
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 184 place count 135 transition count 106
Iterating global reduction 3 with 20 rules applied. Total rules applied 204 place count 135 transition count 106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 300 place count 87 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 301 place count 86 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 85 transition count 57
Applied a total of 302 rules in 51 ms. Remains 85 /241 variables (removed 156) and now considering 57/205 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 85/241 places, 57/205 transitions.
RANDOM walk for 40000 steps (8 resets) in 691 ms. (57 steps per ms) remains 1/12 properties
BEST_FIRST walk for 4414 steps (1 resets) in 29 ms. (147 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-21 23:22:40] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:22:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:22:40] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:22:40] [INFO ] Input system was already deterministic with 205 transitions.
Support contains 103 out of 241 places (down from 105) after GAL structural reductions.
Computed a total of 235 stabilizing places and 197 stable transitions
Graph (complete) has 481 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 214 transition count 178
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 214 transition count 178
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 207 transition count 171
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 28 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
// Phase 1: matrix 171 rows 207 cols
[2024-05-21 23:22:40] [INFO ] Computed 41 invariants in 5 ms
[2024-05-21 23:22:40] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-21 23:22:40] [INFO ] Invariant cache hit.
[2024-05-21 23:22:41] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-21 23:22:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:42] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/378 variables, 207/289 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 16/305 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/378 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (OVERLAPS) 0/378 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 309 constraints, problems are : Problem set: 0 solved, 170 unsolved in 16630 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 61/102 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 5 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/378 variables, 207/327 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 170/497 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 14 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 14/511 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 516 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 98/98 constraints]
After SMT, in 46695ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 46699ms
Starting structural reductions in LTL mode, iteration 1 : 207/241 places, 171/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47153 ms. Remains : 207/241 places, 171/205 transitions.
[2024-05-21 23:23:27] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:23:27] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:23:27] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-21 23:23:27] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:23:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:23:27] [INFO ] Time to serialize gal into /tmp/CTLFireability844396570468970069.gal : 4 ms
[2024-05-21 23:23:27] [INFO ] Time to serialize properties into /tmp/CTLFireability1082232422340751834.ctl : 18 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/CTLFireability844396570468970069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1082232422340751834.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.51335e+12,0.928868,27728,2,12334,5,63200,6,0,999,128527,0


Converting to forward existential form...Done !
original formula: E(!(((p212==1) + EX(E(EX((p81==1)) U (p247==1))))) U ((AF(((EF(!((((p28==1)&&(p154==1))&&(p273==1)))) + E((p45==1) U (p38==1))) + EG((p18...202
=> equivalent forward existential formula: [(((FwdU(Init,!(((p212==1) + EX(E(EX((p81==1)) U (p247==1)))))) * ((p130==1)&&(p253==1))) * (p67==1)) * !(EG(!((...260
Reverse transition relation is NOT exact ! Due to transitions t9, t16, t21, t28, t32, t33, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t71,...426
(forward)formula 0,0,19.564,543568,1,0,1084,2.37965e+06,393,599,5966,2.83132e+06,1174
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 203 transition count 167
Applied a total of 76 rules in 10 ms. Remains 203 /241 variables (removed 38) and now considering 167/205 (removed 38) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-05-21 23:23:47] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:23:47] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 23:23:47] [INFO ] Invariant cache hit.
[2024-05-21 23:23:48] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-21 23:23:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 14 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 3 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 167/370 variables, 203/273 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 16/289 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/370 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 0/370 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 290 constraints, problems are : Problem set: 0 solved, 166 unsolved in 13941 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 46/87 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/295 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 166/461 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 15/476 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/370 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 483 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 73/73 constraints]
After SMT, in 43976ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 43979ms
Starting structural reductions in LTL mode, iteration 1 : 203/241 places, 167/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44332 ms. Remains : 203/241 places, 167/205 transitions.
[2024-05-21 23:24:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:24:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:24:32] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-21 23:24:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:24:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:24:32] [INFO ] Time to serialize gal into /tmp/CTLFireability155601117652684841.gal : 4 ms
[2024-05-21 23:24:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8017010765896945876.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/CTLFireability155601117652684841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8017010765896945876.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38735e+12,0.516083,20612,2,11382,5,50775,6,0,979,82545,0


Converting to forward existential form...Done !
original formula: EF((EG(A((p167==1) U (p123==1))) * EX(EG((p100==1)))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * EG(!((E(!((p123==1)) U (!((p167==1)) * !((p123==1)))) + EG(!((p123==1)))))))),(p100=...169
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t68, t69, t70, t73...404
Detected timeout of ITS tools.
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:25:02] [INFO ] Applying decomposition
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 18 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/graph7412784785817132277.txt' '-o' '/tmp/graph7412784785817132277.bin' '-w' '/tmp/graph7412784785817132277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7412784785817132277.bin' '-l' '-1' '-v' '-w' '/tmp/graph7412784785817132277.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:25:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:25:02] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-21 23:25:02] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 23:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17892219212060425342.gal : 7 ms
[2024-05-21 23:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16302499401346384312.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/CTLFireability17892219212060425342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16302499401346384312.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,9.38735e+12,0.144231,8316,1773,26,9114,386,415,12387,41,892,0


Converting to forward existential form...Done !
original formula: EF((EG(A((i12.u51.p167==1) U (i16.i0.u41.p123==1))) * EX(EG((i0.i0.u32.p100==1)))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * EG(!((E(!((i16.i0.u41.p123==1)) U (!((i12.u51.p167==1)) * !((i16.i0.u41.p123==1)))) ...220
Reverse transition relation is NOT exact ! Due to transitions t77, t97, t101, t118, t157, t159, t160, t163, i0.i0.u32.t73, i0.i1.u58.t18, i1.t81, i1.u24.t8...682
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,10.0917,298980,1,0,583552,386,3110,858895,203,892,828216
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 207 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 16 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
// Phase 1: matrix 171 rows 207 cols
[2024-05-21 23:25:12] [INFO ] Computed 41 invariants in 6 ms
[2024-05-21 23:25:12] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 23:25:12] [INFO ] Invariant cache hit.
[2024-05-21 23:25:12] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-21 23:25:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:25:18] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 171/378 variables, 207/297 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 15/312 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/378 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 317 constraints, problems are : Problem set: 0 solved, 170 unsolved in 14611 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 69/110 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/378 variables, 207/328 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 170/498 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 5/503 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:36] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 0/378 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 509 constraints, problems are : Problem set: 0 solved, 170 unsolved in 24328 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 91/91 constraints]
After SMT, in 38970ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 38973ms
Starting structural reductions in LTL mode, iteration 1 : 207/241 places, 171/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39268 ms. Remains : 207/241 places, 171/205 transitions.
[2024-05-21 23:25:51] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:25:51] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:25:51] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-21 23:25:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:25:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:25:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13482211883111544990.gal : 4 ms
[2024-05-21 23:25:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11340733589656896588.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/CTLFireability13482211883111544990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11340733589656896588.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,9.52382e+12,0.645723,24120,2,12117,5,57988,6,0,999,102673,0


Converting to forward existential form...Done !
original formula: (E(AX((((A((((p48==1)&&(p160==1))&&(p237==1)) U (p49==1)) + AX((p201==1))) + ((p238==1)||(p11==1))) + !((((p13==1)||(p259==1))||(((p15==1...411
=> equivalent forward existential formula: ([(((FwdU(Init,!(EX(!((((!((E(!((p49==1)) U (!((((p48==1)&&(p160==1))&&(p237==1))) * !((p49==1)))) + EG(!((p49==...651
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t21, t28, t31, t34, t38, t39, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t71,...426
Hit Full ! (commute/partial/dont) 147/46/24
(forward)formula 0,1,8.50504,223816,1,0,393,739545,380,180,6146,651595,368
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 205 transition count 169
Applied a total of 72 rules in 14 ms. Remains 205 /241 variables (removed 36) and now considering 169/205 (removed 36) transitions.
// Phase 1: matrix 169 rows 205 cols
[2024-05-21 23:26:00] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:26:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 23:26:00] [INFO ] Invariant cache hit.
[2024-05-21 23:26:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-21 23:26:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:26:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:05] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 169/374 variables, 205/283 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:26:09] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:26:10] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 291 constraints, problems are : Problem set: 0 solved, 168 unsolved in 12394 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 45/86 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:15] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:26:15] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:15] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:17] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 169/374 variables, 205/310 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 168/478 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:26:19] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:26:20] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:26:20] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:26:20] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:21] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 8/486 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:24] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:26:24] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:24] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 9/495 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:28] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:28] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:29] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/374 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/374 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 500 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 86/86 constraints]
After SMT, in 42445ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 42447ms
Starting structural reductions in LTL mode, iteration 1 : 205/241 places, 169/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42696 ms. Remains : 205/241 places, 169/205 transitions.
[2024-05-21 23:26:43] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:26:43] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:26:43] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-21 23:26:43] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:26:43] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:26:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17373804026953209564.gal : 2 ms
[2024-05-21 23:26:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13607323874755818159.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/CTLFireability17373804026953209564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13607323874755818159.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,9.74036e+12,0.525113,23820,2,11852,5,57057,6,0,989,102387,0


Converting to forward existential form...Done !
original formula: (EF(AG((p112==1))) + EX(((AX((p93==1)) * (EG(EF((((p20==1)&&(p125==1))&&(p213==1)))) + (EF((p21==1)) * ((((p50==1)&&(p179==1))&&(p273==1)...224
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((p112==1)))))] != FALSE + ([FwdG(((EY(Init) * ((((p48==1)&&(p160==1))&&(p237==...424
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t35, t36, t38, t41, t44, t48, t49, t51, t54, t57, t60, t63, t66, t69, t71...403
(forward)formula 0,0,18.6368,401168,1,0,454,1.50478e+06,372,212,5921,1.6429e+06,451
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 7 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:27:02] [INFO ] Computed 41 invariants in 3 ms
[2024-05-21 23:27:02] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 23:27:02] [INFO ] Invariant cache hit.
[2024-05-21 23:27:02] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:27:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/372 variables, 204/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:06] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 14 ms to minimize.
[2024-05-21 23:27:06] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 10/279 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/372 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 290 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13436 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 45/86 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/372 variables, 204/295 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 167/462 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 9/471 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:31] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/372 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 476 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 64/64 constraints]
After SMT, in 43474ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 43486ms
Starting structural reductions in LTL mode, iteration 1 : 204/241 places, 168/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43791 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 23:27:46] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:27:46] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:27:46] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-21 23:27:46] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:27:46] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:27:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5939917956117641297.gal : 2 ms
[2024-05-21 23:27:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1364979490018070328.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/CTLFireability5939917956117641297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1364979490018070328.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.05588e+13,0.507339,23548,2,11966,5,57207,6,0,984,99305,0


Converting to forward existential form...Done !
original formula: EF(AX(AG((AF((p200==1)) * AX((p47==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((!(EG(!((p200==1)))) * !(EX(!((p47==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73...416
Detected timeout of ITS tools.
[2024-05-21 23:28:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:28:16] [INFO ] Applying decomposition
[2024-05-21 23:28:16] [INFO ] Flatten gal took : 8 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/graph17956769672933249086.txt' '-o' '/tmp/graph17956769672933249086.bin' '-w' '/tmp/graph17956769672933249086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17956769672933249086.bin' '-l' '-1' '-v' '-w' '/tmp/graph17956769672933249086.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:28:16] [INFO ] Decomposing Gal with order
[2024-05-21 23:28:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:28:16] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-21 23:28:16] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:28:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-21 23:28:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12232703806443491687.gal : 2 ms
[2024-05-21 23:28:16] [INFO ] Time to serialize properties into /tmp/CTLFireability2590280326826585347.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/CTLFireability12232703806443491687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2590280326826585347.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.05588e+13,0.08396,7012,1082,36,6609,596,405,8320,47,1444,0


Converting to forward existential form...Done !
original formula: EF(AX(AG((AF((i0.i1.u55.p200==1)) * AX((i2.u14.p47==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((!(EG(!((i0.i1.u55.p200==1)))) * !(EX(!((i2.u14.p47==1))))))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t81, t97, t101, t105, t114, t158, t160, t161, t164, i0.i0.u32.t73, i0.i1.u55.t16, i0.i1.u56.t...697
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,4.28595,158020,1,0,293823,596,2757,466729,220,1518,383299
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 10 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:28:20] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:28:20] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 23:28:20] [INFO ] Invariant cache hit.
[2024-05-21 23:28:20] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:28:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:22] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:24] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:24] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:28:24] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:24] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:25] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 4 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 168/372 variables, 204/291 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 294 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10162 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 49/90 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/372 variables, 204/294 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 167/461 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 20/481 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:36] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:36] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 53 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 13/494 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 498 constraints, problems are : Problem set: 0 solved, 167 unsolved in 28093 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 86/86 constraints]
After SMT, in 38282ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 38284ms
Starting structural reductions in LTL mode, iteration 1 : 204/241 places, 168/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38649 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 23:28:59] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:28:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:28:59] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-21 23:28:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:28:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:28:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14916753405476424723.gal : 1 ms
[2024-05-21 23:28:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14166468398326083280.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/CTLFireability14916753405476424723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14166468398326083280.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,9.50413e+12,0.50148,20908,2,11268,5,50855,6,0,984,84009,0


Converting to forward existential form...Done !
original formula: EF((AG(EF(AX((p97==0)))) * EX(((AF((((p43==0)||(p169==0))||(p273==0))) * (p163==0)) * (p16==0)))))
=> equivalent forward existential formula: [(((EY((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(EX(!((p97==0)))))))))) * (p16==0)) * (p163==0)) * !(EG(!((((p4...198
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t44, t45, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73...404
(forward)formula 0,1,6.52523,217692,1,0,600,790124,368,266,5886,718021,622
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 212 transition count 176
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 9 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:29:05] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:29:06] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 23:29:06] [INFO ] Invariant cache hit.
[2024-05-21 23:29:06] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:29:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:08] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:09] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 168/372 variables, 204/276 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 7/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 283 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9724 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 38/79 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/372 variables, 204/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 167/450 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:17] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 0 ms to minimize.
[2024-05-21 23:29:18] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 19/469 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 5/474 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:33] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:33] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/372 variables, 3/477 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 481 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 69/69 constraints]
After SMT, in 39761ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 39763ms
Starting structural reductions in LTL mode, iteration 1 : 204/241 places, 168/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40047 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 23:29:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:29:45] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:29:45] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-21 23:29:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:29:45] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17993329746834195088.gal : 15 ms
[2024-05-21 23:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17883664950415863160.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/CTLFireability17993329746834195088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17883664950415863160.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,9.51867e+12,0.406241,20908,2,11321,5,50733,6,0,984,83299,0


Converting to forward existential form...Done !
original formula: AG(((p167==0) + (((EX((p201==1)) + (p133==0)) + (((p43==1)&&(p169==1))&&(p273==1))) * (AX(AG((p56==0))) + (AG((p152==0)) * EX((p234==0)))...159
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * !((p167==0))) * !((((p43==1)&&(p169==1))&&(p273==1)))) * !((p133==0))) * !(EX((p201==1))...392
Reverse transition relation is NOT exact ! Due to transitions t10, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t63, t64, t66, t69, t71...403
(forward)formula 0,0,7.02702,230012,1,0,420,791628,364,198,6021,801449,400
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 206 transition count 170
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 206 transition count 170
Applied a total of 70 rules in 6 ms. Remains 206 /241 variables (removed 35) and now considering 170/205 (removed 35) transitions.
// Phase 1: matrix 170 rows 206 cols
[2024-05-21 23:29:53] [INFO ] Computed 41 invariants in 3 ms
[2024-05-21 23:29:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 23:29:53] [INFO ] Invariant cache hit.
[2024-05-21 23:29:53] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-21 23:29:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 5 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 170/376 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 11/288 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:00] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 298 constraints, problems are : Problem set: 0 solved, 169 unsolved in 12167 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 51/92 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:06] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:30:06] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:30:06] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/376 variables, 206/301 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 169/470 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:30:09] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 5/475 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 478 constraints, problems are : Problem set: 0 solved, 169 unsolved in 21130 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 62/62 constraints]
After SMT, in 33339ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 33340ms
Starting structural reductions in LTL mode, iteration 1 : 206/241 places, 170/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33584 ms. Remains : 206/241 places, 170/205 transitions.
[2024-05-21 23:30:26] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:30:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:30:26] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-21 23:30:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:30:26] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:30:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13958980347759666814.gal : 2 ms
[2024-05-21 23:30:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2014705369331105708.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/CTLFireability13958980347759666814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2014705369331105708.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.48696e+12,0.656538,20920,2,11452,5,51407,6,0,994,85514,0


Converting to forward existential form...Done !
original formula: A((p109!=1) U (EF((((p272==1)||(p152==1)) * AX((((p37==1)&&(p144==1))&&(p273==1))))) + E((EG(EF((p236==1))) * ((AG((p24==1)) + (((p22==1)...246
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (((p272==1)||(p152==1)) * !(EX(!((((p37==1)&&(p144==1))&&(p273==1))))))) + E((EG(E(TR...839
Reverse transition relation is NOT exact ! Due to transitions t2, t11, t14, t22, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t71,...414
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-21 23:30:56] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:30:56] [INFO ] Applying decomposition
[2024-05-21 23:30:56] [INFO ] Flatten gal took : 8 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/graph5059717580140847832.txt' '-o' '/tmp/graph5059717580140847832.bin' '-w' '/tmp/graph5059717580140847832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5059717580140847832.bin' '-l' '-1' '-v' '-w' '/tmp/graph5059717580140847832.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:30:56] [INFO ] Decomposing Gal with order
[2024-05-21 23:30:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:30:56] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-21 23:30:56] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:30:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:30:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12225909911832381711.gal : 2 ms
[2024-05-21 23:30:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2705330064480237026.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/CTLFireability12225909911832381711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2705330064480237026.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.48696e+12,0.195242,9192,1518,25,10929,245,415,16295,36,568,0


Converting to forward existential form...Done !
original formula: A((i15.u37.p109!=1) U (EF((((i16.u63.p272==1)||(i15.u47.p152==1)) * AX((((i3.u13.p37==1)&&(i12.u45.p144==1))&&(i16.u61.p273==1))))) + E((...364
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (((i16.u63.p272==1)||(i15.u47.p152==1)) * !(EX(!((((i3.u13.p37==1)&&(i12.u45.p144==1)...1177
Reverse transition relation is NOT exact ! Due to transitions t84, t104, t108, t116, t121, t160, t163, t166, i1.t80, i1.u27.t87, i1.u29.t83, i2.u23.t95, i3...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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,23.9955,636984,1,0,1.10828e+06,245,2943,1.64573e+06,179,568,1034471
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 217 transition count 181
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 217 transition count 181
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 210 transition count 174
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 210 transition count 174
Applied a total of 62 rules in 5 ms. Remains 210 /241 variables (removed 31) and now considering 174/205 (removed 31) transitions.
// Phase 1: matrix 174 rows 210 cols
[2024-05-21 23:31:21] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:31:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:31:21] [INFO ] Invariant cache hit.
[2024-05-21 23:31:21] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-21 23:31:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 3 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 174/384 variables, 210/285 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 9/294 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 303 constraints, problems are : Problem set: 0 solved, 173 unsolved in 18307 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 52/93 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 174/384 variables, 210/328 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 173/501 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 14/515 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:57] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:31:58] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 531 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 107/107 constraints]
After SMT, in 48349ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 48350ms
Starting structural reductions in LTL mode, iteration 1 : 210/241 places, 174/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48600 ms. Remains : 210/241 places, 174/205 transitions.
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:32:09] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:32:09] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:32:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8764291993649379521.gal : 1 ms
[2024-05-21 23:32:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14853837027199790731.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/CTLFireability8764291993649379521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14853837027199790731.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.6463e+12,0.728225,25712,2,12548,5,60037,6,0,1014,113864,0


Converting to forward existential form...Done !
original formula: EF((A((((((p118==1)&&(p127==1))&&((p171==1)||(p172==1))) + AG((p264==1))) * (((E((p3==1) U (p13==1)) + (p72==1)) + ((((p55==1)&&(p175==1)...315
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((p245==1) * (!(EX(!((p197==1)))) + !(EX(!((p8==1)))))))))) * !(E(!(((p245==1) * (!...570
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t11, t22, t30, t33, t37, t38, t40, t43, t47, t48, t50, t53, t56, t59, t62, t65, t...433
Detected timeout of ITS tools.
[2024-05-21 23:32:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:32:39] [INFO ] Applying decomposition
[2024-05-21 23:32:39] [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/graph2923635201006406929.txt' '-o' '/tmp/graph2923635201006406929.bin' '-w' '/tmp/graph2923635201006406929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2923635201006406929.bin' '-l' '-1' '-v' '-w' '/tmp/graph2923635201006406929.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:32:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:32:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:32:39] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-21 23:32:39] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:32:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8552661908490637224.gal : 2 ms
[2024-05-21 23:32:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11318241822057925317.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/CTLFireability8552661908490637224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11318241822057925317.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.6463e+12,0.075587,7632,1057,24,7921,300,439,10721,39,916,0


Converting to forward existential form...Done !
original formula: EF((A((((((i14.i0.u40.p118==1)&&(i14.i1.u43.p127==1))&&((i15.u52.p171==1)||(i11.i1.u53.p172==1))) + AG((i17.u59.p264==1))) * (((E((i10.u1...493
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((i17.u68.p245==1) * (!(EX(!((i17.u75.p197==1)))) + !(EX(!((i2.u3.p8==1)))))))))) *...792
Reverse transition relation is NOT exact ! Due to transitions t84, t104, t108, t120, t164, t166, t167, t170, i0.u33.t80, i0.u57.t33, i0.u58.t30, i1.t88, i1...748
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 a local 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
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,5.27692,192432,1,0,362020,300,3050,544987,179,916,466864
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 210 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 202 transition count 166
Applied a total of 78 rules in 5 ms. Remains 202 /241 variables (removed 39) and now considering 166/205 (removed 39) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-21 23:32:45] [INFO ] Computed 41 invariants in 10 ms
[2024-05-21 23:32:45] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 23:32:45] [INFO ] Invariant cache hit.
[2024-05-21 23:32:45] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-21 23:32:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 2 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 8818 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 488 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 80/80 constraints]
After SMT, in 38867ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 38869ms
Starting structural reductions in LTL mode, iteration 1 : 202/241 places, 166/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39305 ms. Remains : 202/241 places, 166/205 transitions.
[2024-05-21 23:33:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:33:24] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-21 23:33:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:33:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:33:24] [INFO ] Time to serialize gal into /tmp/CTLFireability10702054898954215540.gal : 1 ms
[2024-05-21 23:33:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6202465075164250004.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/CTLFireability10702054898954215540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6202465075164250004.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.38735e+12,0.371429,20104,2,11047,5,49659,6,0,974,80406,0


Converting to forward existential form...Done !
original formula: AX(AG((p78==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p78==0)))] = FALSE
(forward)formula 0,0,0.602121,22216,1,0,10,59515,10,2,1955,95207,4
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 210 transition count 174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 202 transition count 166
Applied a total of 78 rules in 5 ms. Remains 202 /241 variables (removed 39) and now considering 166/205 (removed 39) transitions.
[2024-05-21 23:33:25] [INFO ] Invariant cache hit.
[2024-05-21 23:33:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 23:33:25] [INFO ] Invariant cache hit.
[2024-05-21 23:33:25] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-21 23:33:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 9977 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:41] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:34:01] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 40018ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40020ms
Starting structural reductions in LTL mode, iteration 1 : 202/241 places, 166/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40275 ms. Remains : 202/241 places, 166/205 transitions.
[2024-05-21 23:34:05] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:34:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:05] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-21 23:34:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14598269619067703706.gal : 1 ms
[2024-05-21 23:34:05] [INFO ] Time to serialize properties into /tmp/CTLFireability546606566413276718.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/CTLFireability14598269619067703706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability546606566413276718.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.38735e+12,0.346259,20104,2,11047,5,49659,6,0,974,80406,0


Converting to forward existential form...Done !
original formula: EF(EX(AG(AX((p152==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(!(EX(!((p152==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t69, t72, t75...398
(forward)formula 0,1,5.90342,199552,1,0,373,727417,354,172,5827,690837,347
FORMULA BusinessProcesses-PT-03-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 203 transition count 167
Applied a total of 76 rules in 5 ms. Remains 203 /241 variables (removed 38) and now considering 167/205 (removed 38) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-05-21 23:34:11] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:34:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 23:34:11] [INFO ] Invariant cache hit.
[2024-05-21 23:34:11] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-21 23:34:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 167/370 variables, 203/273 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 13/286 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 0/370 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 287 constraints, problems are : Problem set: 0 solved, 166 unsolved in 9941 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 43/84 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/370 variables, 203/297 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 166/463 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 7/470 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:27] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/370 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 14 (OVERLAPS) 0/370 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 475 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 65/65 constraints]
After SMT, in 39968ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 39969ms
Starting structural reductions in LTL mode, iteration 1 : 203/241 places, 167/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40222 ms. Remains : 203/241 places, 167/205 transitions.
[2024-05-21 23:34:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:51] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-21 23:34:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2607911106605822349.gal : 1 ms
[2024-05-21 23:34:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15399102181396850810.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/CTLFireability2607911106605822349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15399102181396850810.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.61484e+12,0.480601,20640,2,11199,5,50386,6,0,979,82457,0


Converting to forward existential form...Done !
original formula: EF(EX(AG(!(E((p156==1) U (p273==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(!(E((p156==1) U (p273==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t50, t51, t53, t56, t59, t62, t65, t68, t70, t73...398
(forward)formula 0,1,8.01801,243688,1,0,439,930224,359,208,5848,957716,421
FORMULA BusinessProcesses-PT-03-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Graph (trivial) has 138 edges and 241 vertex of which 6 / 241 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 475 edges and 236 vertex of which 235 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 234 transition count 155
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 192 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 191 transition count 154
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 88 place count 191 transition count 115
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 176 place count 142 transition count 115
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 204 place count 114 transition count 87
Ensure Unique test removed 2 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 234 place count 112 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 234 place count 112 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 238 place count 110 transition count 85
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 328 place count 65 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 62 transition count 38
Applied a total of 332 rules in 54 ms. Remains 62 /241 variables (removed 179) and now considering 38/205 (removed 167) transitions.
// Phase 1: matrix 38 rows 62 cols
[2024-05-21 23:34:59] [INFO ] Computed 28 invariants in 0 ms
[2024-05-21 23:34:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 23:34:59] [INFO ] Invariant cache hit.
[2024-05-21 23:34:59] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 45]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 122 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/241 places, 38/205 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 37
Applied a total of 2 rules in 4 ms. Remains 48 /49 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 48 cols
[2024-05-21 23:34:59] [INFO ] Computed 15 invariants in 0 ms
[2024-05-21 23:34:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 23:34:59] [INFO ] Invariant cache hit.
[2024-05-21 23:34:59] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/241 places, 37/205 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 294 ms. Remains : 48/241 places, 37/205 transitions.
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:34:59] [INFO ] Input system was already deterministic with 37 transitions.
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:34:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:34:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16858811397860531626.gal : 7 ms
[2024-05-21 23:34:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11091584956059263490.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/CTLFireability16858811397860531626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11091584956059263490.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,58,0.008203,3676,2,274,5,1135,6,0,228,995,0


Converting to forward existential form...Done !
original formula: AG((AG(EF((p187==1))) + (p247==1)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((p247==1))),TRUE) * !(E(TRUE U (p187==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t17, t19, t35, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,0.027413,5052,1,0,60,4534,97,43,1532,3350,89
FORMULA BusinessProcesses-PT-03-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 213 transition count 177
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 207 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 207 transition count 171
Applied a total of 68 rules in 11 ms. Remains 207 /241 variables (removed 34) and now considering 171/205 (removed 34) transitions.
// Phase 1: matrix 171 rows 207 cols
[2024-05-21 23:35:00] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:35:00] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 23:35:00] [INFO ] Invariant cache hit.
[2024-05-21 23:35:00] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-21 23:35:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 171/378 variables, 207/279 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 286 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9432 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 38/79 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:10] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/378 variables, 207/294 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 170/464 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:13] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:35:14] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 7/471 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 5/476 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:31] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/378 variables, 3/490 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 492 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 74/74 constraints]
After SMT, in 39467ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 39469ms
Starting structural reductions in LTL mode, iteration 1 : 207/241 places, 171/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39789 ms. Remains : 207/241 places, 171/205 transitions.
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:35:39] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:35:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:35:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13544369208025029414.gal : 1 ms
[2024-05-21 23:35:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2685700323000981804.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/CTLFireability13544369208025029414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2685700323000981804.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.57673e+12,0.427171,22016,2,11933,5,52963,6,0,999,89452,0


Converting to forward existential form...Done !
original formula: A(((!(AF(((AX((p137==1)) * (p83==1)) * EX((p102==1))))) + AF(((EG((p252==1)) * AF((p167==1))) * ((p12==1)&&(p177==1))))) + (EF(AG((p75==1...319
=> equivalent forward existential formula: [((Init * !(EG(!(!(E((!(E(TRUE U !(E(TRUE U (p127==1))))) + (p32==1)) U (E((p127==1) U ((p12==1)||(p18==1))) * E...776
Reverse transition relation is NOT exact ! Due to transitions t7, t13, t21, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t59, t60, t62, t65, t68, t71,...408
Detected timeout of ITS tools.
[2024-05-21 23:36:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:36:09] [INFO ] Applying decomposition
[2024-05-21 23:36:09] [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/graph5591821591756835181.txt' '-o' '/tmp/graph5591821591756835181.bin' '-w' '/tmp/graph5591821591756835181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5591821591756835181.bin' '-l' '-1' '-v' '-w' '/tmp/graph5591821591756835181.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:09] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:09] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-21 23:36:10] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:36:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13294007663459386552.gal : 1 ms
[2024-05-21 23:36:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17475399531999597197.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/CTLFireability13294007663459386552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17475399531999597197.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,9.57673e+12,0.179398,12356,1787,35,14676,392,437,28066,47,924,0


Converting to forward existential form...Done !
original formula: A(((!(AF(((AX((i13.i0.u44.p137==1)) * (i16.u27.p83==1)) * EX((i10.u34.p102==1))))) + AF(((EG((i18.u57.p252==1)) * AF((i11.u51.p167==1))) ...465
=> equivalent forward existential formula: [((Init * !(EG(!(!(E((!(E(TRUE U !(E(TRUE U (i12.u42.p127==1))))) + (i1.u11.p32==1)) U (E((i12.u42.p127==1) U ((...1070
Reverse transition relation is NOT exact ! Due to transitions t84, t100, t104, t108, t116, t122, t161, t167, i0.u21.t99, i0.u23.t95, i1.u11.t119, i1.u11.t1...695
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,19.7065,603596,1,0,1.09808e+06,487,3202,1.88509e+06,231,924,1223188
FORMULA BusinessProcesses-PT-03-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 205/205 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 211 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 211 transition count 175
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 204 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 204 transition count 168
Applied a total of 74 rules in 7 ms. Remains 204 /241 variables (removed 37) and now considering 168/205 (removed 37) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:36:29] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:36:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 23:36:29] [INFO ] Invariant cache hit.
[2024-05-21 23:36:30] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:36:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/283 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 11/294 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:36:40] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:36:40] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/372 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 297 constraints, problems are : Problem set: 0 solved, 167 unsolved in 12783 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 52/93 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/372 variables, 204/304 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 167/471 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 11/482 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 6/489 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/372 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 491 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 79/79 constraints]
After SMT, in 42817ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 42820ms
Starting structural reductions in LTL mode, iteration 1 : 204/241 places, 168/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43095 ms. Remains : 204/241 places, 168/205 transitions.
[2024-05-21 23:37:12] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:37:12] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:37:12] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-21 23:37:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:37:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:37:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5053818461832931610.gal : 2 ms
[2024-05-21 23:37:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7009595681740711812.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/CTLFireability5053818461832931610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7009595681740711812.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.64591e+12,0.532992,21696,2,12613,5,53619,6,0,984,87156,0


Converting to forward existential form...Done !
original formula: EG(((p51==1) + (AG(EX((p68==0))) * (((p62==0)||(p185==0))||(p249==0)))))
=> equivalent forward existential formula: [FwdG(Init,((p51==1) + (!(E(TRUE U !(EX((p68==0))))) * (((p62==0)||(p185==0))||(p249==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t69, t72, t75...404
(forward)formula 0,0,18.7506,592628,1,0,473,2.40619e+06,365,223,5886,2.57491e+06,473
FORMULA BusinessProcesses-PT-03-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 23:37:31] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:37:31] [INFO ] Flatten gal took : 4 ms
Total runtime 959965 ms.

BK_STOP 1716334652013

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="BusinessProcesses-PT-03"
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 BusinessProcesses-PT-03, 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 r048-tajo-171620399600466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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