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-165251918500410.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-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:04 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 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 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 146K 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-12-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652629865845

Running Version 202205111006
[2022-05-15 15:51:06] [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 15:51:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:51:07] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-15 15:51:07] [INFO ] Transformed 586 places.
[2022-05-15 15:51:07] [INFO ] Transformed 525 transitions.
[2022-05-15 15:51:07] [INFO ] Found NUPN structural information;
[2022-05-15 15:51:07] [INFO ] Parsed PT model containing 586 places and 525 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Support contains 129 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 61 place count 521 transition count 463
Iterating global reduction 1 with 58 rules applied. Total rules applied 119 place count 521 transition count 463
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 146 place count 494 transition count 436
Iterating global reduction 1 with 27 rules applied. Total rules applied 173 place count 494 transition count 436
Applied a total of 173 rules in 101 ms. Remains 494 /582 variables (removed 88) and now considering 436/521 (removed 85) transitions.
// Phase 1: matrix 436 rows 494 cols
[2022-05-15 15:51:07] [INFO ] Computed 95 place invariants in 32 ms
[2022-05-15 15:51:07] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 436 rows 494 cols
[2022-05-15 15:51:07] [INFO ] Computed 95 place invariants in 10 ms
[2022-05-15 15:51:08] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
// Phase 1: matrix 436 rows 494 cols
[2022-05-15 15:51:08] [INFO ] Computed 95 place invariants in 11 ms
[2022-05-15 15:51:08] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 494/582 places, 436/521 transitions.
Finished structural reductions, in 1 iterations. Remains : 494/582 places, 436/521 transitions.
Support contains 129 out of 494 places after structural reductions.
[2022-05-15 15:51:08] [INFO ] Flatten gal took : 63 ms
[2022-05-15 15:51:08] [INFO ] Flatten gal took : 29 ms
[2022-05-15 15:51:08] [INFO ] Input system was already deterministic with 436 transitions.
Support contains 127 out of 494 places (down from 129) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 73) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 55) 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 55) 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 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) 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 55) 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 55) 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 55) 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 55) 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 55) 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 55) seen :0
Running SMT prover for 55 properties.
// Phase 1: matrix 436 rows 494 cols
[2022-05-15 15:51:11] [INFO ] Computed 95 place invariants in 4 ms
[2022-05-15 15:51:11] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2022-05-15 15:51:11] [INFO ] [Real]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 15:51:11] [INFO ] After 751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:55
[2022-05-15 15:51:12] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2022-05-15 15:51:12] [INFO ] [Nat]Absence check using 52 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 15:51:14] [INFO ] After 1259ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :44
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 4 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-15 15:51:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 778 ms
[2022-05-15 15:51:14] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2022-05-15 15:51:15] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2022-05-15 15:51:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2022-05-15 15:51:15] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2022-05-15 15:51:15] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 1 ms to minimize.
[2022-05-15 15:51:15] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-05-15 15:51:15] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2022-05-15 15:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 443 ms
[2022-05-15 15:51:15] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2022-05-15 15:51:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 109 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2022-05-15 15:51:16] [INFO ] Deduced a trap composed of 118 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:51:17] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:51:17] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1099 ms
[2022-05-15 15:51:17] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2022-05-15 15:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-15 15:51:17] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2022-05-15 15:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-15 15:51:17] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 1 ms to minimize.
[2022-05-15 15:51:17] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 1 ms to minimize.
[2022-05-15 15:51:17] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2022-05-15 15:51:18] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 1 ms to minimize.
[2022-05-15 15:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 491 ms
[2022-05-15 15:51:18] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 1 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 0 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 109 places in 99 ms of which 2 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 0 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 1 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 0 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2022-05-15 15:51:19] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:51:20] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 1 ms to minimize.
[2022-05-15 15:51:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1353 ms
[2022-05-15 15:51:20] [INFO ] After 7536ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :41
Attempting to minimize the solution found.
Minimization took 1115 ms.
[2022-05-15 15:51:21] [INFO ] After 9569ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :41
Fused 55 Parikh solutions to 39 different solutions.
Parikh walk visited 18 properties in 547 ms.
Support contains 35 out of 494 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (complete) has 1086 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 493 transition count 384
Reduce places removed 51 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 56 rules applied. Total rules applied 108 place count 442 transition count 379
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 437 transition count 379
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 113 place count 437 transition count 292
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 302 place count 335 transition count 292
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 320 place count 317 transition count 274
Iterating global reduction 3 with 18 rules applied. Total rules applied 338 place count 317 transition count 274
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 552 place count 208 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 554 place count 207 transition count 173
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 555 place count 207 transition count 172
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 564 place count 207 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 206 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 566 place count 205 transition count 171
Applied a total of 566 rules in 96 ms. Remains 205 /494 variables (removed 289) and now considering 171/436 (removed 265) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/494 places, 171/436 transitions.
Incomplete random walk after 10000 steps, including 811 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Probabilistic random walk after 1000001 steps, saw 161578 distinct states, run finished after 2227 ms. (steps per millisecond=449 ) properties seen :21
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 205 cols
[2022-05-15 15:51:24] [INFO ] Computed 75 place invariants in 5 ms
[2022-05-15 15:51:24] [INFO ] [Real]Absence check using 53 positive place invariants in 8 ms returned sat
[2022-05-15 15:51:24] [INFO ] [Real]Absence check using 53 positive and 22 generalized place invariants in 10 ms returned sat
[2022-05-15 15:51:25] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 15:51:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:51:25] [INFO ] After 8ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:51:25] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:51:25] [INFO ] [Nat]Absence check using 53 positive place invariants in 7 ms returned sat
[2022-05-15 15:51:25] [INFO ] [Nat]Absence check using 53 positive and 22 generalized place invariants in 5 ms returned sat
[2022-05-15 15:51:25] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 15:51:25] [INFO ] After 18ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 15:51:25] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-15 15:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-15 15:51:25] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-15 15:51:25] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 171/171 transitions.
Graph (trivial) has 39 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 204 transition count 161
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 196 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 17 place count 196 transition count 149
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 44 place count 181 transition count 149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 177 transition count 145
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 177 transition count 145
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 76 place count 165 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 164 transition count 132
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 164 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 162 transition count 130
Applied a total of 82 rules in 36 ms. Remains 162 /205 variables (removed 43) and now considering 130/171 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/205 places, 130/171 transitions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished Best-First random walk after 955 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=477 )
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2022-05-15 15:51:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-15 15:51:25] [INFO ] Flatten gal took : 26 ms
FORMULA BusinessProcesses-PT-12-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 15:51:25] [INFO ] Flatten gal took : 24 ms
[2022-05-15 15:51:25] [INFO ] Input system was already deterministic with 436 transitions.
Support contains 76 out of 494 places (down from 87) after GAL structural reductions.
Computed a total of 479 stabilizing places and 421 stable transitions
Graph (complete) has 1086 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (complete) has 1086 edges and 494 vertex of which 493 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 492 transition count 377
Reduce places removed 57 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 118 place count 435 transition count 374
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 432 transition count 374
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 121 place count 432 transition count 274
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 337 place count 316 transition count 274
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 363 place count 290 transition count 248
Iterating global reduction 3 with 26 rules applied. Total rules applied 389 place count 290 transition count 248
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 389 place count 290 transition count 246
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 393 place count 288 transition count 246
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 602 place count 183 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 182 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 604 place count 181 transition count 141
Applied a total of 604 rules in 52 ms. Remains 181 /494 variables (removed 313) and now considering 141/436 (removed 295) transitions.
// Phase 1: matrix 141 rows 181 cols
[2022-05-15 15:51:25] [INFO ] Computed 77 place invariants in 4 ms
[2022-05-15 15:51:25] [INFO ] Implicit Places using invariants in 124 ms returned [2, 9, 32, 33, 34, 35, 43, 44, 45, 55, 56, 57, 58, 59, 60, 63, 147, 153]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 130 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 163/494 places, 141/436 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 163/494 places, 141/436 transitions.
[2022-05-15 15:51:25] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:51:25] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:51:25] [INFO ] Input system was already deterministic with 141 transitions.
[2022-05-15 15:51:26] [INFO ] Flatten gal took : 9 ms
[2022-05-15 15:51:26] [INFO ] Flatten gal took : 9 ms
[2022-05-15 15:51:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12245849033076676519.gal : 8 ms
[2022-05-15 15:51:26] [INFO ] Time to serialize properties into /tmp/CTLFireability7192091171915868289.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/CTLFireability12245849033076676519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7192091171915868289.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,192308,0.115825,9168,2,2340,5,14972,6,0,793,14071,0


Converting to forward existential form...Done !
original formula: !(E((EF(((EF((p463==1)) * ((((p182==1)&&(p364==1))&&(p580==1))||(p432==1))) * !((((p150==1)&&(p348==1))&&((p547==1)&&(p224==1)))))) + EG(...222
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(E(TRUE U ((E(TRUE U (p463==1)) * ((((p182==1)&&(p364==1))&&(p580==1))||(p432==1))) * !((((p150...283
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t39, t40, t41, t42, t43, t44, t69, t70, t71, t73, t87, t99, t101, t102, t103, t114, t...272
(forward)formula 0,0,2.48749,99364,1,0,484,456166,283,349,6049,551253,675
FORMULA BusinessProcesses-PT-12-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (trivial) has 235 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1080 edges and 489 vertex of which 488 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 487 transition count 364
Reduce places removed 64 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 423 transition count 362
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 421 transition count 362
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 134 place count 421 transition count 271
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 332 place count 314 transition count 271
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 357 place count 289 transition count 246
Iterating global reduction 3 with 25 rules applied. Total rules applied 382 place count 289 transition count 246
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 382 place count 289 transition count 244
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 386 place count 287 transition count 244
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 595 place count 182 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 181 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 598 place count 180 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 599 place count 179 transition count 138
Applied a total of 599 rules in 56 ms. Remains 179 /494 variables (removed 315) and now considering 138/436 (removed 298) transitions.
// Phase 1: matrix 138 rows 179 cols
[2022-05-15 15:51:29] [INFO ] Computed 77 place invariants in 1 ms
[2022-05-15 15:51:29] [INFO ] Implicit Places using invariants in 114 ms returned [0, 1, 5, 6, 31, 32, 33, 34, 41, 42, 45, 55, 56, 57, 58, 59, 60, 61, 136, 142, 173, 175, 177]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 124 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/494 places, 138/436 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 156/494 places, 138/436 transitions.
[2022-05-15 15:51:29] [INFO ] Flatten gal took : 9 ms
[2022-05-15 15:51:29] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:51:29] [INFO ] Input system was already deterministic with 138 transitions.
[2022-05-15 15:51:29] [INFO ] Flatten gal took : 8 ms
[2022-05-15 15:51:29] [INFO ] Flatten gal took : 9 ms
[2022-05-15 15:51:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9117864143601452654.gal : 2 ms
[2022-05-15 15:51:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1788959920747778717.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/CTLFireability9117864143601452654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1788959920747778717.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,48378,0.114502,9552,2,2882,5,13538,6,0,762,9554,0


Converting to forward existential form...Done !
original formula: A(AF((((p550==1)&&(p553==1))&&(p556==1))) U E(AG((p453==1)) U E(!(EG((p178==1))) U (EF((p412==1)) * (((p337==1)||(p411==1))||((p167==1)||...169
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(E(TRUE U !((p453==1)))) U E(!(EG((p178==1))) U (E(TRUE U (p412==1)) * (((p337==1)||(p411==1...518
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t10, t34, t35, t36, t37, t38, t40, t65, t66, t67, t68, t91, t100, t101, t102, t11...282
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.0041,113088,1,0,488,609891,285,280,6026,513953,590
FORMULA BusinessProcesses-PT-12-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 465 transition count 407
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 465 transition count 407
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 456 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 456 transition count 398
Applied a total of 76 rules in 24 ms. Remains 456 /494 variables (removed 38) and now considering 398/436 (removed 38) transitions.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:51:32] [INFO ] Computed 95 place invariants in 34 ms
[2022-05-15 15:51:32] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:51:32] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:51:33] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:51:33] [INFO ] Computed 95 place invariants in 5 ms
[2022-05-15 15:51:33] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 456/494 places, 398/436 transitions.
Finished structural reductions, in 1 iterations. Remains : 456/494 places, 398/436 transitions.
[2022-05-15 15:51:33] [INFO ] Flatten gal took : 16 ms
[2022-05-15 15:51:33] [INFO ] Flatten gal took : 16 ms
[2022-05-15 15:51:33] [INFO ] Input system was already deterministic with 398 transitions.
[2022-05-15 15:51:33] [INFO ] Flatten gal took : 15 ms
[2022-05-15 15:51:33] [INFO ] Flatten gal took : 16 ms
[2022-05-15 15:51:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15664066866024999425.gal : 3 ms
[2022-05-15 15:51:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5100031133399520121.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/CTLFireability15664066866024999425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5100031133399520121.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.
Detected timeout of ITS tools.
[2022-05-15 15:52:03] [INFO ] Flatten gal took : 15 ms
[2022-05-15 15:52:03] [INFO ] Applying decomposition
[2022-05-15 15:52:03] [INFO ] Flatten gal took : 15 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/graph12416736091911923456.txt' '-o' '/tmp/graph12416736091911923456.bin' '-w' '/tmp/graph12416736091911923456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12416736091911923456.bin' '-l' '-1' '-v' '-w' '/tmp/graph12416736091911923456.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:52:03] [INFO ] Decomposing Gal with order
[2022-05-15 15:52:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:52:03] [INFO ] Removed a total of 253 redundant transitions.
[2022-05-15 15:52:03] [INFO ] Flatten gal took : 64 ms
[2022-05-15 15:52:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2022-05-15 15:52:03] [INFO ] Time to serialize gal into /tmp/CTLFireability11075751858200874570.gal : 8 ms
[2022-05-15 15:52:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3154365373657389500.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/CTLFireability11075751858200874570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3154365373657389500.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,3.46536e+23,0.552697,27284,3524,47,43693,713,1055,78656,61,1683,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(AX((i15.i1.u24.p81==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(!(EX(!((i15.i1.u24.p81==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t155, t159, t167, t175, t255, t386, t387, t388, t390, t391, i0.t163, i0.u68.t...1158
(forward)formula 0,1,15.3263,388964,1,0,726473,754,6832,1.26352e+06,293,2075,1242366
FORMULA BusinessProcesses-PT-12-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 465 transition count 407
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 465 transition count 407
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 456 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 456 transition count 398
Applied a total of 76 rules in 43 ms. Remains 456 /494 variables (removed 38) and now considering 398/436 (removed 38) transitions.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:52:19] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:52:19] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:52:19] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 15:52:19] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:52:19] [INFO ] Computed 95 place invariants in 8 ms
[2022-05-15 15:52:20] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 456/494 places, 398/436 transitions.
Finished structural reductions, in 1 iterations. Remains : 456/494 places, 398/436 transitions.
[2022-05-15 15:52:20] [INFO ] Flatten gal took : 23 ms
[2022-05-15 15:52:20] [INFO ] Flatten gal took : 27 ms
[2022-05-15 15:52:20] [INFO ] Input system was already deterministic with 398 transitions.
[2022-05-15 15:52:20] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:52:20] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:52:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6437265996615968786.gal : 2 ms
[2022-05-15 15:52:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15873508050892817366.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/CTLFireability6437265996615968786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15873508050892817366.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.
Detected timeout of ITS tools.
[2022-05-15 15:52:50] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:52:50] [INFO ] Applying decomposition
[2022-05-15 15:52:50] [INFO ] Flatten gal took : 18 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/graph15636815947408540026.txt' '-o' '/tmp/graph15636815947408540026.bin' '-w' '/tmp/graph15636815947408540026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15636815947408540026.bin' '-l' '-1' '-v' '-w' '/tmp/graph15636815947408540026.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:52:50] [INFO ] Decomposing Gal with order
[2022-05-15 15:52:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:52:50] [INFO ] Removed a total of 252 redundant transitions.
[2022-05-15 15:52:50] [INFO ] Flatten gal took : 25 ms
[2022-05-15 15:52:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2022-05-15 15:52:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3281422511227396306.gal : 4 ms
[2022-05-15 15:52:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15915107866552878055.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/CTLFireability3281422511227396306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15915107866552878055.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,3.41126e+23,0.859653,36580,3784,65,58896,740,1084,126096,70,1907,0


Converting to forward existential form...Done !
original formula: E(EG(!(AX((i13.i1.u90.p267==1)))) U (i8.i0.u43.p132==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(!(EX(!((i13.i1.u90.p267==1))))))) * (i8.i0.u43.p132==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t155, t167, t175, t255, t263, t387, t388, t390, t391, i0.i0.u76.t158, i0.i0.u...1201
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 468 transition count 410
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 468 transition count 410
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 459 transition count 401
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 459 transition count 401
Applied a total of 70 rules in 30 ms. Remains 459 /494 variables (removed 35) and now considering 401/436 (removed 35) transitions.
// Phase 1: matrix 401 rows 459 cols
[2022-05-15 15:53:20] [INFO ] Computed 95 place invariants in 8 ms
[2022-05-15 15:53:20] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 401 rows 459 cols
[2022-05-15 15:53:20] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:53:21] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
// Phase 1: matrix 401 rows 459 cols
[2022-05-15 15:53:21] [INFO ] Computed 95 place invariants in 2 ms
[2022-05-15 15:53:21] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 459/494 places, 401/436 transitions.
Finished structural reductions, in 1 iterations. Remains : 459/494 places, 401/436 transitions.
[2022-05-15 15:53:21] [INFO ] Flatten gal took : 13 ms
[2022-05-15 15:53:21] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:53:21] [INFO ] Input system was already deterministic with 401 transitions.
[2022-05-15 15:53:21] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:53:21] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:53:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4149642844076519834.gal : 2 ms
[2022-05-15 15:53:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11402617426533312305.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/CTLFireability4149642844076519834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11402617426533312305.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.
Detected timeout of ITS tools.
[2022-05-15 15:53:51] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:53:51] [INFO ] Applying decomposition
[2022-05-15 15:53:51] [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/graph2001852066947707589.txt' '-o' '/tmp/graph2001852066947707589.bin' '-w' '/tmp/graph2001852066947707589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2001852066947707589.bin' '-l' '-1' '-v' '-w' '/tmp/graph2001852066947707589.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:53:51] [INFO ] Decomposing Gal with order
[2022-05-15 15:53:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:53:51] [INFO ] Removed a total of 253 redundant transitions.
[2022-05-15 15:53:51] [INFO ] Flatten gal took : 37 ms
[2022-05-15 15:53:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2022-05-15 15:53:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16356319275236266175.gal : 4 ms
[2022-05-15 15:53:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1259243600478723264.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/CTLFireability16356319275236266175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1259243600478723264.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,3.57941e+23,2.43011,78728,7827,55,116215,711,948,420677,63,1726,0


Converting to forward existential form...Done !
original formula: ((AF((EX((i11.u115.p372==1)) * (i7.i1.i1.u108.p345==1))) + EX(EF((i4.u130.p452==1)))) + (AF((EG((i6.u46.p141==0)) + ((AX((((i1.u58.p174==...305
=> equivalent forward existential formula: ([FwdG((Init * !((!(EG(!((EX((i11.u115.p372==1)) * (i7.i1.i1.u108.p345==1))))) + EX(E(TRUE U (i4.u130.p452==1)))...513
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t160, t172, t180, t258, t389, t391, t393, t394, i0.u68.t179, i1.u58.t195, i1....1100
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (trivial) has 244 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1080 edges and 489 vertex of which 488 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 487 transition count 361
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 420 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 419 transition count 360
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 138 place count 419 transition count 264
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 347 place count 306 transition count 264
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 375 place count 278 transition count 236
Iterating global reduction 3 with 28 rules applied. Total rules applied 403 place count 278 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 403 place count 278 transition count 234
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 407 place count 276 transition count 234
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 623 place count 166 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 625 place count 165 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 626 place count 164 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 627 place count 163 transition count 126
Applied a total of 627 rules in 57 ms. Remains 163 /494 variables (removed 331) and now considering 126/436 (removed 310) transitions.
// Phase 1: matrix 126 rows 163 cols
[2022-05-15 15:54:21] [INFO ] Computed 73 place invariants in 2 ms
[2022-05-15 15:54:21] [INFO ] Implicit Places using invariants in 91 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 39, 40, 41, 48, 49, 50, 51, 52, 53, 54, 130]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 106 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 144/494 places, 126/436 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/494 places, 126/436 transitions.
[2022-05-15 15:54:21] [INFO ] Flatten gal took : 4 ms
[2022-05-15 15:54:21] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:54:21] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 2115 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 624 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 77 steps, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Probabilistic random walk after 77 steps, saw 50 distinct states, run finished after 3 ms. (steps per millisecond=25 ) properties seen :1
FORMULA BusinessProcesses-PT-12-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 464 transition count 406
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 464 transition count 406
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 454 transition count 396
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 454 transition count 396
Applied a total of 80 rules in 23 ms. Remains 454 /494 variables (removed 40) and now considering 396/436 (removed 40) transitions.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:54:21] [INFO ] Computed 95 place invariants in 12 ms
[2022-05-15 15:54:22] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:54:22] [INFO ] Computed 95 place invariants in 6 ms
[2022-05-15 15:54:22] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
// Phase 1: matrix 396 rows 454 cols
[2022-05-15 15:54:22] [INFO ] Computed 95 place invariants in 10 ms
[2022-05-15 15:54:22] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 454/494 places, 396/436 transitions.
Finished structural reductions, in 1 iterations. Remains : 454/494 places, 396/436 transitions.
[2022-05-15 15:54:22] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:54:22] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:54:22] [INFO ] Input system was already deterministic with 396 transitions.
[2022-05-15 15:54:22] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:54:23] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:54:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9548125337725543226.gal : 2 ms
[2022-05-15 15:54:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1640213018111532151.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/CTLFireability9548125337725543226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1640213018111532151.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.
Detected timeout of ITS tools.
[2022-05-15 15:54:53] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:54:53] [INFO ] Applying decomposition
[2022-05-15 15:54:53] [INFO ] Flatten gal took : 10 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/graph6664726759040933791.txt' '-o' '/tmp/graph6664726759040933791.bin' '-w' '/tmp/graph6664726759040933791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6664726759040933791.bin' '-l' '-1' '-v' '-w' '/tmp/graph6664726759040933791.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:54:53] [INFO ] Decomposing Gal with order
[2022-05-15 15:54:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:54:53] [INFO ] Removed a total of 258 redundant transitions.
[2022-05-15 15:54:53] [INFO ] Flatten gal took : 23 ms
[2022-05-15 15:54:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2022-05-15 15:54:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17013530333799883224.gal : 4 ms
[2022-05-15 15:54:53] [INFO ] Time to serialize properties into /tmp/CTLFireability352208510808146164.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/CTLFireability17013530333799883224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability352208510808146164.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,3.40929e+23,0.617562,27820,4055,60,46927,521,1098,75839,62,1260,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(AX(FALSE))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t155, t167, t253, t384, t386, t388, t389, i0.i0.u77.t158, i0.i0.u81.t150, i0....1154
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,3.66251,142984,1,0,274676,521,6641,562282,249,1426,691589
FORMULA BusinessProcesses-PT-12-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (trivial) has 243 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1080 edges and 489 vertex of which 488 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 487 transition count 360
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 419 transition count 360
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 138 place count 419 transition count 264
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 347 place count 306 transition count 264
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 374 place count 279 transition count 237
Iterating global reduction 2 with 27 rules applied. Total rules applied 401 place count 279 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 401 place count 279 transition count 236
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 403 place count 278 transition count 236
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 621 place count 167 transition count 129
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 623 place count 166 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 624 place count 165 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 625 place count 164 transition count 127
Applied a total of 625 rules in 50 ms. Remains 164 /494 variables (removed 330) and now considering 127/436 (removed 309) transitions.
// Phase 1: matrix 127 rows 164 cols
[2022-05-15 15:54:56] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 15:54:57] [INFO ] Implicit Places using invariants in 100 ms returned [0, 1, 6, 7, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 101 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/494 places, 127/436 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/494 places, 127/436 transitions.
[2022-05-15 15:54:57] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:54:57] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:54:57] [INFO ] Input system was already deterministic with 127 transitions.
[2022-05-15 15:54:57] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:54:57] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:54:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12628289376511844598.gal : 1 ms
[2022-05-15 15:54:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17618814614041136413.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/CTLFireability12628289376511844598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17618814614041136413.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,13278,0.08196,7556,2,1732,5,9979,6,0,707,7847,0


Converting to forward existential form...Done !
original formula: EG(AG(AF(!(A((p51==1) U (p544==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!(!(!((E(!((p544==1)) U (!((p51==1)) * !((p544==1)))) + EG(!((p544==1)))))))))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t4, t26, t27, t28, t29, t30, t55, t56, t57, t58, t59, t100, t101, t102, t106, t107, t108, t12...258
Using saturation style SCC detection
(forward)formula 0,1,0.825545,39104,1,0,242,158995,255,134,5492,140521,339
FORMULA BusinessProcesses-PT-12-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (complete) has 1086 edges and 494 vertex of which 493 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 493 transition count 381
Reduce places removed 54 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 111 place count 439 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 437 transition count 379
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 113 place count 437 transition count 281
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 326 place count 322 transition count 281
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 351 place count 297 transition count 256
Iterating global reduction 3 with 25 rules applied. Total rules applied 376 place count 297 transition count 256
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 376 place count 297 transition count 254
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 380 place count 295 transition count 254
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 596 place count 185 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 597 place count 185 transition count 148
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 598 place count 185 transition count 147
Applied a total of 598 rules in 44 ms. Remains 185 /494 variables (removed 309) and now considering 147/436 (removed 289) transitions.
// Phase 1: matrix 147 rows 185 cols
[2022-05-15 15:54:57] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-15 15:54:58] [INFO ] Implicit Places using invariants in 104 ms returned [49, 50, 55, 56, 60, 61, 62, 63, 64, 65, 153]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 105 ms to find 11 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 174/494 places, 147/436 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 174/494 places, 147/436 transitions.
[2022-05-15 15:54:58] [INFO ] Flatten gal took : 6 ms
[2022-05-15 15:54:58] [INFO ] Flatten gal took : 6 ms
[2022-05-15 15:54:58] [INFO ] Input system was already deterministic with 147 transitions.
[2022-05-15 15:54:58] [INFO ] Flatten gal took : 6 ms
[2022-05-15 15:54:58] [INFO ] Flatten gal took : 6 ms
[2022-05-15 15:54:58] [INFO ] Time to serialize gal into /tmp/CTLFireability100048756219786368.gal : 1 ms
[2022-05-15 15:54:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8705363305636353854.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/CTLFireability100048756219786368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8705363305636353854.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...273
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,4.41032e+06,0.22849,14824,2,6057,5,37466,6,0,845,30651,0


Converting to forward existential form...Done !
original formula: EF((EG((((A(((p198==1)||(((p242==1)&&(p414==1))&&(p547==1))) U AF((p569==1))) + EG((p29==1))) + (A((p17==1) U (p332==1)) + (p377==1))) + ...263
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((!((E(!(!(EG(!((p569==1))))) U (!(((p198==1)||(((p242==1)&&(p414==1))&&(p547==1)))) * !...516
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t11, t14, t42, t43, t44, t45, t47, t75, t76, t77, t78, t79, t92, t105, t108, t109...287
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,13.3165,358644,1,0,732,1.96502e+06,310,382,6474,1.86222e+06,883
FORMULA BusinessProcesses-PT-12-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (trivial) has 239 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1080 edges and 489 vertex of which 488 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 487 transition count 362
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 421 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 420 transition count 361
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 136 place count 420 transition count 265
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 346 place count 306 transition count 265
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 371 place count 281 transition count 240
Iterating global reduction 3 with 25 rules applied. Total rules applied 396 place count 281 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 396 place count 281 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 398 place count 280 transition count 239
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 610 place count 172 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 612 place count 171 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 613 place count 170 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 614 place count 169 transition count 133
Applied a total of 614 rules in 58 ms. Remains 169 /494 variables (removed 325) and now considering 133/436 (removed 303) transitions.
// Phase 1: matrix 133 rows 169 cols
[2022-05-15 15:55:11] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-15 15:55:11] [INFO ] Implicit Places using invariants in 102 ms returned [0, 1, 5, 6, 32, 33, 34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 104 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 152/494 places, 133/436 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 152/494 places, 133/436 transitions.
[2022-05-15 15:55:11] [INFO ] Flatten gal took : 4 ms
[2022-05-15 15:55:11] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:11] [INFO ] Input system was already deterministic with 133 transitions.
[2022-05-15 15:55:11] [INFO ] Flatten gal took : 6 ms
[2022-05-15 15:55:11] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11980151886932703170.gal : 1 ms
[2022-05-15 15:55:11] [INFO ] Time to serialize properties into /tmp/CTLFireability852067510282953890.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/CTLFireability11980151886932703170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability852067510282953890.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,51852,0.089543,8116,2,1961,5,11859,6,0,741,10918,0


Converting to forward existential form...Done !
original formula: EF(!(E(AG((p520==1)) U ((EF((p484==1)) + !(((p119==1)&&(p302==1)))) + (((p108==1)&&(p309==1))&&(p567==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(E(TRUE U !((p520==1)))) U ((E(TRUE U (p484==1)) + !(((p119==1)&&(p302==1)))) + (((p108...197
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t8, t48, t49, t50, t51, t52, t53, t70, t71, t72, t73, t74, t102, t103, t104, t111, t1...277
(forward)formula 0,1,0.690399,32704,1,0,200,121404,258,105,5494,89782,271
FORMULA BusinessProcesses-PT-12-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (trivial) has 245 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1080 edges and 489 vertex of which 488 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 487 transition count 360
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 419 transition count 360
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 138 place count 419 transition count 263
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 350 place count 304 transition count 263
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 378 place count 276 transition count 235
Iterating global reduction 2 with 28 rules applied. Total rules applied 406 place count 276 transition count 235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 406 place count 276 transition count 233
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 410 place count 274 transition count 233
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 622 place count 166 transition count 129
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 624 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 625 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 626 place count 163 transition count 127
Applied a total of 626 rules in 41 ms. Remains 163 /494 variables (removed 331) and now considering 127/436 (removed 309) transitions.
// Phase 1: matrix 127 rows 163 cols
[2022-05-15 15:55:12] [INFO ] Computed 72 place invariants in 1 ms
[2022-05-15 15:55:12] [INFO ] Implicit Places using invariants in 97 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 98 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/494 places, 127/436 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/494 places, 127/436 transitions.
[2022-05-15 15:55:12] [INFO ] Flatten gal took : 4 ms
[2022-05-15 15:55:12] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:12] [INFO ] Input system was already deterministic with 127 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA BusinessProcesses-PT-12-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (trivial) has 245 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1080 edges and 489 vertex of which 488 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 487 transition count 360
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 419 transition count 360
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 138 place count 419 transition count 263
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 350 place count 304 transition count 263
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 378 place count 276 transition count 235
Iterating global reduction 2 with 28 rules applied. Total rules applied 406 place count 276 transition count 235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 406 place count 276 transition count 233
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 410 place count 274 transition count 233
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 622 place count 166 transition count 129
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 624 place count 165 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 625 place count 164 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 626 place count 163 transition count 127
Applied a total of 626 rules in 27 ms. Remains 163 /494 variables (removed 331) and now considering 127/436 (removed 309) transitions.
// Phase 1: matrix 127 rows 163 cols
[2022-05-15 15:55:12] [INFO ] Computed 72 place invariants in 2 ms
[2022-05-15 15:55:12] [INFO ] Implicit Places using invariants in 103 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 112 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/494 places, 127/436 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/494 places, 127/436 transitions.
[2022-05-15 15:55:12] [INFO ] Flatten gal took : 4 ms
[2022-05-15 15:55:12] [INFO ] Flatten gal took : 28 ms
[2022-05-15 15:55:12] [INFO ] Input system was already deterministic with 127 transitions.
[2022-05-15 15:55:12] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:12] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2807203773214677910.gal : 1 ms
[2022-05-15 15:55:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7867641752356286133.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/CTLFireability2807203773214677910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7867641752356286133.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,12849,0.090956,7804,2,2256,5,10917,6,0,707,7788,0


Converting to forward existential form...Done !
original formula: AG(EF((p246==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p246==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t24, t25, t26, t27, t52, t53, t54, t55, t56, t78, t79, t88, t89, t90, t102, t106, t107, ...267
(forward)formula 0,0,0.574384,32868,1,0,169,87166,238,88,5381,48899,230
FORMULA BusinessProcesses-PT-12-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (trivial) has 242 edges and 494 vertex of which 6 / 494 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1080 edges and 489 vertex of which 488 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 487 transition count 360
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 419 transition count 360
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 138 place count 419 transition count 266
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 343 place count 308 transition count 266
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 371 place count 280 transition count 238
Iterating global reduction 2 with 28 rules applied. Total rules applied 399 place count 280 transition count 238
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 399 place count 280 transition count 236
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 403 place count 278 transition count 236
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 619 place count 168 transition count 130
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 621 place count 167 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 622 place count 166 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 623 place count 165 transition count 128
Applied a total of 623 rules in 40 ms. Remains 165 /494 variables (removed 329) and now considering 128/436 (removed 308) transitions.
// Phase 1: matrix 128 rows 165 cols
[2022-05-15 15:55:13] [INFO ] Computed 73 place invariants in 1 ms
[2022-05-15 15:55:13] [INFO ] Implicit Places using invariants in 123 ms returned [0, 1, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 124 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/494 places, 128/436 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/494 places, 128/436 transitions.
[2022-05-15 15:55:13] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:13] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:13] [INFO ] Input system was already deterministic with 128 transitions.
[2022-05-15 15:55:13] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:13] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:13] [INFO ] Time to serialize gal into /tmp/CTLFireability280579159479178838.gal : 0 ms
[2022-05-15 15:55:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4832604147079159463.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/CTLFireability280579159479178838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4832604147079159463.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...273
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,25518,0.077178,7656,2,1777,5,10049,6,0,716,7882,0


Converting to forward existential form...Done !
original formula: AG(AF((((p223==1)&&(p404==1))&&(p539==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p223==1)&&(p404==1))&&(p539==1))))] = FALSE
Hit Full ! (commute/partial/dont) 123/0/5
(forward)formula 0,0,0.32175,19188,1,0,8,49433,20,3,4154,19960,8
FORMULA BusinessProcesses-PT-12-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Graph (complete) has 1086 edges and 494 vertex of which 493 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 492 transition count 379
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 115 place count 437 transition count 375
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 119 place count 433 transition count 375
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 119 place count 433 transition count 274
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 337 place count 316 transition count 274
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 364 place count 289 transition count 247
Iterating global reduction 3 with 27 rules applied. Total rules applied 391 place count 289 transition count 247
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 391 place count 289 transition count 245
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 395 place count 287 transition count 245
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 601 place count 182 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 602 place count 181 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 603 place count 180 transition count 143
Applied a total of 603 rules in 29 ms. Remains 180 /494 variables (removed 314) and now considering 143/436 (removed 293) transitions.
// Phase 1: matrix 143 rows 180 cols
[2022-05-15 15:55:13] [INFO ] Computed 74 place invariants in 2 ms
[2022-05-15 15:55:14] [INFO ] Implicit Places using invariants in 89 ms returned [52, 55, 56, 62, 63, 148, 151]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 90 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 173/494 places, 143/436 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 173/494 places, 143/436 transitions.
[2022-05-15 15:55:14] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:14] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:14] [INFO ] Input system was already deterministic with 143 transitions.
[2022-05-15 15:55:14] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:14] [INFO ] Flatten gal took : 5 ms
[2022-05-15 15:55:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9426564732989263066.gal : 1 ms
[2022-05-15 15:55:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11784186605289449150.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/CTLFireability9426564732989263066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11784186605289449150.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,404254,0.324882,19216,2,4755,5,51965,6,0,835,49287,0


Converting to forward existential form...Done !
original formula: !(A(AF(((p217==1) + !(EG((p213==1))))) U (E(((!(((p108==1)&&(p309==1))&&(p573==1)))&&(p34==1)) U (p585==1)) * E((p199!=1) U ((((p188==1)&...194
=> equivalent forward existential formula: (([((FwdU(Init,!((E(((!(((p108==1)&&(p309==1))&&(p573==1)))&&(p34==1)) U (p585==1)) * E((p199!=1) U ((((p188==1)...767
Reverse transition relation is NOT exact ! Due to transitions t4, t11, t14, t50, t51, t52, t53, t54, t55, t72, t73, t74, t75, t76, t88, t102, t103, t108, t...290
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.88171,234656,1,0,749,1.12309e+06,293,507,6285,1.23966e+06,976
FORMULA BusinessProcesses-PT-12-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 494/494 places, 436/436 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 465 transition count 407
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 465 transition count 407
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 456 transition count 398
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 456 transition count 398
Applied a total of 76 rules in 31 ms. Remains 456 /494 variables (removed 38) and now considering 398/436 (removed 38) transitions.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:55:21] [INFO ] Computed 95 place invariants in 7 ms
[2022-05-15 15:55:21] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:55:21] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:55:21] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 456 cols
[2022-05-15 15:55:21] [INFO ] Computed 95 place invariants in 3 ms
[2022-05-15 15:55:21] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 456/494 places, 398/436 transitions.
Finished structural reductions, in 1 iterations. Remains : 456/494 places, 398/436 transitions.
[2022-05-15 15:55:21] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:55:21] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:55:21] [INFO ] Input system was already deterministic with 398 transitions.
[2022-05-15 15:55:21] [INFO ] Flatten gal took : 12 ms
[2022-05-15 15:55:21] [INFO ] Flatten gal took : 10 ms
[2022-05-15 15:55:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1245239716631258380.gal : 1 ms
[2022-05-15 15:55:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8402164949729006361.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/CTLFireability1245239716631258380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8402164949729006361.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.
Detected timeout of ITS tools.
[2022-05-15 15:55:52] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:55:52] [INFO ] Applying decomposition
[2022-05-15 15:55:52] [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/graph10692056535517271186.txt' '-o' '/tmp/graph10692056535517271186.bin' '-w' '/tmp/graph10692056535517271186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10692056535517271186.bin' '-l' '-1' '-v' '-w' '/tmp/graph10692056535517271186.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:55:52] [INFO ] Decomposing Gal with order
[2022-05-15 15:55:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:55:52] [INFO ] Removed a total of 256 redundant transitions.
[2022-05-15 15:55:52] [INFO ] Flatten gal took : 20 ms
[2022-05-15 15:55:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2022-05-15 15:55:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14225748990259373647.gal : 3 ms
[2022-05-15 15:55:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6273218179975021662.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/CTLFireability14225748990259373647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6273218179975021662.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,3.41126e+23,0.91434,41436,3388,44,69257,622,1040,166591,56,1377,0


Converting to forward existential form...Done !
original formula: EG(EX((A(AX((i3.u55.p157==1)) U (i15.i1.u30.p92==1)) + EF((i12.i0.u45.p130==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX((!((E(!((i15.i1.u30.p92==1)) U (!(!(EX(!((i3.u55.p157==1))))) * !((i15.i1.u30.p92==1)))) + EG(!((i...222
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t159, t163, t255, t386, t387, t388, t390, t391, i0.t155, i0.i0.u124.t64, i0.i...1182
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2022-05-15 15:56:22] [INFO ] Flatten gal took : 14 ms
[2022-05-15 15:56:22] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:56:22] [INFO ] Applying decomposition
[2022-05-15 15:56:22] [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/graph4225405229118219788.txt' '-o' '/tmp/graph4225405229118219788.bin' '-w' '/tmp/graph4225405229118219788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4225405229118219788.bin' '-l' '-1' '-v' '-w' '/tmp/graph4225405229118219788.weights' '-q' '0' '-e' '0.001'
[2022-05-15 15:56:22] [INFO ] Decomposing Gal with order
[2022-05-15 15:56:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 15:56:22] [INFO ] Removed a total of 256 redundant transitions.
[2022-05-15 15:56:22] [INFO ] Flatten gal took : 30 ms
[2022-05-15 15:56:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 15:56:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1854642855074736482.gal : 4 ms
[2022-05-15 15:56:22] [INFO ] Time to serialize properties into /tmp/CTLFireability18301718254053487918.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/CTLFireability1854642855074736482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18301718254053487918.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.97229e+23,3.9715,120312,7141,71,194078,899,1021,656116,61,2791,0


Converting to forward existential form...Done !
original formula: E(EG(!(AX((i10.u93.p267==1)))) U (i8.u44.p132==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(!(EX(!((i10.u93.p267==1))))))) * (i8.u44.p132==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t189, t197, t292, t301, t426, t428, i0.t209, i0.u65.t216, i0.u67.t212, i1.u12.t30...1408
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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
(forward)formula 0,1,976.795,3014720,1,0,5.10812e+06,899,2395,1.4239e+07,124,2791,930350
FORMULA BusinessProcesses-PT-12-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-15 16:18:07] [INFO ] Applying decomposition
[2022-05-15 16:18:07] [INFO ] Flatten gal took : 12 ms
[2022-05-15 16:18:07] [INFO ] Decomposing Gal with order
[2022-05-15 16:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:18:07] [INFO ] Removed a total of 128 redundant transitions.
[2022-05-15 16:18:07] [INFO ] Flatten gal took : 24 ms
[2022-05-15 16:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 69 ms.
[2022-05-15 16:18:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10881226726332522096.gal : 9 ms
[2022-05-15 16:18:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2492729630543182522.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/CTLFireability10881226726332522096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2492729630543182522.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 2 CTL formulae.
Detected timeout of ITS tools.
[2022-05-15 16:40:25] [INFO ] Flatten gal took : 148 ms
[2022-05-15 16:40:25] [INFO ] Input system was already deterministic with 436 transitions.
[2022-05-15 16:40:25] [INFO ] Transformed 494 places.
[2022-05-15 16:40:25] [INFO ] Transformed 436 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 16:40:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13855067727457001588.gal : 7 ms
[2022-05-15 16:40:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9254755029626753969.ctl : 4 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/CTLFireability13855067727457001588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9254755029626753969.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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...320
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-12"
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-12, 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-165251918500410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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