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-171620399500458.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-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399500458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.8K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 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 59K 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-02-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716333603926

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:20:05] [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:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:20:05] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-21 23:20:05] [INFO ] Transformed 262 places.
[2024-05-21 23:20:05] [INFO ] Transformed 219 transitions.
[2024-05-21 23:20:05] [INFO ] Found NUPN structural information;
[2024-05-21 23:20:05] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 131 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 16 place count 229 transition count 194
Iterating global reduction 1 with 10 rules applied. Total rules applied 26 place count 229 transition count 194
Applied a total of 26 rules in 30 ms. Remains 229 /245 variables (removed 16) and now considering 194/204 (removed 10) transitions.
// Phase 1: matrix 194 rows 229 cols
[2024-05-21 23:20:05] [INFO ] Computed 37 invariants in 22 ms
[2024-05-21 23:20:05] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-21 23:20:05] [INFO ] Invariant cache hit.
[2024-05-21 23:20:06] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-21 23:20:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 30 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 3 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:20:11] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:15] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:20:15] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:20:15] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:15] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/423 variables, 229/334 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:19] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:20:19] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:20:20] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:20:20] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:20:20] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:21] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:20:21] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:24] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:26] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 23675 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:31] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:20:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 194/423 variables, 229/345 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 193/538 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:20:35] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:35] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:35] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:20:35] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:20:35] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 6/544 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:39] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:20:39] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:20:39] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:20:39] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:20:39] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:40] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:20:41] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 7/551 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:51] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:20:51] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 555 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 96/96 constraints]
After SMT, in 53777ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 53793ms
Starting structural reductions in LTL mode, iteration 1 : 229/245 places, 194/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54384 ms. Remains : 229/245 places, 194/204 transitions.
Support contains 131 out of 229 places after structural reductions.
[2024-05-21 23:21:00] [INFO ] Flatten gal took : 37 ms
[2024-05-21 23:21:00] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:21:00] [INFO ] Input system was already deterministic with 194 transitions.
Support contains 125 out of 229 places (down from 131) after GAL structural reductions.
RANDOM walk for 40000 steps (552 resets) in 2608 ms. (15 steps per ms) remains 27/87 properties
BEST_FIRST walk for 4004 steps (9 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (10 resets) in 47 ms. (83 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (11 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (11 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
[2024-05-21 23:21:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 83/131 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 40/171 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 26/197 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 176/373 variables, 197/234 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 9 (OVERLAPS) 44/417 variables, 29/263 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
Problem AtomicPropp64 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 20/283 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 6/423 variables, 3/286 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 1/287 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/287 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/423 variables, 3/290 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 290 constraints, problems are : Problem set: 2 solved, 25 unsolved in 3252 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 2 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 75/112 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 55/167 variables, 11/26 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 3/35 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 27/194 variables, 13/48 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 12/60 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/61 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 172/366 variables, 194/255 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 15/270 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 2/272 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 0/272 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 50/416 variables, 31/303 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/416 variables, 10/313 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 6/319 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 3 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/416 variables, 19/338 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/416 variables, 0/338 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 21 (OVERLAPS) 7/423 variables, 4/342 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/423 variables, 0/342 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 23 (OVERLAPS) 0/423 variables, 0/342 constraints. Problems are: Problem set: 2 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 342 constraints, problems are : Problem set: 2 solved, 25 unsolved in 4037 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 25/27 constraints, Known Traps: 51/51 constraints]
After SMT, in 7298ms problems are : Problem set: 2 solved, 25 unsolved
Parikh walk visited 17 properties in 5250 ms.
Support contains 10 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 114 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 418 edges and 223 vertex of which 217 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 35 rules applied. Total rules applied 37 place count 217 transition count 144
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 182 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 181 transition count 143
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 74 place count 181 transition count 107
Deduced a syphon composed of 36 places in 9 ms
Ensure Unique test removed 6 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 152 place count 139 transition count 107
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 174 place count 117 transition count 85
Iterating global reduction 3 with 22 rules applied. Total rules applied 196 place count 117 transition count 85
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 278 place count 75 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 75 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 74 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 74 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 73 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 283 place count 72 transition count 43
Applied a total of 283 rules in 82 ms. Remains 72 /229 variables (removed 157) and now considering 43/194 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 72/229 places, 43/194 transitions.
RANDOM walk for 659 steps (22 resets) in 37 ms. (17 steps per ms) remains 0/8 properties
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-21 23:21:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:21:13] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:21:13] [INFO ] Input system was already deterministic with 194 transitions.
Computed a total of 221 stabilizing places and 184 stable transitions
Graph (complete) has 426 edges and 229 vertex of which 223 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 198 transition count 163
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 198 transition count 163
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 188 transition count 153
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 188 transition count 153
Applied a total of 82 rules in 15 ms. Remains 188 /229 variables (removed 41) and now considering 153/194 (removed 41) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-05-21 23:21:14] [INFO ] Computed 37 invariants in 5 ms
[2024-05-21 23:21:14] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:21:14] [INFO ] Invariant cache hit.
[2024-05-21 23:21:14] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-21 23:21:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:21:15] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:16] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/240 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:21:18] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 242 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6794 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/242 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/394 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 9/403 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:21:25] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:21:25] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:21:25] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:21:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:21:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 408 constraints, problems are : Problem set: 0 solved, 152 unsolved in 14674 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 31/31 constraints]
After SMT, in 21492ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 21495ms
Starting structural reductions in LTL mode, iteration 1 : 188/229 places, 153/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21741 ms. Remains : 188/229 places, 153/194 transitions.
[2024-05-21 23:21:35] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:21:35] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:21:35] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-21 23:21:35] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:21:35] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:21:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1249848646005394561.gal : 5 ms
[2024-05-21 23:21:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9029343955508062315.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/CTLFireability1249848646005394561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9029343955508062315.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.46025e+12,0.480271,15416,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: !(E(((!(((p66==1)&&(p169==1))&&(p239==1)))||(p86==1)) U AX((p0==1))))
=> equivalent forward existential formula: [(FwdU(Init,((!(((p66==1)&&(p169==1))&&(p239==1)))||(p86==1))) * !(EX(!((p0==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t64, t67, t70, t72, t75, t79,...334
Hit Full ! (commute/partial/dont) 147/0/6
(forward)formula 0,0,9.13508,213448,1,0,330,697461,330,156,5304,584435,316
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 191 transition count 156
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 191 transition count 156
Applied a total of 76 rules in 41 ms. Remains 191 /229 variables (removed 38) and now considering 156/194 (removed 38) transitions.
// Phase 1: matrix 156 rows 191 cols
[2024-05-21 23:21:45] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 23:21:45] [INFO ] Implicit Places using invariants in 699 ms returned []
[2024-05-21 23:21:45] [INFO ] Invariant cache hit.
[2024-05-21 23:21:46] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-21 23:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:51] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:21:51] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:21:51] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:21:51] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:21:52] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:21:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:21:52] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 156/347 variables, 191/255 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:21:55] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 12/267 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:21:57] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/347 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (OVERLAPS) 0/347 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 271 constraints, problems are : Problem set: 0 solved, 155 unsolved in 14198 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:22:01] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 156/347 variables, 191/273 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 155/428 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:22:03] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:22:07] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:07] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (OVERLAPS) 0/347 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 431 constraints, problems are : Problem set: 0 solved, 155 unsolved in 18030 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 48/48 constraints]
After SMT, in 32257ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 32261ms
Starting structural reductions in LTL mode, iteration 1 : 191/229 places, 156/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33255 ms. Remains : 191/229 places, 156/194 transitions.
[2024-05-21 23:22:18] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:22:18] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:22:18] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-21 23:22:18] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:22:18] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:22:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11979286606465182832.gal : 3 ms
[2024-05-21 23:22:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12138235806197386870.ctl : 8 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/CTLFireability11979286606465182832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12138235806197386870.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87932e+12,0.453741,16028,2,13439,5,42071,6,0,920,38692,0


Converting to forward existential form...Done !
original formula: (EX(AG(E((p219!=1) U (p228==1)))) * ((EF((p111==1)) + EG((p116==1))) + A((A((p109==1) U AG((p176==1))) * AX(E((p65==1) U (p171==1)))) U (...165
=> equivalent forward existential formula: (([(FwdU((Init * EX(!(E(TRUE U !(E((p219!=1) U (p228==1))))))),TRUE) * (p111==1))] != FALSE + [FwdG((Init * EX(!...510
Reverse transition relation is NOT exact ! Due to transitions t2, t15, t21, t26, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t66, t69, t72, t73, t75,...344
Detected timeout of ITS tools.
[2024-05-21 23:22:48] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:22:48] [INFO ] Applying decomposition
[2024-05-21 23:22:48] [INFO ] Flatten gal took : 12 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/graph4113296177224555721.txt' '-o' '/tmp/graph4113296177224555721.bin' '-w' '/tmp/graph4113296177224555721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4113296177224555721.bin' '-l' '-1' '-v' '-w' '/tmp/graph4113296177224555721.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:22:48] [INFO ] Decomposing Gal with order
[2024-05-21 23:22:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:22:48] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 23:22:49] [INFO ] Flatten gal took : 107 ms
[2024-05-21 23:22:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 23:22:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4539331635067585845.gal : 11 ms
[2024-05-21 23:22:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11455643019185888103.ctl : 4 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/CTLFireability4539331635067585845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11455643019185888103.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.87932e+12,0.158096,7968,1049,50,9492,716,413,10940,51,1557,0


Converting to forward existential form...Done !
original formula: (EX(AG(E((i3.i0.u57.p219!=1) U (i15.u59.p228==1)))) * ((EF((i13.u37.p111==1)) + EG((i14.u39.p116==1))) + A((A((i13.u36.p109==1) U AG((i12...236
=> equivalent forward existential formula: (([(FwdU((Init * EX(!(E(TRUE U !(E((i3.i0.u57.p219!=1) U (i15.u59.p228==1))))))),TRUE) * (i13.u37.p111==1))] != ...647
Reverse transition relation is NOT exact ! Due to transitions t95, t99, t105, t115, i0.u51.t36, i0.u52.t33, i0.u53.t30, i1.u49.t42, i2.u24.t90, i2.u45.t54,...574
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
(forward)formula 0,0,6.68167,165312,1,0,335004,1424,2808,457190,284,7056,453693
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 129 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 419 edges and 223 vertex of which 217 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 216 transition count 137
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 173 transition count 137
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 88 place count 173 transition count 100
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 170 place count 128 transition count 100
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 197 place count 101 transition count 73
Iterating global reduction 2 with 27 rules applied. Total rules applied 224 place count 101 transition count 73
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 304 place count 60 transition count 34
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 2 with 2 rules applied. Total rules applied 306 place count 59 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 58 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 308 place count 57 transition count 32
Applied a total of 308 rules in 44 ms. Remains 57 /229 variables (removed 172) and now considering 32/194 (removed 162) transitions.
// Phase 1: matrix 32 rows 57 cols
[2024-05-21 23:22:55] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 23:22:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 23:22:55] [INFO ] Invariant cache hit.
[2024-05-21 23:22:55] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [0, 1, 2, 3, 6, 8, 11, 12, 13, 14, 15, 17, 19, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 153 ms to find 25 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/229 places, 32/194 transitions.
Graph (complete) has 63 edges and 32 vertex of which 30 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 30 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 24 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 22 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 22 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 19 transition count 21
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 2 with 2 rules applied. Total rules applied 24 place count 18 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 18 transition count 19
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 17 transition count 18
Applied a total of 27 rules in 6 ms. Remains 17 /32 variables (removed 15) and now considering 18/32 (removed 14) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-21 23:22:55] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 23:22:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 23:22:56] [INFO ] Invariant cache hit.
[2024-05-21 23:22:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 17/229 places, 18/194 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 259 ms. Remains : 17/229 places, 18/194 transitions.
[2024-05-21 23:22:56] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:22:56] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:22:56] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 1231 steps (505 resets) in 7 ms. (153 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:22:56] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:22:56] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:22:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12276377144679153043.gal : 1 ms
[2024-05-21 23:22:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15789746278247461646.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12276377144679153043.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15789746278247461646.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 205 transition count 170
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 205 transition count 170
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 199 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 199 transition count 164
Applied a total of 60 rules in 24 ms. Remains 199 /229 variables (removed 30) and now considering 164/194 (removed 30) transitions.
// Phase 1: matrix 164 rows 199 cols
[2024-05-21 23:22:56] [INFO ] Computed 37 invariants in 4 ms
[2024-05-21 23:22:56] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 23:22:56] [INFO ] Invariant cache hit.
[2024-05-21 23:22:56] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-21 23:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 3 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 164/363 variables, 199/264 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 4 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (OVERLAPS) 0/363 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 272 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11698 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 164/363 variables, 199/275 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 163/438 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:23:19] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/363 variables, and 453 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 54/54 constraints]
After SMT, in 41774ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 41785ms
Starting structural reductions in LTL mode, iteration 1 : 199/229 places, 164/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42281 ms. Remains : 199/229 places, 164/194 transitions.
[2024-05-21 23:23:38] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:23:38] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:23:38] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-21 23:23:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:23:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:23:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6692147580435675580.gal : 9 ms
[2024-05-21 23:23:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16168804412730717845.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/CTLFireability6692147580435675580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16168804412730717845.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4774e+12,0.31973,17152,2,14276,5,44552,6,0,960,42977,0


Converting to forward existential form...Done !
original formula: (A(((((EF((p176==1)) + !((EF((((p18==1)&&(p129==1))&&(p212==1))) * (p237!=1)))) + (p221==1)) * AF((((p130==1)||(p221==1))||(p171==1)))) *...393
=> equivalent forward existential formula: ([FwdG((Init * !(!((E(!(((!((E(!(!(EX(!((p47==1))))) U (!((p85==1)) * !(!(EX(!((p47==1))))))) + EG(!(!(EX(!((p47...2859
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t10, t13, t20, t23, t26, t31, t36, t37, t39, t42, t45, t48, t51, t54, t57, t60, t63, ...378
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-21 23:24:08] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:24:08] [INFO ] Applying decomposition
[2024-05-21 23:24:08] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14598744737740814944.txt' '-o' '/tmp/graph14598744737740814944.bin' '-w' '/tmp/graph14598744737740814944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14598744737740814944.bin' '-l' '-1' '-v' '-w' '/tmp/graph14598744737740814944.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:24:08] [INFO ] Decomposing Gal with order
[2024-05-21 23:24:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:24:08] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-21 23:24:08] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:24:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-21 23:24:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7967220630608312754.gal : 5 ms
[2024-05-21 23:24:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10359000091517511974.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/CTLFireability7967220630608312754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10359000091517511974.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.4774e+12,0.208501,8056,1365,53,9019,663,465,10081,59,2053,0


Converting to forward existential form...Done !
original formula: (A(((((EF((i17.u51.p176==1)) + !((EF((((u6.p18==1)&&(i14.i1.u40.p129==1))&&(i3.u59.p212==1))) * (i16.u64.p237!=1)))) + (i16.u58.p221==1))...580
=> equivalent forward existential formula: ([FwdG((Init * !(!((E(!(((!((E(!(!(EX(!((i7.u17.p47==1))))) U (!((i0.u27.p85==1)) * !(!(EX(!((i7.u17.p47==1)))))...3832
Reverse transition relation is NOT exact ! Due to transitions t101, t105, t111, t117, i0.u26.t92, i0.u45.t63, i1.u24.t96, i1.u28.t88, i3.t123, i3.u5.t129, ...644
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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 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 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,13.747,319840,1,0,670254,1277,3266,920527,325,7032,1089559
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 190 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 190 transition count 155
Applied a total of 78 rules in 29 ms. Remains 190 /229 variables (removed 39) and now considering 155/194 (removed 39) transitions.
// Phase 1: matrix 155 rows 190 cols
[2024-05-21 23:24:22] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 23:24:22] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 23:24:22] [INFO ] Invariant cache hit.
[2024-05-21 23:24:23] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-21 23:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 155/345 variables, 190/258 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 9/267 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 267 constraints, problems are : Problem set: 0 solved, 154 unsolved in 9567 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 155/345 variables, 190/279 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 154/433 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 13 (OVERLAPS) 0/345 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 438 constraints, problems are : Problem set: 0 solved, 154 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 57/57 constraints]
After SMT, in 29614ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 29617ms
Starting structural reductions in LTL mode, iteration 1 : 190/229 places, 155/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30047 ms. Remains : 190/229 places, 155/194 transitions.
[2024-05-21 23:24:52] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:24:52] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:24:52] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-21 23:24:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:24:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:24:52] [INFO ] Time to serialize gal into /tmp/CTLFireability17623791231942637020.gal : 1 ms
[2024-05-21 23:24:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3677162296519226647.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/CTLFireability17623791231942637020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3677162296519226647.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.286244,15788,2,13340,5,41648,6,0,915,38529,0


Converting to forward existential form...Done !
original formula: EX(A(!(EX((p32==1))) U EF((p217==1))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U (p217==1)))))) * !(E(!(E(TRUE U (p217==1))) U (!(!(EX((p32==1)))) * !(E(TRUE U (p2...177
Reverse transition relation is NOT exact ! Due to transitions t2, t16, t20, t25, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t65, t68, t71, t73, t76,...351
Detected timeout of ITS tools.
[2024-05-21 23:25:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:25:22] [INFO ] Applying decomposition
[2024-05-21 23:25:22] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph77787676316298240.txt' '-o' '/tmp/graph77787676316298240.bin' '-w' '/tmp/graph77787676316298240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph77787676316298240.bin' '-l' '-1' '-v' '-w' '/tmp/graph77787676316298240.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:25:22] [INFO ] Decomposing Gal with order
[2024-05-21 23:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:25:22] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:25:22] [INFO ] Flatten gal took : 86 ms
[2024-05-21 23:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:25:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16428187377418315014.gal : 7 ms
[2024-05-21 23:25:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6256683593878836564.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/CTLFireability16428187377418315014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6256683593878836564.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.46025e+12,0.117664,7144,1037,42,7032,441,412,8012,53,1286,0


Converting to forward existential form...Done !
original formula: EX(A(!(EX((i2.u10.p32==1))) U EF((i16.u53.p217==1))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U (i16.u53.p217==1)))))) * !(E(!(E(TRUE U (i16.u53.p217==1))) U (!(!(EX((i2.u10.p32=...208
Reverse transition relation is NOT exact ! Due to transitions t93, t97, t103, t114, i0.u25.t84, i1.u19.t96, i1.u21.t92, i2.t109, i2.u6.t120, i2.u10.t111, i...588
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 2
Fast SCC detection found an SCC at level 3
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
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 2
Fast SCC detection found an SCC at level 3
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
(forward)formula 0,1,7.64968,171880,1,0,317027,858,2808,722335,274,5082,405681
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-04 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 : 229/229 places, 194/194 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 201 transition count 166
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 201 transition count 166
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 192 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 192 transition count 157
Applied a total of 74 rules in 38 ms. Remains 192 /229 variables (removed 37) and now considering 157/194 (removed 37) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-05-21 23:25:30] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 23:25:30] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-21 23:25:30] [INFO ] Invariant cache hit.
[2024-05-21 23:25:31] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-21 23:25:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:32] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 157/349 variables, 192/264 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:39] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (OVERLAPS) 0/349 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 272 constraints, problems are : Problem set: 0 solved, 156 unsolved in 13421 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 157/349 variables, 192/276 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 156/432 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:54] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 5 ms to minimize.
[2024-05-21 23:25:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:26:01] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:26:08] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/349 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/349 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 443 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 58/58 constraints]
After SMT, in 43475ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 43477ms
Starting structural reductions in LTL mode, iteration 1 : 192/229 places, 157/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43928 ms. Remains : 192/229 places, 157/194 transitions.
[2024-05-21 23:26:14] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:26:14] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:26:14] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-21 23:26:14] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:26:14] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:26:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17969103194022515590.gal : 14 ms
[2024-05-21 23:26:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6281295007673832273.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/CTLFireability17969103194022515590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6281295007673832273.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46872e+12,0.29749,16328,2,13504,5,42193,6,0,925,39179,0


Converting to forward existential form...Done !
original formula: EF(((EX((((EX((p113==1)) + (p19==1)) + (p237==1)) * AX((p74==0)))) + EF(AX(AF((p172==1))))) + ((p132==1)||(((p84==1)&&(p144==1))&&(p247==...161
=> equivalent forward existential formula: (([((EY(FwdU(Init,TRUE)) * ((EX((p113==1)) + (p19==1)) + (p237==1))) * !(EX(!((p74==0)))))] != FALSE + [(FwdU(Fw...300
Reverse transition relation is NOT exact ! Due to transitions t2, t10, t21, t26, t30, t33, t36, t39, t43, t44, t46, t49, t52, t55, t58, t68, t69, t71, t74,...350
(forward)formula 0,1,12.8221,231384,1,0,345,740017,334,165,5253,598667,329
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 202 transition count 167
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 202 transition count 167
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 192 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 192 transition count 157
Applied a total of 74 rules in 13 ms. Remains 192 /229 variables (removed 37) and now considering 157/194 (removed 37) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-05-21 23:26:27] [INFO ] Computed 37 invariants in 8 ms
[2024-05-21 23:26:27] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 23:26:27] [INFO ] Invariant cache hit.
[2024-05-21 23:26:27] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-21 23:26:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:29] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:26:29] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:26:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:29] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:26:30] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:26:32] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:33] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:34] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 157/349 variables, 192/258 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 7/265 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (OVERLAPS) 0/349 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 265 constraints, problems are : Problem set: 0 solved, 156 unsolved in 12326 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/349 variables, 192/265 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 156/421 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/349 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 427 constraints, problems are : Problem set: 0 solved, 156 unsolved in 18513 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 42/42 constraints]
After SMT, in 30863ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 30865ms
Starting structural reductions in LTL mode, iteration 1 : 192/229 places, 157/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31192 ms. Remains : 192/229 places, 157/194 transitions.
[2024-05-21 23:26:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:26:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:26:58] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-21 23:26:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:26:58] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5754496937031254208.gal : 2 ms
[2024-05-21 23:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10216896216807605994.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/CTLFireability5754496937031254208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10216896216807605994.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4753e+12,0.419042,16068,2,13393,5,41764,6,0,925,39061,0


Converting to forward existential form...Done !
original formula: A((AX(EG((p147==1))) * ((E(!(EX((p172==1))) U !((((p49==1)&&(p179==1))&&(p256==1)))) + EX(AF((((p55==1)&&(p193==1))&&(p255==1))))) + ((p2...237
=> equivalent forward existential formula: [((Init * !(EG(!((p230==1))))) * !(E(!((p230==1)) U (!((!(EX(!(EG((p147==1))))) * ((E(!(EX((p172==1))) U !((((p4...344
Reverse transition relation is NOT exact ! Due to transitions t14, t15, t21, t26, t30, t33, t36, t39, t43, t44, t46, t49, t52, t55, t59, t60, t68, t71, t74...351
Detected timeout of ITS tools.
[2024-05-21 23:27:28] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:27:28] [INFO ] Applying decomposition
[2024-05-21 23:27:28] [INFO ] Flatten gal took : 9 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/graph4620192171810540455.txt' '-o' '/tmp/graph4620192171810540455.bin' '-w' '/tmp/graph4620192171810540455.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4620192171810540455.bin' '-l' '-1' '-v' '-w' '/tmp/graph4620192171810540455.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:29] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 23:27:29] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:27:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:27:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3890985927692257545.gal : 3 ms
[2024-05-21 23:27:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6758140672599029408.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/CTLFireability3890985927692257545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6758140672599029408.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4753e+12,0.126557,8008,1242,46,9462,543,458,11991,55,1461,0


Converting to forward existential form...Done !
original formula: A((AX(EG((i4.i1.u45.p147==1))) * ((E(!(EX((i15.u51.p172==1))) U !((((i6.u17.p49==1)&&(i11.u52.p179==1))&&(i6.u62.p256==1)))) + EX(AF((((i...359
=> equivalent forward existential formula: [((Init * !(EG(!((i16.u61.p230==1))))) * !(E(!((i16.u61.p230==1)) U (!((!(EX(!(EG((i4.i1.u45.p147==1))))) * ((E(...482
Reverse transition relation is NOT exact ! Due to transitions t100, t106, t116, i0.u22.t95, i0.u24.t91, i1.t96, i1.u20.t99, i2.t112, i2.u6.t122, i2.u10.t11...606
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 3
Fast SCC detection found an SCC at level 4
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
(forward)formula 0,0,12.1219,292336,1,0,531826,1585,2832,1.1013e+06,281,10387,589318
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 124 edges and 229 vertex of which 7 / 229 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 419 edges and 223 vertex of which 217 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 216 transition count 139
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 174 transition count 138
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 86 place count 174 transition count 105
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 73 rules applied. Total rules applied 159 place count 134 transition count 105
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 185 place count 108 transition count 79
Iterating global reduction 3 with 26 rules applied. Total rules applied 211 place count 108 transition count 79
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 289 place count 68 transition count 41
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 291 place count 67 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 292 place count 66 transition count 39
Applied a total of 292 rules in 40 ms. Remains 66 /229 variables (removed 163) and now considering 39/194 (removed 155) transitions.
// Phase 1: matrix 39 rows 66 cols
[2024-05-21 23:27:41] [INFO ] Computed 28 invariants in 0 ms
[2024-05-21 23:27:41] [INFO ] Implicit Places using invariants in 76 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/229 places, 39/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 122 ms. Remains : 65/229 places, 39/194 transitions.
[2024-05-21 23:27:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:27:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:27:41] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-21 23:27:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:27:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:27:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4804752453436643997.gal : 1 ms
[2024-05-21 23:27:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16024254483037060144.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/CTLFireability4804752453436643997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16024254483037060144.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,209,0.025658,4076,2,601,5,2581,6,0,295,2171,0


Converting to forward existential form...Done !
original formula: AG((!(E(((p40==1)&&(p43==1)) U (p97==1))) + !(A((p223==1) U (p19==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!((E(!((p19==1)) U (!((p223==1)) * !((p19==1)))) + EG(!((p19==1)))))))),((p40==1)&...187
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t18, t21, t38, Intersection with reachable at each step enabled. (destroyed/reverse...183
Hit Full ! (commute/partial/dont) 36/2/3
(forward)formula 0,1,0.117388,9356,1,0,130,27643,112,77,1882,24791,171
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 191 transition count 156
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 191 transition count 156
Applied a total of 76 rules in 9 ms. Remains 191 /229 variables (removed 38) and now considering 156/194 (removed 38) transitions.
// Phase 1: matrix 156 rows 191 cols
[2024-05-21 23:27:41] [INFO ] Computed 37 invariants in 14 ms
[2024-05-21 23:27:41] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 23:27:41] [INFO ] Invariant cache hit.
[2024-05-21 23:27:41] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-21 23:27:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 3 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 27 places in 695 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/347 variables, 191/256 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/347 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 14 (OVERLAPS) 0/347 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 268 constraints, problems are : Problem set: 0 solved, 155 unsolved in 13279 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/347 variables, 191/268 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 155/423 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 3/426 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/347 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (OVERLAPS) 0/347 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 427 constraints, problems are : Problem set: 0 solved, 155 unsolved in 13750 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 44/44 constraints]
After SMT, in 27065ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 27068ms
Starting structural reductions in LTL mode, iteration 1 : 191/229 places, 156/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27362 ms. Remains : 191/229 places, 156/194 transitions.
[2024-05-21 23:28:08] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:28:08] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:28:08] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-21 23:28:08] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:28:08] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:28:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16908055231361405799.gal : 2 ms
[2024-05-21 23:28:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11907994094854108932.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/CTLFireability16908055231361405799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11907994094854108932.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46129e+12,0.328765,15796,2,13370,5,41409,6,0,920,38251,0


Converting to forward existential form...Done !
original formula: E((!(AX(FALSE)) * !(A(((EF((p225==1)) * (p196==1)) * (p186!=1)) U ((p3==1) + A((p206==1) U (p30==1)))))) U !(E(EF(!(AX((p61==1)))) U ((A(...231
=> equivalent forward existential formula: [(FwdU(Init,(!(!(EX(!(FALSE)))) * !(!((E(!(((p3==1) + !((E(!((p30==1)) U (!((p206==1)) * !((p30==1)))) + EG(!((p...608
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t20, t25, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t66, t69, t72, t74, t...354
Detected timeout of ITS tools.
[2024-05-21 23:28:39] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:28:39] [INFO ] Applying decomposition
[2024-05-21 23:28:39] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8843152069236577229.txt' '-o' '/tmp/graph8843152069236577229.bin' '-w' '/tmp/graph8843152069236577229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8843152069236577229.bin' '-l' '-1' '-v' '-w' '/tmp/graph8843152069236577229.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:28:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:28:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:28:39] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:28:39] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:28:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:28:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11468505572558213550.gal : 2 ms
[2024-05-21 23:28:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4959339422931839865.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/CTLFireability11468505572558213550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4959339422931839865.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.46129e+12,0.081541,6664,1111,42,6581,540,443,5663,56,1241,0


Converting to forward existential form...Done !
original formula: E((!(AX(FALSE)) * !(A(((EF((i4.u58.p225==1)) * (i16.u63.p196==1)) * (i8.i1.u52.p186!=1)) U ((i10.i0.u1.p3==1) + A((i16.u55.p206==1) U (i4...337
=> equivalent forward existential formula: [(FwdU(Init,(!(!(EX(!(FALSE)))) * !(!((E(!(((i10.i0.u1.p3==1) + !((E(!((i4.u10.p30==1)) U (!((i16.u55.p206==1)) ...838
Reverse transition relation is NOT exact ! Due to transitions t94, t98, t104, t110, t115, i0.u26.t85, i0.u28.t81, i1.u22.t93, i1.u24.t89, i3.u8.t118, i3.u4...600
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
(forward)formula 0,1,15.2266,318448,1,0,700340,1017,3060,967186,304,6414,833041
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-08 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 : 229/229 places, 194/194 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 198 transition count 163
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 198 transition count 163
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 189 transition count 154
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 189 transition count 154
Applied a total of 80 rules in 5 ms. Remains 189 /229 variables (removed 40) and now considering 154/194 (removed 40) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-05-21 23:28:54] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 23:28:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 23:28:54] [INFO ] Invariant cache hit.
[2024-05-21 23:28:54] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-05-21 23:28:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 11 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/241 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 243 constraints, problems are : Problem set: 0 solved, 153 unsolved in 7697 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/243 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 153/396 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:29:05] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:05] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/343 variables, 5/406 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/343 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 407 constraints, problems are : Problem set: 0 solved, 153 unsolved in 22260 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 28/28 constraints]
After SMT, in 30002ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 30004ms
Starting structural reductions in LTL mode, iteration 1 : 189/229 places, 154/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30349 ms. Remains : 189/229 places, 154/194 transitions.
[2024-05-21 23:29:24] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:29:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:29:24] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-21 23:29:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:29:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:29:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8674726508151421221.gal : 2 ms
[2024-05-21 23:29:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14518172998883716703.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/CTLFireability8674726508151421221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14518172998883716703.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.447764,15524,2,13077,5,40942,6,0,910,37988,0


Converting to forward existential form...Done !
original formula: EF(AG(((EX(((p41==0)&&(p223==1))) + (p60==0)) + ((p189==0)||(p235==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((EX(((p41==0)&&(p223==1))) + (p60==0)) + ((p189==0)||(p235==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t15, t20, t25, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t65, t68, t71, t73, t76,...339
(forward)formula 0,1,8.29888,217032,1,0,351,668446,331,170,5257,494849,342
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 199 transition count 164
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 199 transition count 164
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 189 transition count 154
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 189 transition count 154
Applied a total of 80 rules in 11 ms. Remains 189 /229 variables (removed 40) and now considering 154/194 (removed 40) transitions.
// Phase 1: matrix 154 rows 189 cols
[2024-05-21 23:29:33] [INFO ] Computed 37 invariants in 2 ms
[2024-05-21 23:29:33] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 23:29:33] [INFO ] Invariant cache hit.
[2024-05-21 23:29:33] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-05-21 23:29:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 4 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 154/343 variables, 189/243 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 9 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 253 constraints, problems are : Problem set: 0 solved, 153 unsolved in 8155 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 27/64 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 154/343 variables, 189/253 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 153/406 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/343 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 16 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 14 (OVERLAPS) 0/343 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 412 constraints, problems are : Problem set: 0 solved, 153 unsolved in 25131 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 33/33 constraints]
After SMT, in 33334ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 33339ms
Starting structural reductions in LTL mode, iteration 1 : 189/229 places, 154/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33639 ms. Remains : 189/229 places, 154/194 transitions.
[2024-05-21 23:30:06] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:30:06] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:30:06] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-21 23:30:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:30:06] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:30:06] [INFO ] Time to serialize gal into /tmp/CTLFireability514964265024136499.gal : 11 ms
[2024-05-21 23:30:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14846520820191241397.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/CTLFireability514964265024136499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14846520820191241397.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.46025e+12,0.311964,15788,2,13046,5,40717,6,0,910,37788,0


Converting to forward existential form...Done !
original formula: EX(E(AF(!(((((p177==1)&&(p96==1))||(p85==1))||(((p79==1)&&(p148==1))&&(p255==1))))) U ((p59==1) + (EF((p64==1)) * ((EF((p261==1)) + (p110...189
=> equivalent forward existential formula: ([(FwdU(EY(Init),!(EG(!(!(((((p177==1)&&(p96==1))||(p85==1))||(((p79==1)&&(p148==1))&&(p255==1)))))))) * (p59==1...645
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t38, t39, t41, t44, t47, t50, t53, t56, t65, t68, t71, t73, t76,...339
(forward)formula 0,1,24.3314,533116,1,0,798,2.14657e+06,335,596,5189,2.78759e+06,1125
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 204 transition count 169
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 204 transition count 169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 194 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 194 transition count 159
Applied a total of 70 rules in 7 ms. Remains 194 /229 variables (removed 35) and now considering 159/194 (removed 35) transitions.
// Phase 1: matrix 159 rows 194 cols
[2024-05-21 23:30:31] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 23:30:31] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 23:30:31] [INFO ] Invariant cache hit.
[2024-05-21 23:30:31] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-21 23:30:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 159/353 variables, 194/259 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:30:39] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/353 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 275 constraints, problems are : Problem set: 0 solved, 158 unsolved in 10388 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 159/353 variables, 194/281 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 158/439 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 16 (OVERLAPS) 0/353 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 446 constraints, problems are : Problem set: 0 solved, 158 unsolved in 25903 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 57/57 constraints]
After SMT, in 36330ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 36332ms
Starting structural reductions in LTL mode, iteration 1 : 194/229 places, 159/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36788 ms. Remains : 194/229 places, 159/194 transitions.
[2024-05-21 23:31:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:31:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:31:08] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-21 23:31:08] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:31:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5548790693676726118.gal : 1 ms
[2024-05-21 23:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9379853484968255887.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/CTLFireability5548790693676726118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9379853484968255887.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.83884e+12,0.353696,15544,2,12413,5,38844,6,0,934,36964,0


Converting to forward existential form...Done !
original formula: E((A(((AF((p199==1)) + EF((p248==1))) * AG(((((p87==1)&&(p183==1))&&(p255==1))||(p46==1)))) U (((EF((p190==1)) + A((p99==1) U (p177==1)))...277
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!((((E(TRUE U (p190==1)) + !((E(!((p177==1)) U (!((p99==1)) * !((p177==1)))) + EG(!((p177==1))...739
Reverse transition relation is NOT exact ! Due to transitions t2, t10, t18, t21, t26, t30, t34, t35, t38, t39, t42, t43, t45, t48, t51, t54, t57, t60, t69,...361
Detected timeout of ITS tools.
[2024-05-21 23:31:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:31:38] [INFO ] Applying decomposition
[2024-05-21 23:31:38] [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/graph11620235959664939743.txt' '-o' '/tmp/graph11620235959664939743.bin' '-w' '/tmp/graph11620235959664939743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11620235959664939743.bin' '-l' '-1' '-v' '-w' '/tmp/graph11620235959664939743.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:31:38] [INFO ] Decomposing Gal with order
[2024-05-21 23:31:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:31:38] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:31:38] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:31:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 23:31:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3365712542429219803.gal : 15 ms
[2024-05-21 23:31:38] [INFO ] Time to serialize properties into /tmp/CTLFireability109977292597882555.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/CTLFireability3365712542429219803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability109977292597882555.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83884e+12,0.120436,7532,1105,51,7997,623,447,9251,56,1980,0


Converting to forward existential form...Done !
original formula: E((A(((AF((i16.u56.p199==1)) + EF((i2.u66.p248==1))) * AG(((((i1.u27.p87==1)&&(i12.i2.u51.p183==1))&&(i16.u56.p255==1))||(i9.u15.p46==1))...420
=> equivalent forward existential formula: [(FwdU(Init,(!((E(!((((E(TRUE U (i4.i1.u53.p190==1)) + !((E(!((i12.i1.u50.p177==1)) U (!((i11.i0.u31.p99==1)) * ...1066
Reverse transition relation is NOT exact ! Due to transitions t98, t102, t108, t114, t118, i0.u29.t81, i1.u27.t85, i2.u25.t89, i3.u21.t97, i4.i0.u19.t101, ...632
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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
(forward)formula 0,1,13.0162,271796,1,0,591143,728,2836,655027,291,3269,793099
FORMULA BusinessProcesses-PT-02-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (trivial) has 120 edges and 229 vertex of which 4 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 423 edges and 226 vertex of which 223 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 222 transition count 147
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 182 transition count 147
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 82 place count 182 transition count 110
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 164 place count 137 transition count 110
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 187 place count 114 transition count 87
Iterating global reduction 2 with 23 rules applied. Total rules applied 210 place count 114 transition count 87
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 284 place count 76 transition count 51
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 2 with 2 rules applied. Total rules applied 286 place count 75 transition count 50
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 75 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 74 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 289 place count 73 transition count 49
Applied a total of 289 rules in 63 ms. Remains 73 /229 variables (removed 156) and now considering 49/194 (removed 145) transitions.
// Phase 1: matrix 49 rows 73 cols
[2024-05-21 23:31:51] [INFO ] Computed 26 invariants in 3 ms
[2024-05-21 23:31:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 23:31:51] [INFO ] Invariant cache hit.
[2024-05-21 23:31:51] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [19, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 218 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/229 places, 49/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 284 ms. Remains : 71/229 places, 49/194 transitions.
[2024-05-21 23:31:51] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:31:51] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:31:51] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-21 23:31:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:31:51] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:31:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11900708971918161006.gal : 1 ms
[2024-05-21 23:31:51] [INFO ] Time to serialize properties into /tmp/CTLFireability5915046702358672908.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11900708971918161006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5915046702358672908.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,4176,0.050068,4384,2,1217,5,3641,6,0,330,2663,0


Converting to forward existential form...Done !
original formula: EF(((AG(((E((p227==1) U (p185==1)) + ((p160==1)&&(p10==1))) + ((p197==1)||(p102==0)))) * EF((p22==1))) * ((AF((p7==1)) + AG(AF((p125==1))...175
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!(E(TRUE U !(((E((p227==1) U (p185==1)) + ((p160==1)&&(p10==1))) + ((p197==1)||(p102==0)...585
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t8, t10, t11, t13, t15, t24, t27, t28, t29, t31, t44, t45, t47, Intersection wit...236
(forward)formula 0,1,0.911448,29644,1,0,297,145492,133,150,2148,137961,332
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 200 transition count 165
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 200 transition count 165
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 192 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 192 transition count 157
Applied a total of 74 rules in 13 ms. Remains 192 /229 variables (removed 37) and now considering 157/194 (removed 37) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-05-21 23:31:52] [INFO ] Computed 37 invariants in 4 ms
[2024-05-21 23:31:53] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 23:31:53] [INFO ] Invariant cache hit.
[2024-05-21 23:31:53] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-21 23:31:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/349 variables, 192/244 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:32:00] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:32:01] [INFO ] Deduced a trap composed of 11 places in 697 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/349 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 246 constraints, problems are : Problem set: 0 solved, 156 unsolved in 16658 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/349 variables, 192/246 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 156/402 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:11] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 8/410 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:32:15] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:17] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/349 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 14 (OVERLAPS) 0/349 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 414 constraints, problems are : Problem set: 0 solved, 156 unsolved in 22042 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 29/29 constraints]
After SMT, in 38742ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 38744ms
Starting structural reductions in LTL mode, iteration 1 : 192/229 places, 157/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39086 ms. Remains : 192/229 places, 157/194 transitions.
[2024-05-21 23:32:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:32:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:32:32] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-21 23:32:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:32:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7716078635269721157.gal : 1 ms
[2024-05-21 23:32:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6983981447900052546.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/CTLFireability7716078635269721157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6983981447900052546.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.01041e+12,0.434434,16064,2,13572,5,42377,6,0,925,37167,0


Converting to forward existential form...Done !
original formula: E(AG(((AF(((p12==1)||(((p26==1)&&(p134==1))&&(p218==1)))) + !(AG((p197==1)))) * ((EG(((p215==1)||(p51==1))) + (p171!=1)) + (p232!=1)))) U...218
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((!(EG(!(((p12==1)||(((p26==1)&&(p134==1))&&(p218==1)))))) + !(!(E(TRUE U !((p197==1)))...306
Reverse transition relation is NOT exact ! Due to transitions t2, t16, t18, t21, t26, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t67, t70, t73, t74,...350
Detected timeout of ITS tools.
[2024-05-21 23:33:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:33:02] [INFO ] Applying decomposition
[2024-05-21 23:33:02] [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/graph4671518559869040413.txt' '-o' '/tmp/graph4671518559869040413.bin' '-w' '/tmp/graph4671518559869040413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4671518559869040413.bin' '-l' '-1' '-v' '-w' '/tmp/graph4671518559869040413.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:33:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:33:02] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 23:33:02] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:33:02] [INFO ] Time to serialize gal into /tmp/CTLFireability2940538941140042161.gal : 2 ms
[2024-05-21 23:33:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9648088231350796335.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/CTLFireability2940538941140042161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9648088231350796335.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.01041e+12,0.197995,9516,1268,55,11397,484,398,16485,55,1160,0


Converting to forward existential form...Done !
original formula: E(AG(((AF(((i3.u4.p12==1)||(((i3.u8.p26==1)&&(i15.u39.p134==1))&&(i3.u56.p218==1)))) + !(AG((i16.u52.p197==1)))) * ((EG(((i16.u54.p215==1...314
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((!(EG(!(((i3.u4.p12==1)||(((i3.u8.p26==1)&&(i15.u39.p134==1))&&(i3.u56.p218==1)))))) +...402
Reverse transition relation is NOT exact ! Due to transitions t100, t106, t112, t116, i0.u24.t87, i0.u26.t83, i1.u20.t95, i2.u9.t115, i3.u7.t119, i4.u11.t1...584
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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,13.4305,288088,1,0,469182,1577,2672,864489,288,7725,597416
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 194/194 transitions.
Graph (complete) has 426 edges and 229 vertex of which 224 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 223 transition count 155
Reduce places removed 33 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 190 transition count 152
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 187 transition count 152
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 73 place count 187 transition count 107
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 171 place count 134 transition count 107
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 198 place count 107 transition count 80
Iterating global reduction 3 with 27 rules applied. Total rules applied 225 place count 107 transition count 80
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 301 place count 69 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 68 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 67 transition count 41
Applied a total of 303 rules in 20 ms. Remains 67 /229 variables (removed 162) and now considering 41/194 (removed 153) transitions.
// Phase 1: matrix 41 rows 67 cols
[2024-05-21 23:33:15] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 23:33:15] [INFO ] Implicit Places using invariants in 101 ms returned [9, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 103 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/229 places, 41/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 125 ms. Remains : 65/229 places, 41/194 transitions.
[2024-05-21 23:33:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:33:15] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:33:15] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-21 23:33:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:33:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:33:15] [INFO ] Time to serialize gal into /tmp/CTLFireability390513996054512029.gal : 1 ms
[2024-05-21 23:33:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12358980643471747922.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/CTLFireability390513996054512029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12358980643471747922.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,1362,0.042872,4080,2,441,5,2107,6,0,298,2125,0


Converting to forward existential form...Done !
original formula: E(EG(AG(AF((p242!=1)))) U A((p223==1) U !((!(((p115==1)&&(p232==1))) * EG(EF((((p42==1)&&(p173==1))&&(p255==1))))))))
=> equivalent forward existential formula: [((FwdU(Init,EG(!(E(TRUE U !(!(EG(!((p242!=1))))))))) * !(EG(!(!((!(((p115==1)&&(p232==1))) * EG(E(TRUE U (((p42...399
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t8, t22, t26, t40, Intersection with reachable at each step enabled. (destro...194
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.324326,12528,1,0,150,49406,126,85,1980,46991,194
FORMULA BusinessProcesses-PT-02-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 23:33:16] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:16] [INFO ] Flatten gal took : 6 ms
Total runtime 790945 ms.

BK_STOP 1716334396298

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
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-02, 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-171620399500458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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