Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400354.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 23:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 85K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652623769716

Running Version 202205111006
[2022-05-15 14:09:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 14:09:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:09:31] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-15 14:09:31] [INFO ] Transformed 368 places.
[2022-05-15 14:09:31] [INFO ] Transformed 319 transitions.
[2022-05-15 14:09:31] [INFO ] Found NUPN structural information;
[2022-05-15 14:09:31] [INFO ] Parsed PT model containing 368 places and 319 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 transitions.
Support contains 105 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 327 transition count 280
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 327 transition count 280
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 315 transition count 268
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 315 transition count 268
Applied a total of 102 rules in 81 ms. Remains 315 /367 variables (removed 52) and now considering 268/318 (removed 50) transitions.
// Phase 1: matrix 268 rows 315 cols
[2022-05-15 14:09:31] [INFO ] Computed 55 place invariants in 21 ms
[2022-05-15 14:09:31] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 268 rows 315 cols
[2022-05-15 14:09:31] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-15 14:09:31] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 315 cols
[2022-05-15 14:09:31] [INFO ] Computed 55 place invariants in 8 ms
[2022-05-15 14:09:31] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 315/367 places, 268/318 transitions.
Finished structural reductions, in 1 iterations. Remains : 315/367 places, 268/318 transitions.
Support contains 105 out of 315 places after structural reductions.
[2022-05-15 14:09:32] [INFO ] Flatten gal took : 71 ms
[2022-05-15 14:09:32] [INFO ] Flatten gal took : 25 ms
[2022-05-15 14:09:32] [INFO ] Input system was already deterministic with 268 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 77) seen :57
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 268 rows 315 cols
[2022-05-15 14:09:33] [INFO ] Computed 55 place invariants in 5 ms
[2022-05-15 14:09:33] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2022-05-15 14:09:33] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2022-05-15 14:09:33] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2022-05-15 14:09:34] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :16
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 0 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2022-05-15 14:09:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 1 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1010 ms
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 0 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2022-05-15 14:09:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 445 ms
[2022-05-15 14:09:36] [INFO ] After 2306ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :16
Attempting to minimize the solution found.
Minimization took 232 ms.
[2022-05-15 14:09:36] [INFO ] After 2941ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :16
Fused 20 Parikh solutions to 16 different solutions.
Parikh walk visited 3 properties in 130 ms.
Support contains 20 out of 315 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (complete) has 654 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 314 transition count 231
Reduce places removed 35 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 279 transition count 227
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 275 transition count 227
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 80 place count 275 transition count 169
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 207 place count 206 transition count 169
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 236 place count 177 transition count 140
Iterating global reduction 3 with 29 rules applied. Total rules applied 265 place count 177 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 267 place count 177 transition count 138
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 269 place count 176 transition count 137
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 405 place count 107 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 406 place count 106 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 407 place count 105 transition count 69
Applied a total of 407 rules in 56 ms. Remains 105 /315 variables (removed 210) and now considering 69/268 (removed 199) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/315 places, 69/268 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Finished Best-First random walk after 6910 steps, including 2 resets, run visited all 1 properties in 14 ms. (steps per millisecond=493 )
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2022-05-15 14:09:36] [INFO ] Flatten gal took : 16 ms
[2022-05-15 14:09:36] [INFO ] Flatten gal took : 16 ms
[2022-05-15 14:09:36] [INFO ] Input system was already deterministic with 268 transitions.
Support contains 93 out of 315 places (down from 95) after GAL structural reductions.
Computed a total of 308 stabilizing places and 258 stable transitions
Graph (complete) has 654 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (complete) has 654 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 313 transition count 225
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 272 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 270 transition count 223
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 87 place count 270 transition count 158
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 230 place count 192 transition count 158
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 266 place count 156 transition count 122
Iterating global reduction 3 with 36 rules applied. Total rules applied 302 place count 156 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 304 place count 156 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 305 place count 155 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 305 place count 155 transition count 118
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 310 place count 152 transition count 118
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 444 place count 84 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 445 place count 84 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 446 place count 83 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 447 place count 82 transition count 50
Applied a total of 447 rules in 53 ms. Remains 82 /315 variables (removed 233) and now considering 50/268 (removed 218) transitions.
// Phase 1: matrix 50 rows 82 cols
[2022-05-15 14:09:36] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-15 14:09:37] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 50 rows 82 cols
[2022-05-15 14:09:37] [INFO ] Computed 38 place invariants in 0 ms
[2022-05-15 14:09:37] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 149 ms to find 35 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/315 places, 50/268 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 47 transition count 42
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 39 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 35 transition count 38
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 35 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 35 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 33 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 32 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 32 transition count 35
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 4 with 2 rules applied. Total rules applied 32 place count 31 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 31 transition count 34
Applied a total of 33 rules in 13 ms. Remains 31 /47 variables (removed 16) and now considering 34/50 (removed 16) transitions.
// Phase 1: matrix 34 rows 31 cols
[2022-05-15 14:09:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 14:09:37] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 34 rows 31 cols
[2022-05-15 14:09:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 14:09:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 14:09:37] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 30/315 places, 34/268 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 30/315 places, 34/268 transitions.
[2022-05-15 14:09:37] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:09:37] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:09:37] [INFO ] Input system was already deterministic with 34 transitions.
Finished random walk after 104 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
FORMULA BusinessProcesses-PT-05-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 282 transition count 235
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 282 transition count 234
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 272 transition count 224
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 272 transition count 224
Applied a total of 87 rules in 26 ms. Remains 272 /315 variables (removed 43) and now considering 224/268 (removed 44) transitions.
// Phase 1: matrix 224 rows 272 cols
[2022-05-15 14:09:37] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:09:37] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 224 rows 272 cols
[2022-05-15 14:09:37] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:09:37] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 272 cols
[2022-05-15 14:09:37] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:09:37] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/315 places, 224/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/315 places, 224/268 transitions.
[2022-05-15 14:09:37] [INFO ] Flatten gal took : 12 ms
[2022-05-15 14:09:37] [INFO ] Flatten gal took : 13 ms
[2022-05-15 14:09:37] [INFO ] Input system was already deterministic with 224 transitions.
[2022-05-15 14:09:37] [INFO ] Flatten gal took : 13 ms
[2022-05-15 14:09:37] [INFO ] Flatten gal took : 10 ms
[2022-05-15 14:09:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13638373429596827977.gal : 5 ms
[2022-05-15 14:09:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15520773376692643271.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13638373429596827977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15520773376692643271.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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.44344e+17,4.04229,123984,2,50185,5,295214,6,0,1312,695066,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.44344e+17,6.14913,160392,7723,25,156377,367,567,810731,41,855,0


Converting to forward existential form...Done !
original formula: ((A((((i7.i1.u69.p236==1) * AX((i17.i1.u72.p247==1))) * A((i3.u10.p29==1) U (i8.i1.u87.p338==1))) U EX((i15.i1.u56.p177!=1))) * EF(AX((((...366
=> equivalent forward existential formula: ((([((FwdU(Init,!(EX((i15.i1.u56.p177!=1)))) * !((((i7.i1.u69.p236==1) * !(EX(!((i17.i1.u72.p247==1))))) * !((E(...635
Reverse transition relation is NOT exact ! Due to transitions t103, t153, t157, t162, t202, t204, t205, t206, t209, t215, u16.t151, i0.i0.u75.t32, i0.i1.u3...900
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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 282 transition count 235
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 282 transition count 234
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 275 transition count 227
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 275 transition count 227
Applied a total of 81 rules in 18 ms. Remains 275 /315 variables (removed 40) and now considering 227/268 (removed 41) transitions.
// Phase 1: matrix 227 rows 275 cols
[2022-05-15 14:10:38] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-15 14:10:38] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 227 rows 275 cols
[2022-05-15 14:10:38] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:10:38] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
// Phase 1: matrix 227 rows 275 cols
[2022-05-15 14:10:38] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:10:38] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/315 places, 227/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 275/315 places, 227/268 transitions.
[2022-05-15 14:10:38] [INFO ] Flatten gal took : 9 ms
[2022-05-15 14:10:38] [INFO ] Flatten gal took : 8 ms
[2022-05-15 14:10:38] [INFO ] Input system was already deterministic with 227 transitions.
[2022-05-15 14:10:38] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:10:38] [INFO ] Flatten gal took : 8 ms
[2022-05-15 14:10:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3972974965597080815.gal : 1 ms
[2022-05-15 14:10:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12500146695734144855.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3972974965597080815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12500146695734144855.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.45814e+17,3.62703,111928,2,47037,5,271627,6,0,1327,625337,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.45814e+17,0.293813,15072,2352,28,17766,346,572,39830,43,868,0


Converting to forward existential form...Done !
original formula: E(!(((i1.u2.p7==1) + ((EX(((i18.u85.p327==1) + AF((i8.u14.p40==1)))) * !(EF((i18.u87.p334==1)))) * A((i12.i0.u38.p119==1) U AX((i6.i0.u10...334
=> equivalent forward existential formula: ([((FwdU(Init,!(((i1.u2.p7==1) + ((EX(((i18.u85.p327==1) + !(EG(!((i8.u14.p40==1)))))) * !(E(TRUE U (i18.u87.p33...801
Reverse transition relation is NOT exact ! Due to transitions t103, t154, t160, t165, t205, t207, t208, t212, t218, i0.u72.t40, i0.u73.t37, i0.u74.t34, i1....942
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 a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 285 transition count 238
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 285 transition count 237
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 277 transition count 229
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 277 transition count 229
Applied a total of 77 rules in 19 ms. Remains 277 /315 variables (removed 38) and now considering 229/268 (removed 39) transitions.
// Phase 1: matrix 229 rows 277 cols
[2022-05-15 14:11:38] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:11:39] [INFO ] Implicit Places using invariants in 683 ms returned []
// Phase 1: matrix 229 rows 277 cols
[2022-05-15 14:11:39] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:11:39] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
// Phase 1: matrix 229 rows 277 cols
[2022-05-15 14:11:39] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-15 14:11:39] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/315 places, 229/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 277/315 places, 229/268 transitions.
[2022-05-15 14:11:39] [INFO ] Flatten gal took : 8 ms
[2022-05-15 14:11:39] [INFO ] Flatten gal took : 8 ms
[2022-05-15 14:11:39] [INFO ] Input system was already deterministic with 229 transitions.
[2022-05-15 14:11:39] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:11:39] [INFO ] Flatten gal took : 9 ms
[2022-05-15 14:11:39] [INFO ] Time to serialize gal into /tmp/CTLFireability4766769828444192643.gal : 2 ms
[2022-05-15 14:11:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16406249721901130261.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4766769828444192643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16406249721901130261.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.59907e+17,4.85764,139944,2,58382,5,317611,6,0,1337,790516,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.59907e+17,0.254776,13964,2516,37,16826,488,611,27604,48,1113,0


Converting to forward existential form...Done !
original formula: EX(((((AX((i10.u47.p142==0)) * (i6.u93.p344==1)) * (AX((i4.i0.u6.p14==0)) + ((i20.u84.p297==1) * A((i20.u79.p269==1) U (i6.u29.p94==1))))...426
=> equivalent forward existential formula: ((([((EY(Init) * (!(EX(!((i10.u47.p142==0)))) * (i6.u93.p344==1))) * !(EX(!((i4.i0.u6.p14==0)))))] != FALSE + [(...924
Reverse transition relation is NOT exact ! Due to transitions t107, t159, t168, t207, t209, t211, t214, t220, i0.u31.t126, i0.u37.t114, i1.u22.t144, i2.t16...942
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 280 transition count 233
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 280 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 280 transition count 232
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 83 place count 268 transition count 220
Iterating global reduction 1 with 12 rules applied. Total rules applied 95 place count 268 transition count 220
Applied a total of 95 rules in 20 ms. Remains 268 /315 variables (removed 47) and now considering 220/268 (removed 48) transitions.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:12:40] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:12:40] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:12:40] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:12:40] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 268 cols
[2022-05-15 14:12:40] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:12:40] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/315 places, 220/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 268/315 places, 220/268 transitions.
[2022-05-15 14:12:40] [INFO ] Flatten gal took : 21 ms
[2022-05-15 14:12:40] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:12:40] [INFO ] Input system was already deterministic with 220 transitions.
[2022-05-15 14:12:40] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:12:40] [INFO ] Flatten gal took : 22 ms
[2022-05-15 14:12:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7180174359355892353.gal : 1 ms
[2022-05-15 14:12:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9089333511612801316.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7180174359355892353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9089333511612801316.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.44472e+17,3.08425,96872,2,40319,5,235997,6,0,1292,529964,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.44472e+17,0.23886,13836,2419,25,15790,363,582,35385,38,753,0


Converting to forward existential form...Done !
original formula: EF(AX((i18.i1.u56.p175==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((i18.i1.u56.p175==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t154, t159, t198, t201, t202, t205, t211, i0.u27.t127, i0.u31.t119, i1.u29.t123, i1.u74.t33, ...872
(forward)formula 0,1,1.84441,78160,1,0,153127,363,2853,246682,155,753,380241
FORMULA BusinessProcesses-PT-05-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (trivial) has 181 edges and 315 vertex of which 7 / 315 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 646 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 307 transition count 209
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 258 transition count 209
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 100 place count 258 transition count 153
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 224 place count 190 transition count 153
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 259 place count 155 transition count 118
Iterating global reduction 2 with 35 rules applied. Total rules applied 294 place count 155 transition count 118
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 294 place count 155 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 299 place count 152 transition count 116
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 437 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 438 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 439 place count 80 transition count 47
Applied a total of 439 rules in 37 ms. Remains 80 /315 variables (removed 235) and now considering 47/268 (removed 221) transitions.
// Phase 1: matrix 47 rows 80 cols
[2022-05-15 14:13:12] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 14:13:13] [INFO ] Implicit Places using invariants in 54 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/315 places, 47/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 79/315 places, 47/268 transitions.
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:13:13] [INFO ] Input system was already deterministic with 47 transitions.
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 1 ms
[2022-05-15 14:13:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13482642152754370134.gal : 0 ms
[2022-05-15 14:13:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17761145348094504356.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13482642152754370134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17761145348094504356.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,65,0.020733,4896,2,265,5,1702,6,0,363,1476,0


Converting to forward existential form...Done !
original formula: EF(AG((p356==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p356==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,0,0.052737,6716,1,0,56,6484,115,45,2316,4191,103
FORMULA BusinessProcesses-PT-05-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (trivial) has 181 edges and 315 vertex of which 7 / 315 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 646 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 307 transition count 209
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 258 transition count 209
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 100 place count 258 transition count 152
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 227 place count 188 transition count 152
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 261 place count 154 transition count 118
Iterating global reduction 2 with 34 rules applied. Total rules applied 295 place count 154 transition count 118
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 295 place count 154 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 300 place count 151 transition count 116
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 437 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 438 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 439 place count 80 transition count 47
Applied a total of 439 rules in 38 ms. Remains 80 /315 variables (removed 235) and now considering 47/268 (removed 221) transitions.
// Phase 1: matrix 47 rows 80 cols
[2022-05-15 14:13:13] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 14:13:13] [INFO ] Implicit Places using invariants in 92 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/315 places, 47/268 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 79/315 places, 47/268 transitions.
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:13:13] [INFO ] Input system was already deterministic with 47 transitions.
Finished random walk after 2828 steps, including 849 resets, run visited all 1 properties in 12 ms. (steps per millisecond=235 )
FORMULA BusinessProcesses-PT-05-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (complete) has 654 edges and 315 vertex of which 314 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 313 transition count 232
Reduce places removed 34 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 38 rules applied. Total rules applied 73 place count 279 transition count 228
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 275 transition count 228
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 77 place count 275 transition count 173
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 198 place count 209 transition count 173
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 226 place count 181 transition count 145
Iterating global reduction 3 with 28 rules applied. Total rules applied 254 place count 181 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 256 place count 181 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 180 transition count 143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 257 place count 180 transition count 141
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 262 place count 177 transition count 141
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 400 place count 107 transition count 73
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 401 place count 107 transition count 72
Applied a total of 401 rules in 40 ms. Remains 107 /315 variables (removed 208) and now considering 72/268 (removed 196) transitions.
// Phase 1: matrix 72 rows 107 cols
[2022-05-15 14:13:13] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:13:13] [INFO ] Implicit Places using invariants in 60 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 106/315 places, 72/268 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 106/315 places, 72/268 transitions.
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 3 ms
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:13:13] [INFO ] Input system was already deterministic with 72 transitions.
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 3 ms
[2022-05-15 14:13:13] [INFO ] Flatten gal took : 3 ms
[2022-05-15 14:13:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16871571355503453590.gal : 1 ms
[2022-05-15 14:13:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6783170301404313618.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16871571355503453590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6783170301404313618.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,75748,0.050056,6768,2,1548,5,5950,6,0,495,6763,0


Converting to forward existential form...Done !
original formula: E(!(((p93==1) * EF((p114!=1)))) U !((((E(!(AF((p28==1))) U (p235==1)) + A(A((p221==1) U (p330==1)) U ((((p134==1)&&(p214==1))&&(p367==1))...286
=> equivalent forward existential formula: [FwdG(((FwdU(Init,!(((p93==1) * E(TRUE U (p114!=1))))) * !(((E(!(!(EG(!((p28==1))))) U (p235==1)) + !((E(!(((((p...623
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t6, t13, t14, t16, t18, t30, t31, t40, t44, t45, t52, t53, t54, t55, t71, Intersecti...242
Hit Full ! (commute/partial/dont) 70/0/2
(forward)formula 0,1,3.29862,124348,1,0,1058,642856,224,659,3496,786232,1366
FORMULA BusinessProcesses-PT-05-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (trivial) has 178 edges and 315 vertex of which 7 / 315 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 646 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 307 transition count 210
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 259 transition count 210
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 98 place count 259 transition count 155
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 220 place count 192 transition count 155
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 255 place count 157 transition count 120
Iterating global reduction 2 with 35 rules applied. Total rules applied 290 place count 157 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 290 place count 157 transition count 118
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 295 place count 154 transition count 118
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 433 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 435 place count 82 transition count 49
Applied a total of 435 rules in 17 ms. Remains 82 /315 variables (removed 233) and now considering 49/268 (removed 219) transitions.
// Phase 1: matrix 49 rows 82 cols
[2022-05-15 14:13:16] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-15 14:13:16] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 49 rows 82 cols
[2022-05-15 14:13:16] [INFO ] Computed 39 place invariants in 1 ms
[2022-05-15 14:13:16] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 54, 56, 58, 60, 62]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 121 ms to find 37 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/315 places, 49/268 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 45 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 38 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 33 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 33 transition count 37
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 33 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 30 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 29 transition count 33
Applied a total of 32 rules in 3 ms. Remains 29 /45 variables (removed 16) and now considering 33/49 (removed 16) transitions.
// Phase 1: matrix 33 rows 29 cols
[2022-05-15 14:13:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 14:13:16] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 33 rows 29 cols
[2022-05-15 14:13:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 14:13:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 29/315 places, 33/268 transitions.
Finished structural reductions, in 2 iterations. Remains : 29/315 places, 33/268 transitions.
[2022-05-15 14:13:16] [INFO ] Flatten gal took : 1 ms
[2022-05-15 14:13:16] [INFO ] Flatten gal took : 1 ms
[2022-05-15 14:13:16] [INFO ] Input system was already deterministic with 33 transitions.
[2022-05-15 14:13:16] [INFO ] Flatten gal took : 1 ms
[2022-05-15 14:13:16] [INFO ] Flatten gal took : 1 ms
[2022-05-15 14:13:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11395939882780258959.gal : 8 ms
[2022-05-15 14:13:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14522609198126215622.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11395939882780258959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14522609198126215622.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,90,0.014766,4604,2,82,5,536,6,0,149,488,0


Converting to forward existential form...Done !
original formula: EF(AG((((p81==1)&&(p239==1))&&(p331==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p81==1)&&(p239==1))&&(p331==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t31, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,0,0.0236,5100,1,0,49,1944,87,32,882,1571,75
FORMULA BusinessProcesses-PT-05-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (trivial) has 179 edges and 315 vertex of which 7 / 315 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 646 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 307 transition count 210
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 259 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 258 transition count 209
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 100 place count 258 transition count 153
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 224 place count 190 transition count 153
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 257 place count 157 transition count 120
Iterating global reduction 3 with 33 rules applied. Total rules applied 290 place count 157 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 290 place count 157 transition count 118
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 295 place count 154 transition count 118
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 428 place count 87 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 429 place count 86 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 430 place count 85 transition count 51
Applied a total of 430 rules in 30 ms. Remains 85 /315 variables (removed 230) and now considering 51/268 (removed 217) transitions.
// Phase 1: matrix 51 rows 85 cols
[2022-05-15 14:13:16] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-15 14:13:17] [INFO ] Implicit Places using invariants in 45 ms returned [74, 82]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 83/315 places, 51/268 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 83/315 places, 51/268 transitions.
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:13:17] [INFO ] Input system was already deterministic with 51 transitions.
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 3 ms
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:13:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11287520744623788296.gal : 0 ms
[2022-05-15 14:13:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17758431802482318987.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11287520744623788296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17758431802482318987.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,71,0.021233,5136,2,443,5,2117,6,0,382,1802,0


Converting to forward existential form...Done !
original formula: A(!(A(!(E((p141==1) U (p63!=1))) U (p291==1))) U EF((p120==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p120==1)))))) * !(E(!(E(TRUE U (p120==1))) U (!(!(!((E(!((p291==1)) U (!(!(E((p141==1...249
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t28, t50, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.114605,9536,1,0,129,20012,141,110,2660,15834,219
FORMULA BusinessProcesses-PT-05-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 282 transition count 235
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 282 transition count 234
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 272 transition count 224
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 272 transition count 224
Applied a total of 87 rules in 14 ms. Remains 272 /315 variables (removed 43) and now considering 224/268 (removed 44) transitions.
// Phase 1: matrix 224 rows 272 cols
[2022-05-15 14:13:17] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:13:17] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 224 rows 272 cols
[2022-05-15 14:13:17] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:13:17] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 272 cols
[2022-05-15 14:13:17] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:13:17] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/315 places, 224/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/315 places, 224/268 transitions.
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:13:17] [INFO ] Input system was already deterministic with 224 transitions.
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:13:17] [INFO ] Flatten gal took : 9 ms
[2022-05-15 14:13:17] [INFO ] Time to serialize gal into /tmp/CTLFireability13700911918173308752.gal : 1 ms
[2022-05-15 14:13:17] [INFO ] Time to serialize properties into /tmp/CTLFireability4172162169906109097.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13700911918173308752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4172162169906109097.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.41613e+17,4.68164,125336,2,54796,5,293967,6,0,1312,695409,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.41613e+17,0.283858,15476,2636,35,18277,359,551,38179,48,754,0


Converting to forward existential form...Done !
original formula: EG((AX(EF((i1.u29.p94==1))) * (((EX((i19.u62.p200==1)) + EG(AF((i13.u40.p126==1)))) + (AX(EX((i1.u4.p8==1))) + (i20.u88.p339==0))) + ((i1...255
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(E(TRUE U (i1.u29.p94==1))))) * (((EX((i19.u62.p200==1)) + EG(!(EG(!((i13.u40.p126==1)))))) + ...322
Reverse transition relation is NOT exact ! Due to transitions t103, t158, t163, t202, t205, t206, t209, t215, i0.u37.t110, i1.u29.t125, i1.u29.t126, i1.u29...877
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (trivial) has 182 edges and 315 vertex of which 7 / 315 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 646 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 307 transition count 209
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 258 transition count 209
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 100 place count 258 transition count 152
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 227 place count 188 transition count 152
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 262 place count 153 transition count 117
Iterating global reduction 2 with 35 rules applied. Total rules applied 297 place count 153 transition count 117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 297 place count 153 transition count 115
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 302 place count 150 transition count 115
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 432 place count 84 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 83 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 434 place count 82 transition count 50
Applied a total of 434 rules in 24 ms. Remains 82 /315 variables (removed 233) and now considering 50/268 (removed 218) transitions.
// Phase 1: matrix 50 rows 82 cols
[2022-05-15 14:14:17] [INFO ] Computed 38 place invariants in 1 ms
[2022-05-15 14:14:17] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 50 rows 82 cols
[2022-05-15 14:14:17] [INFO ] Computed 38 place invariants in 3 ms
[2022-05-15 14:14:18] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [9, 10, 11, 12, 13, 14, 15, 16, 17, 49, 51, 53, 55, 57, 59, 61, 63]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 134 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/315 places, 50/268 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 62 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 62 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 61 transition count 46
Applied a total of 8 rules in 9 ms. Remains 61 /65 variables (removed 4) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 61 cols
[2022-05-15 14:14:18] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-15 14:14:18] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 46 rows 61 cols
[2022-05-15 14:14:18] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-15 14:14:18] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 61/315 places, 46/268 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/315 places, 46/268 transitions.
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:14:18] [INFO ] Input system was already deterministic with 46 transitions.
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:14:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3809681142348941381.gal : 1 ms
[2022-05-15 14:14:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10492053519575443647.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3809681142348941381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10492053519575443647.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,85,0.022658,5216,2,495,5,1609,6,0,288,1233,0


Converting to forward existential form...Done !
original formula: AG(EF(((p144==0)&&(p14==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p144==0)&&(p14==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t19, t24, t44, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,1,0.070059,7184,1,0,68,8793,112,47,1950,5687,109
FORMULA BusinessProcesses-PT-05-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 286 transition count 239
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 286 transition count 239
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 277 transition count 230
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 277 transition count 230
Applied a total of 76 rules in 16 ms. Remains 277 /315 variables (removed 38) and now considering 230/268 (removed 38) transitions.
// Phase 1: matrix 230 rows 277 cols
[2022-05-15 14:14:18] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:14:18] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 230 rows 277 cols
[2022-05-15 14:14:18] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:14:18] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 277 cols
[2022-05-15 14:14:18] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:14:18] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/315 places, 230/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 277/315 places, 230/268 transitions.
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:14:18] [INFO ] Input system was already deterministic with 230 transitions.
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:14:18] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:14:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7296916326490875731.gal : 1 ms
[2022-05-15 14:14:18] [INFO ] Time to serialize properties into /tmp/CTLFireability13108142181237296666.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7296916326490875731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13108142181237296666.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.86824e+17,4.3268,137136,2,60337,5,317417,6,0,1338,772002,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.86824e+17,0.213366,13012,1949,33,13956,393,588,29878,45,1213,0


Converting to forward existential form...Done !
original formula: AX((EG(((i20.u77.p285==1) * !(A((i18.u50.p150==1) U (i3.i0.u9.p24==1))))) + ((AG(!(A((i0.u37.p116==1) U (i0.u38.p119==1)))) * (i1.u27.p87...316
=> equivalent forward existential formula: (([((FwdU((EY(Init) * !(EG(((i20.u77.p285==1) * !(!((E(!((i3.i0.u9.p24==1)) U (!((i18.u50.p150==1)) * !((i3.i0.u...826
Reverse transition relation is NOT exact ! Due to transitions t162, t167, t208, t210, t211, t212, t215, t221, i0.u37.t114, i1.u27.t133, i1.u27.t134, i1.u27...967
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 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
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 279 transition count 232
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 279 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 279 transition count 231
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 85 place count 267 transition count 219
Iterating global reduction 1 with 12 rules applied. Total rules applied 97 place count 267 transition count 219
Applied a total of 97 rules in 14 ms. Remains 267 /315 variables (removed 48) and now considering 219/268 (removed 49) transitions.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:15:19] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:15:19] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:15:19] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:15:19] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 267 cols
[2022-05-15 14:15:19] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:15:19] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/315 places, 219/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 267/315 places, 219/268 transitions.
[2022-05-15 14:15:19] [INFO ] Flatten gal took : 9 ms
[2022-05-15 14:15:19] [INFO ] Flatten gal took : 8 ms
[2022-05-15 14:15:19] [INFO ] Input system was already deterministic with 219 transitions.
[2022-05-15 14:15:19] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:15:19] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:15:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7848042309645208223.gal : 1 ms
[2022-05-15 14:15:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15306383209097259012.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7848042309645208223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15306383209097259012.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.41012e+17,2.87542,95824,2,39435,5,233790,6,0,1287,522191,0


Converting to forward existential form...Done !
original formula: AG(EX((p54==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p54==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t60, t63, t66, t69, t72, t75, t78, t81...460
Detected timeout of ITS tools.
[2022-05-15 14:15:49] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:15:49] [INFO ] Applying decomposition
[2022-05-15 14:15:49] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6258111174114550171.txt' '-o' '/tmp/graph6258111174114550171.bin' '-w' '/tmp/graph6258111174114550171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6258111174114550171.bin' '-l' '-1' '-v' '-w' '/tmp/graph6258111174114550171.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:15:49] [INFO ] Decomposing Gal with order
[2022-05-15 14:15:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:15:49] [INFO ] Removed a total of 73 redundant transitions.
[2022-05-15 14:15:49] [INFO ] Flatten gal took : 14 ms
[2022-05-15 14:15:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2022-05-15 14:15:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6979784531078957800.gal : 2 ms
[2022-05-15 14:15:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6465111685028062153.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6979784531078957800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6465111685028062153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.41012e+17,0.181812,10272,1555,26,10102,375,518,17736,35,813,0


Converting to forward existential form...Done !
original formula: AG(EX((i3.i0.u18.p54==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((i3.i0.u18.p54==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t99, t158, t197, t200, t201, t204, t210, u12.t156, i0.u34.t110, i0.u36.t106, i1.u28.t122, i1....846
(forward)formula 0,0,0.902578,43656,1,0,83075,375,2659,141552,146,813,189705
FORMULA BusinessProcesses-PT-05-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 283 transition count 236
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 283 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 283 transition count 235
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 273 transition count 225
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 273 transition count 225
Applied a total of 85 rules in 12 ms. Remains 273 /315 variables (removed 42) and now considering 225/268 (removed 43) transitions.
// Phase 1: matrix 225 rows 273 cols
[2022-05-15 14:15:50] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-15 14:15:50] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 225 rows 273 cols
[2022-05-15 14:15:50] [INFO ] Computed 55 place invariants in 3 ms
[2022-05-15 14:15:51] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 273 cols
[2022-05-15 14:15:51] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 14:15:51] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/315 places, 225/268 transitions.
Finished structural reductions, in 1 iterations. Remains : 273/315 places, 225/268 transitions.
[2022-05-15 14:15:51] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:15:51] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:15:51] [INFO ] Input system was already deterministic with 225 transitions.
[2022-05-15 14:15:51] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:15:51] [INFO ] Flatten gal took : 27 ms
[2022-05-15 14:15:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16236982597090145418.gal : 19 ms
[2022-05-15 14:15:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7652370402455841910.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16236982597090145418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7652370402455841910.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.41126e+17,2.82553,93512,2,39978,5,229525,6,0,1317,498057,0


Converting to forward existential form...Done !
original formula: EX((((p357==0) * AX((p307==0))) * AG(A((p317==1) U EF((p333==1))))))
=> equivalent forward existential formula: [((EY(Init) * ((p357==0) * !(EX(!((p307==0)))))) * !(E(TRUE U !(!((E(!(E(TRUE U (p333==1))) U (!((p317==1)) * !(...222
Reverse transition relation is NOT exact ! Due to transitions t5, t12, t15, t16, t19, t20, t29, t36, t39, t42, t45, t48, t51, t54, t57, t60, t63, t66, t69,...480
Detected timeout of ITS tools.
[2022-05-15 14:16:21] [INFO ] Flatten gal took : 12 ms
[2022-05-15 14:16:21] [INFO ] Applying decomposition
[2022-05-15 14:16:21] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10410563268396692702.txt' '-o' '/tmp/graph10410563268396692702.bin' '-w' '/tmp/graph10410563268396692702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10410563268396692702.bin' '-l' '-1' '-v' '-w' '/tmp/graph10410563268396692702.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:16:21] [INFO ] Decomposing Gal with order
[2022-05-15 14:16:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:16:21] [INFO ] Removed a total of 70 redundant transitions.
[2022-05-15 14:16:21] [INFO ] Flatten gal took : 12 ms
[2022-05-15 14:16:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2022-05-15 14:16:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2572414553066303572.gal : 2 ms
[2022-05-15 14:16:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15163842733853851252.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2572414553066303572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15163842733853851252.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.41126e+17,0.281984,15864,2272,28,18897,375,564,42529,40,847,0


Converting to forward existential form...Done !
original formula: EX((((i19.u92.p357==0) * AX((i4.u81.p307==0))) * AG(A((i14.i0.u83.p317==1) U EF((i19.u86.p333==1))))))
=> equivalent forward existential formula: [((EY(Init) * ((i19.u92.p357==0) * !(EX(!((i4.u81.p307==0)))))) * !(E(TRUE U !(!((E(!(E(TRUE U (i19.u86.p333==1)...272
Reverse transition relation is NOT exact ! Due to transitions t155, t159, t164, t203, t206, t207, t216, i0.i0.u74.t36, i0.i1.u29.t128, i1.i0.t105, i1.i0.u3...916
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 315/315 places, 268/268 transitions.
Graph (trivial) has 179 edges and 315 vertex of which 7 / 315 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 646 edges and 309 vertex of which 308 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 307 transition count 210
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 259 transition count 210
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 98 place count 259 transition count 155
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 220 place count 192 transition count 155
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 254 place count 158 transition count 121
Iterating global reduction 2 with 34 rules applied. Total rules applied 288 place count 158 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 288 place count 158 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 293 place count 155 transition count 119
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 433 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 435 place count 82 transition count 49
Applied a total of 435 rules in 42 ms. Remains 82 /315 variables (removed 233) and now considering 49/268 (removed 219) transitions.
// Phase 1: matrix 49 rows 82 cols
[2022-05-15 14:16:51] [INFO ] Computed 39 place invariants in 0 ms
[2022-05-15 14:16:51] [INFO ] Implicit Places using invariants in 88 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 81/315 places, 49/268 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 81/315 places, 49/268 transitions.
[2022-05-15 14:16:51] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:16:51] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:16:51] [INFO ] Input system was already deterministic with 49 transitions.
[2022-05-15 14:16:51] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:16:51] [INFO ] Flatten gal took : 2 ms
[2022-05-15 14:16:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13512871070370385034.gal : 1 ms
[2022-05-15 14:16:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4651525690255732524.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13512871070370385034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4651525690255732524.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,99,0.017873,5516,2,334,5,1840,6,0,373,1850,0


Converting to forward existential form...Done !
original formula: E(EF((p257==1)) U (p125==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (p257==1))) * (p125==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t24, t25, t48, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,1,0.083258,8420,1,0,122,12710,123,105,2405,15637,195
FORMULA BusinessProcesses-PT-05-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-05-15 14:16:51] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:16:51] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:16:51] [INFO ] Applying decomposition
[2022-05-15 14:16:51] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5134604807353027829.txt' '-o' '/tmp/graph5134604807353027829.bin' '-w' '/tmp/graph5134604807353027829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5134604807353027829.bin' '-l' '-1' '-v' '-w' '/tmp/graph5134604807353027829.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:16:51] [INFO ] Decomposing Gal with order
[2022-05-15 14:16:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:16:51] [INFO ] Removed a total of 62 redundant transitions.
[2022-05-15 14:16:51] [INFO ] Flatten gal took : 13 ms
[2022-05-15 14:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 14:16:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10459618011438211140.gal : 3 ms
[2022-05-15 14:16:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4332324092059621556.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10459618011438211140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4332324092059621556.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 6 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.99426e+17,0.315752,15444,2417,70,18068,1280,753,36987,68,5154,0


Converting to forward existential form...Done !
original formula: ((A((((i6.i2.u81.p236==1) * AX((i15.i1.u83.p247==1))) * A((i8.i0.u11.p29==1) U (i0.u106.p338==1))) U EX((i9.i1.u62.p177!=1))) * EF(AX((((...396
=> equivalent forward existential formula: ((([((FwdU(Init,!(EX((i9.i1.u62.p177!=1)))) * !((((i6.i2.u81.p236==1) * !(EX(!((i15.i1.u83.p247==1))))) * !((E(!...659
Reverse transition relation is NOT exact ! Due to transitions t137, t194, t200, t205, i0.u25.t176, i0.u27.t170, i0.u27.t171, i0.u27.t172, i0.u29.t165, i0.u...1412
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,41.6525,1000028,1,0,1.44589e+06,1280,4723,2.91302e+06,315,5154,1687048
FORMULA BusinessProcesses-PT-05-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(((i4.u3.p7==1) + ((EX(((i17.i1.u103.p327==1) + AF((i7.i0.u15.p40==1)))) * !(EF((i17.i1.u105.p334==1)))) * A((i10.i1.u41.p119==1) U AX...359
=> equivalent forward existential formula: ([((FwdU(Init,!(((i4.u3.p7==1) + ((EX(((i17.i1.u103.p327==1) + !(EG(!((i7.i0.u15.p40==1)))))) * !(E(TRUE U (i17....840
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 1,0,77.5796,1730444,1,0,2.41739e+06,1280,5022,4.65155e+06,331,5154,2568848
FORMULA BusinessProcesses-PT-05-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(((((AX((i14.u49.p142==0)) * (i3.i0.u108.p344==1)) * (AX((i1.u6.p14==0)) + ((i17.i1.u95.p297==1) * A((i17.i1.u90.p269==1) U (i3.i0.u32....451
=> equivalent forward existential formula: ((([((EY(Init) * (!(EX(!((i14.u49.p142==0)))) * (i3.i0.u108.p344==1))) * !(EX(!((i1.u6.p14==0)))))] != FALSE + [...981
(forward)formula 2,0,141.86,2205680,1,0,3.03661e+06,1280,2476,5.77624e+06,172,5154,985496
FORMULA BusinessProcesses-PT-05-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((AX(EF((i3.i0.u32.p94==1))) * (((EX((i12.i1.u69.p200==1)) + EG(AF((i5.i0.u43.p126==1)))) + (AX(EX((i4.u3.p8==1))) + (i17.i1.u107.p339=...279
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(E(TRUE U (i3.i0.u32.p94==1))))) * (((EX((i12.i1.u69.p200==1)) + EG(!(EG(!((i5.i0.u43.p126==1)...346
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,1,157.96,2205680,1,0,3.03661e+06,1280,2874,5.77624e+06,192,5154,1588944
FORMULA BusinessProcesses-PT-05-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((EG(((i17.i0.u89.p285==1) * !(A((i7.i1.u52.p150==1) U (i8.i2.u9.p24==1))))) + ((AG(!(A((i10.i1.u40.p116==1) U (i10.i1.u41.p119==1)))) ...338
=> equivalent forward existential formula: (([((FwdU((EY(Init) * !(EG(((i17.i0.u89.p285==1) * !(!((E(!((i8.i2.u9.p24==1)) U (!((i7.i1.u52.p150==1)) * !((i8...866
(forward)formula 4,0,189.425,2205680,1,0,3.03661e+06,1649,3842,5.77624e+06,242,5829,2320215
FORMULA BusinessProcesses-PT-05-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((((i17.i1.u112.p357==0) * AX((i13.i1.u97.p307==0))) * AG(A((i18.i1.u100.p317==1) U EF((i17.i1.u105.p333==1))))))
=> equivalent forward existential formula: [((EY(Init) * ((i17.i1.u112.p357==0) * !(EX(!((i13.i1.u97.p307==0)))))) * !(E(TRUE U !(!((E(!(E(TRUE U (i17.i1.u...293
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 5,0,246.884,2430340,1,0,3.16618e+06,1662,2369,6.05431e+06,174,5905,798786
FORMULA BusinessProcesses-PT-05-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 688085 ms.

BK_STOP 1652624459017

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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