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-171620399500457.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399500457
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-02-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333594924

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:19:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:19:56] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 23:19:56] [INFO ] Transformed 262 places.
[2024-05-21 23:19:56] [INFO ] Transformed 219 transitions.
[2024-05-21 23:19:56] [INFO ] Found NUPN structural information;
[2024-05-21 23:19:56] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 241 transition count 204
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 16 place count 229 transition count 192
Iterating global reduction 1 with 12 rules applied. Total rules applied 28 place count 229 transition count 192
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 225 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 225 transition count 188
Applied a total of 36 rules in 44 ms. Remains 225 /245 variables (removed 20) and now considering 188/204 (removed 16) transitions.
// Phase 1: matrix 188 rows 225 cols
[2024-05-21 23:19:56] [INFO ] Computed 39 invariants in 12 ms
[2024-05-21 23:19:57] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-21 23:19:57] [INFO ] Invariant cache hit.
[2024-05-21 23:19:57] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-21 23:19:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 3/225 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:19:59] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 18 ms to minimize.
[2024-05-21 23:19:59] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:19:59] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:19:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:19:59] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:19:59] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:20:02] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:20:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:20:02] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 188/413 variables, 225/315 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:07] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 4 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 9/324 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 324 constraints, problems are : Problem set: 0 solved, 187 unsolved in 15079 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 3/225 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 60/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:20:15] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:20:15] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:17] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 188/413 variables, 225/337 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 187/524 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:19] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:20:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:20:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:21] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:20:22] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-21 23:20:25] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:20:26] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:20:26] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:20:26] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:20:28] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:20:28] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 3 ms to minimize.
[2024-05-21 23:20:28] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:20:28] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:28] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 9/538 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 538 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 87/87 constraints]
After SMT, in 45175ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 45197ms
Starting structural reductions in LTL mode, iteration 1 : 225/245 places, 188/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45699 ms. Remains : 225/245 places, 188/204 transitions.
Support contains 117 out of 225 places after structural reductions.
[2024-05-21 23:20:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 23:20:42] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:20:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-02-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:20:42] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:20:42] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 96 out of 225 places (down from 117) after GAL structural reductions.
RANDOM walk for 40000 steps (542 resets) in 1857 ms. (21 steps per ms) remains 16/53 properties
BEST_FIRST walk for 4004 steps (10 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
[2024-05-21 23:20:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 96/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 47/185 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 15/200 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 168/368 variables, 200/239 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 37/405 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 8/413 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/413 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 264 constraints, problems are : Problem set: 0 solved, 16 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 96/138 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 23:20:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:20:44] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 47/185 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 23:20:44] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:20:44] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 15/200 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-21 23:20:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:20:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 168/368 variables, 200/245 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 13 (OVERLAPS) 37/405 variables, 19/266 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/405 variables, 13/279 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:45] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 7/291 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/405 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 18 (OVERLAPS) 8/413 variables, 6/297 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/413 variables, 3/300 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:46] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/413 variables, 2/302 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-21 23:20:47] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/413 variables, 1/303 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/413 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 23 (OVERLAPS) 0/413 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 303 constraints, problems are : Problem set: 2 solved, 14 unsolved in 3436 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 24/24 constraints]
After SMT, in 4247ms problems are : Problem set: 2 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 3 properties in 3649 ms.
Support contains 24 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 101 edges and 225 vertex of which 7 / 225 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 415 edges and 219 vertex of which 213 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 213 transition count 143
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 182 transition count 140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 179 transition count 140
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 70 place count 179 transition count 111
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 132 place count 146 transition count 111
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 145 place count 133 transition count 98
Iterating global reduction 3 with 13 rules applied. Total rules applied 158 place count 133 transition count 98
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 246 place count 88 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 247 place count 88 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 248 place count 87 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 86 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 250 place count 85 transition count 53
Applied a total of 250 rules in 52 ms. Remains 85 /225 variables (removed 140) and now considering 53/188 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 85/225 places, 53/188 transitions.
RANDOM walk for 756 steps (17 resets) in 21 ms. (34 steps per ms) remains 0/11 properties
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-05-21 23:20:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:20:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:20:51] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 217 stabilizing places and 178 stable transitions
Graph (complete) has 423 edges and 225 vertex of which 217 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 188
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 200 transition count 164
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 200 transition count 164
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 60 place count 189 transition count 153
Iterating global reduction 1 with 11 rules applied. Total rules applied 71 place count 189 transition count 153
Applied a total of 71 rules in 16 ms. Remains 189 /225 variables (removed 36) and now considering 153/188 (removed 35) transitions.
// Phase 1: matrix 153 rows 189 cols
[2024-05-21 23:20:51] [INFO ] Computed 38 invariants in 4 ms
[2024-05-21 23:20:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 23:20:51] [INFO ] Invariant cache hit.
[2024-05-21 23:20:51] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-21 23:20:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/189 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 153/342 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 252 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7745 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/189 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 25/63 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/342 variables, 189/252 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 152/404 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 6/410 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/342 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 411 constraints, problems are : Problem set: 0 solved, 152 unsolved in 15111 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 32/32 constraints]
After SMT, in 22876ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 22879ms
Starting structural reductions in LTL mode, iteration 1 : 189/225 places, 153/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23108 ms. Remains : 189/225 places, 153/188 transitions.
[2024-05-21 23:21:14] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:21:14] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:21:14] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-21 23:21:14] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:21:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:21:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14790324732092186031.gal : 5 ms
[2024-05-21 23:21:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4850992023496233725.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/CTLCardinality14790324732092186031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4850992023496233725.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.300265,15692,2,13241,5,41181,6,0,906,37479,0


Converting to forward existential form...Done !
original formula: AG(EX(((p163==0)||(p138==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((p163==0)||(p138==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
(forward)formula 0,0,6.13766,215856,1,0,327,701731,322,156,5040,570875,313
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 121 edges and 225 vertex of which 7 / 225 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 416 edges and 219 vertex of which 211 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 210 transition count 135
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 171 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 170 transition count 134
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 82 place count 170 transition count 97
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 3 with 82 rules applied. Total rules applied 164 place count 125 transition count 97
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 183 place count 106 transition count 78
Iterating global reduction 3 with 19 rules applied. Total rules applied 202 place count 106 transition count 78
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 282 place count 66 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 283 place count 65 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 64 transition count 37
Applied a total of 284 rules in 63 ms. Remains 64 /225 variables (removed 161) and now considering 37/188 (removed 151) transitions.
// Phase 1: matrix 37 rows 64 cols
[2024-05-21 23:21:21] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 23:21:21] [INFO ] Implicit Places using invariants in 136 ms returned [10, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 137 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/225 places, 37/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 203 ms. Remains : 62/225 places, 37/188 transitions.
[2024-05-21 23:21:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:21:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:21:21] [INFO ] Input system was already deterministic with 37 transitions.
[2024-05-21 23:21:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:21:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:21:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16342421276593801212.gal : 1 ms
[2024-05-21 23:21:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3908636176410975727.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/CTLCardinality16342421276593801212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3908636176410975727.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,485,0.01315,3704,2,381,5,1343,6,0,282,1041,0


Converting to forward existential form...Done !
original formula: E(((p231==0)||(p29==1)) U (p131==1))
=> equivalent forward existential formula: [(FwdU(Init,((p231==0)||(p29==1))) * (p131==1))] != FALSE
Hit Full ! (commute/partial/dont) 33/0/4
(forward)formula 0,1,0.015567,4020,1,0,10,1343,15,1,438,1041,4
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 201 transition count 166
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 201 transition count 166
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 193 transition count 158
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 193 transition count 158
Applied a total of 62 rules in 9 ms. Remains 193 /225 variables (removed 32) and now considering 158/188 (removed 30) transitions.
// Phase 1: matrix 158 rows 193 cols
[2024-05-21 23:21:21] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 23:21:21] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 23:21:21] [INFO ] Invariant cache hit.
[2024-05-21 23:21:21] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-21 23:21:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 16 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:21:23] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 12 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:21:24] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 158/351 variables, 193/260 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:21:25] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:21:26] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:26] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:26] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2024-05-21 23:21:26] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:21:26] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:21:27] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:27] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/351 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 268 constraints, problems are : Problem set: 0 solved, 157 unsolved in 8507 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 158/351 variables, 193/271 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 157/428 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/351 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 435 constraints, problems are : Problem set: 0 solved, 157 unsolved in 12984 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 48/48 constraints]
After SMT, in 21509ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 21512ms
Starting structural reductions in LTL mode, iteration 1 : 193/225 places, 158/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21834 ms. Remains : 193/225 places, 158/188 transitions.
[2024-05-21 23:21:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:21:43] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:21:43] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-21 23:21:43] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:21:43] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:21:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17378524237730698499.gal : 11 ms
[2024-05-21 23:21:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality5903807954169904109.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/CTLCardinality17378524237730698499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5903807954169904109.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,2.22076e+12,0.317621,16308,2,13555,5,41588,6,0,929,38552,0


Converting to forward existential form...Done !
original formula: ((EX(((p58!=0) + AG((p187!=1)))) * AX((p65==0))) + (A(!((((p63==0)||(p168==1))||(((p3==0)||(p163==1))&&(p108==1)))) U !((((p25==0)||(p30=...203
=> equivalent forward existential formula: ([((Init * !((!((E(!(!((((p25==0)||(p30==1))||(p60==1)))) U (!(!((((p63==0)||(p168==1))||(((p3==0)||(p163==1))&&...744
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t32, t33, t35, t38, t41, t44, t47, t50, t53, t56, t65, t68, t72, t73, t75,...368
Detected timeout of ITS tools.
[2024-05-21 23:22:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:22:13] [INFO ] Applying decomposition
[2024-05-21 23:22:13] [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/graph8911501381889585911.txt' '-o' '/tmp/graph8911501381889585911.bin' '-w' '/tmp/graph8911501381889585911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8911501381889585911.bin' '-l' '-1' '-v' '-w' '/tmp/graph8911501381889585911.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:22:13] [INFO ] Decomposing Gal with order
[2024-05-21 23:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:22:13] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:22:13] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 23:22:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2070598278871591459.gal : 4 ms
[2024-05-21 23:22:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality8260064567520517995.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/CTLCardinality2070598278871591459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8260064567520517995.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.22076e+12,0.100303,6872,1173,37,6649,312,431,7557,56,715,0


Converting to forward existential form...Done !
original formula: ((EX(((i2.u20.p58!=0) + AG((i0.u53.p187!=1)))) * AX((i2.u22.p65==0))) + (A(!((((i2.u22.p63==0)||(i16.u49.p168==1))||(((i10.i0.u2.p3==0)||...296
=> equivalent forward existential formula: ([((Init * !((!((E(!(!((((i5.u9.p25==0)||(i3.u11.p30==1))||(u21.p60==1)))) U (!(!((((i2.u22.p63==0)||(i16.u49.p1...1009
Reverse transition relation is NOT exact ! Due to transitions t95, t99, t105, t116, i0.t32, i0.u53.t33, i1.u26.t86, i1.u28.t82, i2.u20.t98, i2.u22.t94, i3....621
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
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,6.58927,217280,1,0,441609,356,2866,618966,274,1289,546668
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 188
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 201 transition count 165
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 201 transition count 165
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 191 transition count 155
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 191 transition count 155
Applied a total of 67 rules in 15 ms. Remains 191 /225 variables (removed 34) and now considering 155/188 (removed 33) transitions.
// Phase 1: matrix 155 rows 191 cols
[2024-05-21 23:22:20] [INFO ] Computed 38 invariants in 5 ms
[2024-05-21 23:22:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 23:22:20] [INFO ] Invariant cache hit.
[2024-05-21 23:22:20] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-21 23:22:20] [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) 2/191 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:21] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:22:22] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:22:23] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:22:24] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 155/346 variables, 191/254 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:22:28] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/346 variables, 5/268 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 15 (OVERLAPS) 0/346 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 268 constraints, problems are : Problem set: 0 solved, 154 unsolved in 13193 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 39/39 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) 2/191 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 155/346 variables, 191/274 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 154/428 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:36] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 3/431 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/346 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 431 constraints, problems are : Problem set: 0 solved, 154 unsolved in 10403 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 48/48 constraints]
After SMT, in 23619ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 23621ms
Starting structural reductions in LTL mode, iteration 1 : 191/225 places, 155/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23884 ms. Remains : 191/225 places, 155/188 transitions.
[2024-05-21 23:22:44] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:22:44] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:22:44] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-21 23:22:44] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:22:44] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:22:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality18246019608831455643.gal : 1 ms
[2024-05-21 23:22:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5769966669075274757.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/CTLCardinality18246019608831455643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5769966669075274757.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,2.22076e+12,0.285178,16052,2,13607,5,41909,6,0,916,37853,0


Converting to forward existential form...Done !
original formula: EX((EF(((EX((((p129==0)||(p189==0))||(p243==1))) * ((p119==0)||((p158==0)&&(p49==1)))) * (p0==1))) * (p12==0)))
=> equivalent forward existential formula: [(EY(((FwdU((EY(Init) * (p12==0)),TRUE) * (p0==1)) * ((p119==0)||((p158==0)&&(p49==1))))) * (((p129==0)||(p189==...181
(forward)formula 0,0,0.493057,20276,1,0,11,59572,12,2,1833,40842,7
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 188
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 208 transition count 172
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 208 transition count 172
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 199 transition count 163
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 199 transition count 163
Applied a total of 51 rules in 5 ms. Remains 199 /225 variables (removed 26) and now considering 163/188 (removed 25) transitions.
// Phase 1: matrix 163 rows 199 cols
[2024-05-21 23:22:44] [INFO ] Computed 38 invariants in 4 ms
[2024-05-21 23:22:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 23:22:44] [INFO ] Invariant cache hit.
[2024-05-21 23:22:44] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-21 23:22:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/199 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 2 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 4 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 163/362 variables, 199/281 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 0/362 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 284 constraints, problems are : Problem set: 0 solved, 162 unsolved in 10332 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/199 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 47/85 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 163/362 variables, 199/285 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 162/447 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 16/463 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 0/362 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 466 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18450 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 67/67 constraints]
After SMT, in 28799ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 28801ms
Starting structural reductions in LTL mode, iteration 1 : 199/225 places, 163/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29035 ms. Remains : 199/225 places, 163/188 transitions.
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:23:13] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:23:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1242531576333450730.gal : 2 ms
[2024-05-21 23:23:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16714940738116372559.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/CTLCardinality1242531576333450730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16714940738116372559.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.60283e+12,0.389065,17412,2,14355,5,45511,6,0,956,43631,0


Converting to forward existential form...Done !
original formula: (A(((AX(((p101==0)||(p203==1))) + EG((((p150!=0)||(p195==0))||(p242==1)))) * E(AF(((p146==0)||(p79==1))) U AX(((p7==1)&&(p156==0))))) U !...391
=> equivalent forward existential formula: ([(((Init * !(!((E(!(!(E(TRUE U EG((p0==1))))) U (!(((!(EX(!(((p101==0)||(p203==1))))) + EG((((p150!=0)||(p195==...966
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t11, t20, t23, t29, t34, t35, t38, t39, t41, t44, t47, t50, t53, t57, t58, t60, t64, ...377
(forward)formula 0,1,8.33365,269216,1,0,569,890486,368,266,5438,695000,641
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 118 edges and 225 vertex of which 7 / 225 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 416 edges and 219 vertex of which 212 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 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 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 211 transition count 135
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 171 transition count 135
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 82 place count 171 transition count 102
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 154 place count 132 transition count 102
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 174 place count 112 transition count 82
Iterating global reduction 2 with 20 rules applied. Total rules applied 194 place count 112 transition count 82
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 280 place count 68 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 281 place count 67 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 282 place count 66 transition count 39
Applied a total of 282 rules in 40 ms. Remains 66 /225 variables (removed 159) and now considering 39/188 (removed 149) transitions.
// Phase 1: matrix 39 rows 66 cols
[2024-05-21 23:23:22] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 23:23:22] [INFO ] Implicit Places using invariants in 62 ms returned [55, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 64/225 places, 39/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 119 ms. Remains : 64/225 places, 39/188 transitions.
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:22] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13356552931929753833.gal : 1 ms
[2024-05-21 23:23:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7266747396688561327.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13356552931929753833.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7266747396688561327.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 32935 steps (10290 resets) in 157 ms. (208 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (trivial) has 115 edges and 225 vertex of which 7 / 225 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 416 edges and 219 vertex of which 211 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 210 transition count 138
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 174 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 173 transition count 137
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 76 place count 173 transition count 100
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 156 place count 130 transition count 100
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 175 place count 111 transition count 81
Iterating global reduction 3 with 19 rules applied. Total rules applied 194 place count 111 transition count 81
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 3 with 74 rules applied. Total rules applied 268 place count 73 transition count 45
Applied a total of 268 rules in 34 ms. Remains 73 /225 variables (removed 152) and now considering 45/188 (removed 143) transitions.
// Phase 1: matrix 45 rows 73 cols
[2024-05-21 23:23:22] [INFO ] Computed 29 invariants in 1 ms
[2024-05-21 23:23:22] [INFO ] Implicit Places using invariants in 109 ms returned [7, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 123 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/225 places, 45/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 161 ms. Remains : 71/225 places, 45/188 transitions.
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:22] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:23:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:23:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality18388860960557726100.gal : 1 ms
[2024-05-21 23:23:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality784990454036967351.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/CTLCardinality18388860960557726100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality784990454036967351.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,3057,0.039686,4380,2,958,5,2996,6,0,329,2567,0


Converting to forward existential form...Done !
original formula: (EF(AG(((p112==0) + EG(((p2==1)&&((p189==0)||(p218==1))))))) * (EF(EG(((p93==1)||(p131==1)))) + EG((!(A(EF((p24==1)) U (p169!=1))) * (p60...163
=> equivalent forward existential formula: ([FwdG(FwdU((Init * E(TRUE U !(E(TRUE U !(((p112==0) + EG(((p2==1)&&((p189==0)||(p218==1)))))))))),TRUE),((p93==...384
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t16, t17, t19, t24, t25, t41, t42, Intersection with reachable at each step enabled....202
Hit Full ! (commute/partial/dont) 40/0/5
(forward)formula 0,1,0.270768,13620,1,0,131,45762,126,70,2306,37089,158
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Graph (complete) has 423 edges and 225 vertex of which 217 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 216 transition count 149
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 184 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 182 transition count 147
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 69 place count 182 transition count 106
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 159 place count 133 transition count 106
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 176 place count 116 transition count 89
Iterating global reduction 3 with 17 rules applied. Total rules applied 193 place count 116 transition count 89
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 283 place count 70 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 69 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 285 place count 68 transition count 44
Applied a total of 285 rules in 26 ms. Remains 68 /225 variables (removed 157) and now considering 44/188 (removed 144) transitions.
// Phase 1: matrix 44 rows 68 cols
[2024-05-21 23:23:22] [INFO ] Computed 26 invariants in 1 ms
[2024-05-21 23:23:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 23:23:22] [INFO ] Invariant cache hit.
[2024-05-21 23:23:22] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 22, 23, 24, 26, 28, 34, 36, 38, 40, 44, 45]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 143 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/225 places, 44/188 transitions.
Graph (complete) has 87 edges and 45 vertex of which 43 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
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 43 transition count 38
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 38 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 36 transition count 36
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 36 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 34 transition count 34
Applied a total of 19 rules in 4 ms. Remains 34 /45 variables (removed 11) and now considering 34/44 (removed 10) transitions.
// Phase 1: matrix 34 rows 34 cols
[2024-05-21 23:23:22] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 23:23:22] [INFO ] Implicit Places using invariants in 23 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/225 places, 34/188 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 33
Applied a total of 2 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/34 (removed 1) transitions.
// Phase 1: matrix 33 rows 32 cols
[2024-05-21 23:23:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 23:23:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 23:23:23] [INFO ] Invariant cache hit.
[2024-05-21 23:23:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 32/225 places, 33/188 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 244 ms. Remains : 32/225 places, 33/188 transitions.
[2024-05-21 23:23:23] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:23:23] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:23:23] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-21 23:23:23] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:23:23] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:23:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3910997361211233348.gal : 0 ms
[2024-05-21 23:23:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality7430088831602967454.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/CTLCardinality3910997361211233348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7430088831602967454.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,1336,0.010359,3564,2,227,5,1093,6,0,159,1174,0


Converting to forward existential form...Done !
original formula: AG(((p135==1) + EG((((EF(((p220==0)||(p214==1))) + EG((p255!=1))) + ((p187==1)||(p165==0))) + (p178==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p135==1))) * !(EG((((E(TRUE U ((p220==0)||(p214==1))) + EG((p255!=1))) + ((p187==1)||(p1...188
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t9, t11, t26, t32, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,1,0.129097,8636,1,0,178,30298,97,96,992,32935,218
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 201 transition count 166
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 201 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 192 transition count 157
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 192 transition count 157
Applied a total of 64 rules in 6 ms. Remains 192 /225 variables (removed 33) and now considering 157/188 (removed 31) transitions.
// Phase 1: matrix 157 rows 192 cols
[2024-05-21 23:23:23] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 23:23:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 23:23:23] [INFO ] Invariant cache hit.
[2024-05-21 23:23:23] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-21 23:23:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 22 places in 21 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:23:26] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 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
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/349 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/349 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 251 constraints, problems are : Problem set: 0 solved, 156 unsolved in 7064 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/349 variables, 192/251 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 156/407 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:23:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/349 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (OVERLAPS) 0/349 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 413 constraints, problems are : Problem set: 0 solved, 156 unsolved in 16681 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 28/28 constraints]
After SMT, in 23761ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 23762ms
Starting structural reductions in LTL mode, iteration 1 : 192/225 places, 157/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23999 ms. Remains : 192/225 places, 157/188 transitions.
[2024-05-21 23:23:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:23:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:23:47] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-21 23:23:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:23:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:23:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3478336093422561112.gal : 1 ms
[2024-05-21 23:23:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality8577130950818824835.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/CTLCardinality3478336093422561112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8577130950818824835.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.47329e+12,0.358081,15800,2,13195,5,41405,6,0,925,37783,0


Converting to forward existential form...Done !
original formula: EF(!(E(AF(((p220==0)||(p245==1))) U (EX(((p27==0)||(p133==1))) * A((p78==0) U (p107==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG(!(((p220==0)||(p245==1))))) U (EX(((p27==0)||(p133==1))) * !((E(!((p107==0)) U (!((...215
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t18, t23, t28, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t68, t71, t74, t76, ...344
(forward)formula 0,1,10.0678,297416,1,0,679,1.1237e+06,353,314,5470,1.00957e+06,780
FORMULA BusinessProcesses-PT-02-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 199 transition count 164
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 199 transition count 164
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 61 place count 188 transition count 153
Iterating global reduction 1 with 11 rules applied. Total rules applied 72 place count 188 transition count 153
Applied a total of 72 rules in 13 ms. Remains 188 /225 variables (removed 37) and now considering 153/188 (removed 35) transitions.
// Phase 1: matrix 153 rows 188 cols
[2024-05-21 23:23:57] [INFO ] Computed 37 invariants in 1 ms
[2024-05-21 23:23:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 23:23:57] [INFO ] Invariant cache hit.
[2024-05-21 23:23:57] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-21 23:23:57] [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:23:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 22 places in 29 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:24:01] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 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 6786 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:24:07] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 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:24:09] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 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:24:13] [INFO ] Deduced a trap composed of 24 places in 31 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 14637 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 21441ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 21443ms
Starting structural reductions in LTL mode, iteration 1 : 188/225 places, 153/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21675 ms. Remains : 188/225 places, 153/188 transitions.
[2024-05-21 23:24:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:24:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:24:19] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-21 23:24:19] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:24:19] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:24:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality11151979258914042538.gal : 2 ms
[2024-05-21 23:24:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12734300231576053013.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/CTLCardinality11151979258914042538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12734300231576053013.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.46025e+12,0.339104,15516,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: (E(EX(TRUE) U EX((p153==0))) * AG(!(A(((p128==0)||(p53==1)) U (p46==1)))))
=> equivalent forward existential formula: ([(Init * !(E(EX(TRUE) U EX((p153==0)))))] = FALSE * [((FwdU(Init,TRUE) * !(EG(!((p46==1))))) * !(E(!((p46==1)) ...210
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
Detected timeout of ITS tools.
[2024-05-21 23:24:49] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:24:49] [INFO ] Applying decomposition
[2024-05-21 23:24:49] [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/graph12499963285535484550.txt' '-o' '/tmp/graph12499963285535484550.bin' '-w' '/tmp/graph12499963285535484550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12499963285535484550.bin' '-l' '-1' '-v' '-w' '/tmp/graph12499963285535484550.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:24:49] [INFO ] Decomposing Gal with order
[2024-05-21 23:24:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:24:49] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 23:24:49] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 23:24:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality10509863321007115106.gal : 4 ms
[2024-05-21 23:24:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality8853000766122125047.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/CTLCardinality10509863321007115106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8853000766122125047.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.086859,6360,1023,39,6094,490,398,5533,55,972,0


Converting to forward existential form...Done !
original formula: (E(EX(TRUE) U EX((i4.u45.p153==0))) * AG(!(A(((i14.u40.p128==0)||(i7.u19.p53==1)) U (i7.u16.p46==1)))))
=> equivalent forward existential formula: ([(Init * !(E(EX(TRUE) U EX((i4.u45.p153==0)))))] = FALSE * [((FwdU(Init,TRUE) * !(EG(!((i7.u16.p46==1))))) * !(...253
Reverse transition relation is NOT exact ! Due to transitions t92, t96, t108, t112, i1.u26.t83, i2.u20.t95, i2.u24.t87, i3.u8.t115, i3.u46.t49, i4.u10.t111...551
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 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,0,2.49873,97968,1,0,196190,1091,2586,410108,295,5600,292165
FORMULA BusinessProcesses-PT-02-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 188/188 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 188
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 202 transition count 167
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 202 transition count 167
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 194 transition count 159
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 194 transition count 159
Applied a total of 60 rules in 4 ms. Remains 194 /225 variables (removed 31) and now considering 159/188 (removed 29) transitions.
// Phase 1: matrix 159 rows 194 cols
[2024-05-21 23:24:51] [INFO ] Computed 37 invariants in 3 ms
[2024-05-21 23:24:51] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 23:24:51] [INFO ] Invariant cache hit.
[2024-05-21 23:24:52] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-21 23:24:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:53] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 159/353 variables, 194/259 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 265 constraints, problems are : Problem set: 0 solved, 158 unsolved in 8834 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 1/194 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 159/353 variables, 194/273 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 158/431 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:25:05] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 6/437 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-21 23:25:09] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 14 (OVERLAPS) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 439 constraints, problems are : Problem set: 0 solved, 158 unsolved in 17835 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 50/50 constraints]
After SMT, in 26690ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 26692ms
Starting structural reductions in LTL mode, iteration 1 : 194/225 places, 159/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26911 ms. Remains : 194/225 places, 159/188 transitions.
[2024-05-21 23:25:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:25:18] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:25:18] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-21 23:25:18] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:25:18] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:25:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality14744321997846214566.gal : 2 ms
[2024-05-21 23:25:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality381409361057357010.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/CTLCardinality14744321997846214566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality381409361057357010.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.49801e+12,0.426052,16076,2,13304,5,42228,6,0,935,39032,0


Converting to forward existential form...Done !
original formula: E((EF((p255==1)) + A((EG((p206==0)) + (p40==0)) U (AF(!(((p0==0)||(p42==1)))) * EF((p226==1))))) U EX(A((!(AF((p174==1))) * (((p212==1)&&...261
=> equivalent forward existential formula: [((EY(FwdU(Init,(E(TRUE U (p255==1)) + !((E(!((!(EG(!(!(((p0==0)||(p42==1)))))) * E(TRUE U (p226==1)))) U (!((EG...600
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t10, t17, t21, t24, t30, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t70, t73, ...355
Detected timeout of ITS tools.
[2024-05-21 23:25:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:25:48] [INFO ] Applying decomposition
[2024-05-21 23:25:48] [INFO ] Flatten gal took : 14 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/graph1584796493424726559.txt' '-o' '/tmp/graph1584796493424726559.bin' '-w' '/tmp/graph1584796493424726559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1584796493424726559.bin' '-l' '-1' '-v' '-w' '/tmp/graph1584796493424726559.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:25:48] [INFO ] Decomposing Gal with order
[2024-05-21 23:25:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:25:48] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-21 23:25:48] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:25:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:25:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5862543730218133400.gal : 2 ms
[2024-05-21 23:25:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3130791250856782689.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/CTLCardinality5862543730218133400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3130791250856782689.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.49801e+12,0.0617,6680,1026,44,6646,398,444,6328,49,1268,0


Converting to forward existential form...Done !
original formula: E((EF((i16.u60.p255==1)) + A((EG((i16.u56.p206==0)) + (i6.i1.u13.p40==0)) U (AF(!(((i0.i0.u0.p0==0)||(i6.i0.u11.p42==1)))) * EF((i16.u60....389
=> equivalent forward existential formula: [((EY(FwdU(Init,(E(TRUE U (i16.u60.p255==1)) + !((E(!((!(EG(!(!(((i0.i0.u0.p0==0)||(i6.i0.u11.p42==1)))))) * E(T...818
Reverse transition relation is NOT exact ! Due to transitions t102, t108, t114, i0.i1.u29.t81, i1.u27.t85, i2.t98, i2.u19.t101, i2.u21.t97, i3.t118, i3.u5....604
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,8.82093,383672,1,0,838044,1040,3054,1.13681e+06,262,8096,1100113
FORMULA BusinessProcesses-PT-02-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-21 23:25:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:25:57] [INFO ] Flatten gal took : 3 ms
Total runtime 361332 ms.

BK_STOP 1716333957880

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399500457"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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