fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143800370
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16242.031 3600000.00 3499307.00 142987.50 ?T?T?T????????FT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K May 5 16:51 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-07-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620762178902

Running Version 0
[2021-05-11 19:43:01] [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]
[2021-05-11 19:43:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:43:01] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2021-05-11 19:43:01] [INFO ] Transformed 386 places.
[2021-05-11 19:43:01] [INFO ] Transformed 360 transitions.
[2021-05-11 19:43:01] [INFO ] Found NUPN structural information;
[2021-05-11 19:43:01] [INFO ] Parsed PT model containing 386 places and 360 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
[2021-05-11 19:43:01] [INFO ] Reduced 1 identical enabling conditions.
Support contains 339 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 383 transition count 358
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 383 transition count 358
Applied a total of 5 rules in 55 ms. Remains 383 /386 variables (removed 3) and now considering 358/360 (removed 2) transitions.
// Phase 1: matrix 358 rows 383 cols
[2021-05-11 19:43:01] [INFO ] Computed 61 place invariants in 43 ms
[2021-05-11 19:43:01] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 358 rows 383 cols
[2021-05-11 19:43:01] [INFO ] Computed 61 place invariants in 8 ms
[2021-05-11 19:43:02] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
// Phase 1: matrix 358 rows 383 cols
[2021-05-11 19:43:02] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-11 19:43:02] [INFO ] Dead Transitions using invariants and state equation in 263 ms returned []
Finished structural reductions, in 1 iterations. Remains : 383/386 places, 358/360 transitions.
[2021-05-11 19:43:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-11 19:43:02] [INFO ] Flatten gal took : 63 ms
FORMULA BusinessProcesses-PT-07-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 19:43:02] [INFO ] Flatten gal took : 31 ms
[2021-05-11 19:43:03] [INFO ] Input system was already deterministic with 358 transitions.
Incomplete random walk after 100000 steps, including 1083 resets, run finished after 257 ms. (steps per millisecond=389 ) properties (out of 72) seen :69
Running SMT prover for 3 properties.
// Phase 1: matrix 358 rows 383 cols
[2021-05-11 19:43:03] [INFO ] Computed 61 place invariants in 8 ms
[2021-05-11 19:43:03] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-11 19:43:03] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-11 19:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:03] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-11 19:43:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2021-05-11 19:43:03] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-11 19:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:03] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 394 ms
[2021-05-11 19:43:04] [INFO ] Computed and/alt/rep : 337/625/337 causal constraints (skipped 20 transitions) in 29 ms.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2021-05-11 19:43:05] [INFO ] Added : 205 causal constraints over 41 iterations in 1098 ms. Result :sat
[2021-05-11 19:43:05] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned sat
[2021-05-11 19:43:05] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-11 19:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:05] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2227 ms
[2021-05-11 19:43:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2021-05-11 19:43:07] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:07] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 110 places in 82 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3111 ms
[2021-05-11 19:43:11] [INFO ] Computed and/alt/rep : 337/625/337 causal constraints (skipped 20 transitions) in 16 ms.
[2021-05-11 19:43:11] [INFO ] Added : 201 causal constraints over 41 iterations in 797 ms. Result :sat
[2021-05-11 19:43:11] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-11 19:43:11] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-11 19:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:11] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 107 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1560 ms
[2021-05-11 19:43:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:13] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2021-05-11 19:43:13] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:13] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 0 ms to minimize.
[2021-05-11 19:43:15] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 109 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 108 places in 69 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 102 places in 73 ms of which 1 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 105 places in 72 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 103 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 101 places in 62 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 97 places in 69 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 109 places in 70 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 100 places in 79 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 111 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:43:22] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2021-05-11 19:43:23] [INFO ] Trap strengthening (SAT) tested/added 95/94 trap constraints in 10038 ms
[2021-05-11 19:43:23] [INFO ] Computed and/alt/rep : 337/625/337 causal constraints (skipped 20 transitions) in 25 ms.
[2021-05-11 19:43:24] [INFO ] Added : 215 causal constraints over 43 iterations in 955 ms. Result :sat
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 382 transition count 333
Reduce places removed 24 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 33 rules applied. Total rules applied 57 place count 358 transition count 324
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 349 transition count 324
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 66 place count 349 transition count 238
Deduced a syphon composed of 86 places in 10 ms
Ensure Unique test removed 5 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 243 place count 258 transition count 238
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 284 place count 217 transition count 197
Iterating global reduction 3 with 41 rules applied. Total rules applied 325 place count 217 transition count 197
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 325 place count 217 transition count 194
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 332 place count 213 transition count 194
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 408 place count 175 transition count 156
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 409 place count 175 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 175 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 411 place count 174 transition count 154
Applied a total of 411 rules in 139 ms. Remains 174 /383 variables (removed 209) and now considering 154/358 (removed 204) transitions.
[2021-05-11 19:43:24] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:43:24] [INFO ] Flatten gal took : 26 ms
[2021-05-11 19:43:25] [INFO ] Input system was already deterministic with 154 transitions.
[2021-05-11 19:43:25] [INFO ] Flatten gal took : 24 ms
[2021-05-11 19:43:25] [INFO ] Flatten gal took : 23 ms
[2021-05-11 19:43:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6829802243613474436.gal : 12 ms
[2021-05-11 19:43:25] [INFO ] Time to serialize properties into /tmp/CTLFireability138194947588482693.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6829802243613474436.gal, -t, CGAL, -ctl, /tmp/CTLFireability138194947588482693.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6829802243613474436.gal -t CGAL -ctl /tmp/CTLFireability138194947588482693.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.57686e+09,5.78397,156888,2,35650,5,715309,6,0,850,680585,0


Converting to forward existential form...Done !
original formula: EG(A((((EF(((p6==1)||(p346==1))) * EF((((((((((p116==1)&&(p252==1))&&(p383==1))||(p183==1))||(p199==1))||(p317==1))||(p138==1))||(((p71==1)&&(p256==1))&&(p351==1)))||(((p116==1)&&(p252==1))&&(p322==1))))) * EG(((((p133==1)||(p259==1))||(((p39==1)&&(p221==1))&&(p351==1)))||(p299==1)))) + (((((((((p311==0)&&(p57==0))&&(p254==0))&&(p175==0))&&(p14==0))&&((((((p67==1)||(p129==1))||(p317==1))||(((p155==1)&&(p186==1))&&(p351==1)))||(((p85==1)&&(p247==1))&&(p380==1)))||((p66==1)&&(p275==1))))&&(((p116==0)||(p252==0))||(p383==0)))&&(((p26==0)||(p192==0))||(p289==0)))&&((p89==0)||(p323==0)))) U EF((((((((p19==1)||(p151==1))||(p55==1))||(((p85==1)&&(p247==1))&&(p362==1)))||(((p134==1)&&(p202==1))&&(p335==1)))||(((p43==1)&&(p212==1))&&(p352==1)))||((p89==1)&&(p323==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (((((((p19==1)||(p151==1))||(p55==1))||(((p85==1)&&(p247==1))&&(p362==1)))||(((p134==1)&&(p202==1))&&(p335==1)))||(((p43==1)&&(p212==1))&&(p352==1)))||((p89==1)&&(p323==1))))) U (!((((E(TRUE U ((p6==1)||(p346==1))) * E(TRUE U (((((((((p116==1)&&(p252==1))&&(p383==1))||(p183==1))||(p199==1))||(p317==1))||(p138==1))||(((p71==1)&&(p256==1))&&(p351==1)))||(((p116==1)&&(p252==1))&&(p322==1))))) * EG(((((p133==1)||(p259==1))||(((p39==1)&&(p221==1))&&(p351==1)))||(p299==1)))) + (((((((((p311==0)&&(p57==0))&&(p254==0))&&(p175==0))&&(p14==0))&&((((((p67==1)||(p129==1))||(p317==1))||(((p155==1)&&(p186==1))&&(p351==1)))||(((p85==1)&&(p247==1))&&(p380==1)))||((p66==1)&&(p275==1))))&&(((p116==0)||(p252==0))||(p383==0)))&&(((p26==0)||(p192==0))||(p289==0)))&&((p89==0)||(p323==0))))) * !(E(TRUE U (((((((p19==1)||(p151==1))||(p55==1))||(((p85==1)&&(p247==1))&&(p362==1)))||(((p134==1)&&(p202==1))&&(p335==1)))||(((p43==1)&&(p212==1))&&(p352==1)))||((p89==1)&&(p323==1))))))) + EG(!(E(TRUE U (((((((p19==1)||(p151==1))||(p55==1))||(((p85==1)&&(p247==1))&&(p362==1)))||(((p134==1)&&(p202==1))&&(p335==1)))||(((p43==1)&&(p212==1))&&(p352==1)))||((p89==1)&&(p323==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t13, t14, t17, t20, t22, t26, t28, t33, t72, t73, t80, t82, t84, t85, t86, t87, t88, t92, t94, t95, t96, t97, t98, t100, t110, t111, t112, t113, t114, t131, t132, t135, t136, t140, t143, t145, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/79/39/154
Detected timeout of ITS tools.
[2021-05-11 19:43:55] [INFO ] Flatten gal took : 25 ms
[2021-05-11 19:43:55] [INFO ] Applying decomposition
[2021-05-11 19:43:55] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9518875848120345801.txt, -o, /tmp/graph9518875848120345801.bin, -w, /tmp/graph9518875848120345801.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9518875848120345801.bin, -l, -1, -v, -w, /tmp/graph9518875848120345801.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:43:55] [INFO ] Decomposing Gal with order
[2021-05-11 19:43:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:43:55] [INFO ] Removed a total of 67 redundant transitions.
[2021-05-11 19:43:55] [INFO ] Flatten gal took : 95 ms
[2021-05-11 19:43:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 18 ms.
[2021-05-11 19:43:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14697505388515176287.gal : 9 ms
[2021-05-11 19:43:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4028896020935870929.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14697505388515176287.gal, -t, CGAL, -ctl, /tmp/CTLFireability4028896020935870929.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14697505388515176287.gal -t CGAL -ctl /tmp/CTLFireability4028896020935870929.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.57686e+09,0.526303,20608,1161,617,31122,3499,598,49322,197,11410,0


Converting to forward existential form...Done !
original formula: EG(A((((EF(((i5.u15.p6==1)||(i10.u35.p346==1))) * EF((((((((((i9.u32.p116==1)&&(i9.u32.p252==1))&&(i9.u32.p383==1))||(i1.u19.p183==1))||(i4.u22.p199==1))||(i10.u35.p317==1))||(i7.u14.p138==1))||(((i3.u8.p71==1)&&(i6.i0.u33.p256==1))&&(i10.u35.p351==1)))||(((i9.u32.p116==1)&&(i9.u32.p252==1))&&(i9.u32.p322==1))))) * EG(((((i4.u12.p133==1)||(i6.i1.u34.p259==1))||(((i2.i0.u4.p39==1)&&(i11.i1.u26.p221==1))&&(i10.u35.p351==1)))||(i10.u35.p299==1)))) + (((((((((i3.u28.p311==0)&&(i11.i0.u6.p57==0))&&(i6.i0.u33.p254==0))&&(i0.i0.u23.p175==0))&&(i0.i0.u1.p14==0))&&((((((i11.i0.u7.p67==1)||(i1.u11.p129==1))||(i10.u35.p317==1))||(((i5.u17.p155==1)&&(i0.i1.u20.p186==1))&&(i10.u35.p351==1)))||(((u31.p85==1)&&(u31.p247==1))&&(u31.p380==1)))||((i11.i0.u7.p66==1)&&(i10.u36.p275==1))))&&(((i9.u32.p116==0)||(i9.u32.p252==0))||(i9.u32.p383==0)))&&(((i0.i0.u3.p26==0)||(i0.i0.u21.p192==0))||(i0.i0.u37.p289==0)))&&((i9.u9.p89==0)||(i9.u40.p323==0)))) U EF((((((((i0.i1.u2.p19==1)||(i6.i0.u16.p151==1))||(i11.i0.u6.p55==1))||(((u31.p85==1)&&(u31.p247==1))&&(u31.p362==1)))||(((i4.u13.p134==1)&&(i4.u22.p202==1))&&(i4.u42.p335==1)))||(((i2.i0.u5.p43==1)&&(i2.i1.u24.p212==1))&&(i2.i0.u38.p352==1)))||((i9.u9.p89==1)&&(i9.u40.p323==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (((((((i0.i1.u2.p19==1)||(i6.i0.u16.p151==1))||(i11.i0.u6.p55==1))||(((u31.p85==1)&&(u31.p247==1))&&(u31.p362==1)))||(((i4.u13.p134==1)&&(i4.u22.p202==1))&&(i4.u42.p335==1)))||(((i2.i0.u5.p43==1)&&(i2.i1.u24.p212==1))&&(i2.i0.u38.p352==1)))||((i9.u9.p89==1)&&(i9.u40.p323==1))))) U (!((((E(TRUE U ((i5.u15.p6==1)||(i10.u35.p346==1))) * E(TRUE U (((((((((i9.u32.p116==1)&&(i9.u32.p252==1))&&(i9.u32.p383==1))||(i1.u19.p183==1))||(i4.u22.p199==1))||(i10.u35.p317==1))||(i7.u14.p138==1))||(((i3.u8.p71==1)&&(i6.i0.u33.p256==1))&&(i10.u35.p351==1)))||(((i9.u32.p116==1)&&(i9.u32.p252==1))&&(i9.u32.p322==1))))) * EG(((((i4.u12.p133==1)||(i6.i1.u34.p259==1))||(((i2.i0.u4.p39==1)&&(i11.i1.u26.p221==1))&&(i10.u35.p351==1)))||(i10.u35.p299==1)))) + (((((((((i3.u28.p311==0)&&(i11.i0.u6.p57==0))&&(i6.i0.u33.p254==0))&&(i0.i0.u23.p175==0))&&(i0.i0.u1.p14==0))&&((((((i11.i0.u7.p67==1)||(i1.u11.p129==1))||(i10.u35.p317==1))||(((i5.u17.p155==1)&&(i0.i1.u20.p186==1))&&(i10.u35.p351==1)))||(((u31.p85==1)&&(u31.p247==1))&&(u31.p380==1)))||((i11.i0.u7.p66==1)&&(i10.u36.p275==1))))&&(((i9.u32.p116==0)||(i9.u32.p252==0))||(i9.u32.p383==0)))&&(((i0.i0.u3.p26==0)||(i0.i0.u21.p192==0))||(i0.i0.u37.p289==0)))&&((i9.u9.p89==0)||(i9.u40.p323==0))))) * !(E(TRUE U (((((((i0.i1.u2.p19==1)||(i6.i0.u16.p151==1))||(i11.i0.u6.p55==1))||(((u31.p85==1)&&(u31.p247==1))&&(u31.p362==1)))||(((i4.u13.p134==1)&&(i4.u22.p202==1))&&(i4.u42.p335==1)))||(((i2.i0.u5.p43==1)&&(i2.i1.u24.p212==1))&&(i2.i0.u38.p352==1)))||((i9.u9.p89==1)&&(i9.u40.p323==1))))))) + EG(!(E(TRUE U (((((((i0.i1.u2.p19==1)||(i6.i0.u16.p151==1))||(i11.i0.u6.p55==1))||(((u31.p85==1)&&(u31.p247==1))&&(u31.p362==1)))||(((i4.u13.p134==1)&&(i4.u22.p202==1))&&(i4.u42.p335==1)))||(((i2.i0.u5.p43==1)&&(i2.i1.u24.p212==1))&&(i2.i0.u38.p352==1)))||((i9.u9.p89==1)&&(i9.u40.p323==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t26, t33, t72, t73, t80, t95, t96, t97, t98, t111, t112, t113, t114, t131, t132, t135, t140, t143, t145, i0.t136, i0.i0.u23.t13, i0.i1.u2.t28, i1.u19.t17, i2.i0.u4.t92, i3.u8.t94, i4.u12.t85, i4.u22.t14, i5.u17.t100, i6.i0.u16.t86, i6.i0.u33.t87, i6.i1.u34.t88, i7.u14.t20, i10.u35.t1, i10.u35.t5, i10.u35.t9, i10.u35.t110, i11.i0.u6.t82, i11.i0.u6.t84, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/78/39/142
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 382 transition count 301
Reduce places removed 56 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 326 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 324 transition count 299
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 116 place count 324 transition count 219
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 285 place count 235 transition count 219
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 330 place count 190 transition count 174
Iterating global reduction 3 with 45 rules applied. Total rules applied 375 place count 190 transition count 174
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 375 place count 190 transition count 168
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 388 place count 183 transition count 168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 502 place count 125 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 503 place count 125 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 505 place count 124 transition count 114
Applied a total of 505 rules in 37 ms. Remains 124 /383 variables (removed 259) and now considering 114/358 (removed 244) transitions.
[2021-05-11 19:44:25] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:44:25] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:44:25] [INFO ] Input system was already deterministic with 114 transitions.
[2021-05-11 19:44:25] [INFO ] Flatten gal took : 7 ms
[2021-05-11 19:44:25] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:44:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8266186293468931068.gal : 1 ms
[2021-05-11 19:44:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6085658594577436447.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8266186293468931068.gal, -t, CGAL, -ctl, /tmp/CTLFireability6085658594577436447.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8266186293468931068.gal -t CGAL -ctl /tmp/CTLFireability6085658594577436447.ctl --gen-order FOLLOW
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,7.2603e+06,0.846614,32172,2,8187,5,126127,6,0,610,115087,0


Converting to forward existential form...Done !
original formula: (AF((p97==1)) + EF(((((p180==1)||(p345==1))||(p173==1))||(((p23==1)&&(p196==1))&&(p351==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U ((((p180==1)||(p345==1))||(p173==1))||(((p23==1)&&(p196==1))&&(p351==1)))))),!((p97==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t19, t20, t21, t22, t23, t24, t27, t28, t29, t30, t31, t32, t69, t71, t74, t78, t80, t84, t86, t90, t92, t104, t105, t106, t107, t112, t113, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/48/30/114
(forward)formula 0,1,5.77524,144088,1,0,204,823982,223,85,5027,584403,238
FORMULA BusinessProcesses-PT-07-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 210 edges and 383 vertex of which 7 / 383 are part of one of the 1 SCC in 27 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 376 transition count 273
Reduce places removed 77 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 79 rules applied. Total rules applied 157 place count 299 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 159 place count 297 transition count 271
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 159 place count 297 transition count 214
Deduced a syphon composed of 57 places in 5 ms
Ensure Unique test removed 9 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 282 place count 231 transition count 214
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 327 place count 186 transition count 169
Iterating global reduction 3 with 45 rules applied. Total rules applied 372 place count 186 transition count 169
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 372 place count 186 transition count 163
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 385 place count 179 transition count 163
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 497 place count 123 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 501 place count 121 transition count 109
Applied a total of 501 rules in 135 ms. Remains 121 /383 variables (removed 262) and now considering 109/358 (removed 249) transitions.
[2021-05-11 19:44:31] [INFO ] Flatten gal took : 7 ms
[2021-05-11 19:44:31] [INFO ] Flatten gal took : 30 ms
[2021-05-11 19:44:31] [INFO ] Input system was already deterministic with 109 transitions.
Finished random walk after 154 steps, including 38 resets, run visited all 1 properties in 25 ms. (steps per millisecond=6 )
FORMULA BusinessProcesses-PT-07-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 382 transition count 315
Reduce places removed 42 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 47 rules applied. Total rules applied 89 place count 340 transition count 310
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 94 place count 335 transition count 310
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 94 place count 335 transition count 238
Deduced a syphon composed of 72 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 243 place count 258 transition count 238
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 283 place count 218 transition count 198
Iterating global reduction 3 with 40 rules applied. Total rules applied 323 place count 218 transition count 198
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 323 place count 218 transition count 196
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 327 place count 216 transition count 196
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 421 place count 169 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 423 place count 168 transition count 152
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 424 place count 168 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 425 place count 167 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 426 place count 166 transition count 151
Applied a total of 426 rules in 121 ms. Remains 166 /383 variables (removed 217) and now considering 151/358 (removed 207) transitions.
[2021-05-11 19:44:31] [INFO ] Flatten gal took : 17 ms
[2021-05-11 19:44:31] [INFO ] Flatten gal took : 28 ms
[2021-05-11 19:44:31] [INFO ] Input system was already deterministic with 151 transitions.
[2021-05-11 19:44:31] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:44:32] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:44:32] [INFO ] Time to serialize gal into /tmp/CTLFireability656376238028100576.gal : 2 ms
[2021-05-11 19:44:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16829748128633032231.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability656376238028100576.gal, -t, CGAL, -ctl, /tmp/CTLFireability16829748128633032231.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability656376238028100576.gal -t CGAL -ctl /tmp/CTLFireability16829748128633032231.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.44026e+08,1.98256,66912,2,14817,5,246423,6,0,815,272728,0


Converting to forward existential form...Done !
original formula: EF((EF(((((((((((p82==1)&&(p232==1))&&(p374==1))||(((p146==1)&&(p242==1))&&(p343==1)))||(p18==1))||((p89==1)&&(p323==1)))||(p345==1))||(((p88==1)&&(p252==1))&&(p383==1)))||(p205==1))||(p330==1))) * (AG(EF(((((((((p311==0)&&(p214==0))&&(((p122==0)||(p207==0))||(p327==0)))&&(((p32==0)||(p197==0))||(p268==0)))&&(((p16==0)||(p191==0))||(p351==0)))&&(p361==0))&&(p313==0))&&(p281==0)))) + ((((((((p309==0)&&(p277==0))&&(p224==0))&&(p103==0))&&(p171==0))&&(p318==0))&&(p12==0))&&(((((p276==1)||(p73==1))||(p41==1))||(p14==1))||(((p140==1)&&(p237==1))&&(p339==1)))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * E(TRUE U ((((((((((p82==1)&&(p232==1))&&(p374==1))||(((p146==1)&&(p242==1))&&(p343==1)))||(p18==1))||((p89==1)&&(p323==1)))||(p345==1))||(((p88==1)&&(p252==1))&&(p383==1)))||(p205==1))||(p330==1)))) * !(E(TRUE U !(E(TRUE U ((((((((p311==0)&&(p214==0))&&(((p122==0)||(p207==0))||(p327==0)))&&(((p32==0)||(p197==0))||(p268==0)))&&(((p16==0)||(p191==0))||(p351==0)))&&(p361==0))&&(p313==0))&&(p281==0)))))))] != FALSE + [((FwdU(Init,TRUE) * E(TRUE U ((((((((((p82==1)&&(p232==1))&&(p374==1))||(((p146==1)&&(p242==1))&&(p343==1)))||(p18==1))||((p89==1)&&(p323==1)))||(p345==1))||(((p88==1)&&(p252==1))&&(p383==1)))||(p205==1))||(p330==1)))) * ((((((((p309==0)&&(p277==0))&&(p224==0))&&(p103==0))&&(p171==0))&&(p318==0))&&(p12==0))&&(((((p276==1)||(p73==1))||(p41==1))||(p14==1))||(((p140==1)&&(p237==1))&&(p339==1)))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t8, t19, t20, t23, t24, t27, t66, t67, t68, t70, t71, t73, t74, t75, t76, t77, t81, t83, t89, t90, t91, t92, t93, t106, t107, t112, t113, t125, t127, t132, t135, t136, t137, t140, t141, t142, t143, t144, t145, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/74/41/151
(forward)formula 0,1,21.7355,475944,1,0,310,3.10968e+06,288,137,5884,1.83574e+06,355
FORMULA BusinessProcesses-PT-07-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-11 19:44:54] [INFO ] Flatten gal took : 61 ms
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 73 ms
[2021-05-11 19:44:54] [INFO ] Applying decomposition
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1355167200634737761.txt, -o, /tmp/graph1355167200634737761.bin, -w, /tmp/graph1355167200634737761.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1355167200634737761.bin, -l, -1, -v, -w, /tmp/graph1355167200634737761.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:44:54] [INFO ] Decomposing Gal with order
[2021-05-11 19:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:44:54] [INFO ] Removed a total of 229 redundant transitions.
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 90 ms
[2021-05-11 19:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 19 ms.
[2021-05-11 19:44:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3798463001240771423.gal : 11 ms
[2021-05-11 19:44:54] [INFO ] Time to serialize properties into /tmp/CTLFireability3998855342973636378.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3798463001240771423.gal, -t, CGAL, -ctl, /tmp/CTLFireability3998855342973636378.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3798463001240771423.gal -t CGAL -ctl /tmp/CTLFireability3998855342973636378.ctl
No direction supplied, using forward translation only.
Parsed 11 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,8.06672e+17,9.29341,191120,6037,89,271908,860,1005,680655,85,2962,0


Converting to forward existential form...Done !
original formula: EG(A((((EF(((i1.u2.p6==1)||(i15.u133.p346==1))) * EF((((((((((i14.u44.p116==1)&&(i14.u97.p252==1))&&(i14.u148.p383==1))||(i2.u69.p183==1))||(i8.u78.p199==1))||(i13.i0.i2.u121.p317==1))||(i1.u53.p138==1))||(((i13.i0.i1.u29.p71==1)&&(i7.u99.p256==1))&&(i15.u113.p351==1)))||(((i14.u44.p116==1)&&(i14.u97.p252==1))&&(i14.u122.p322==1))))) * EG(((((i1.u51.p133==1)||(i7.u102.p259==1))||(((i4.u15.p39==1)&&(i8.u85.p221==1))&&(i15.u113.p351==1)))||(i2.u107.p299==1)))) + (((((((((i14.u119.p311==0)&&(i5.u21.p57==0))&&(i7.u100.p254==0))&&(i8.u67.p175==0))&&(i3.u5.p14==0))&&((((((i5.u26.p67==1)||(i2.u50.p129==1))||(i13.i0.i2.u121.p317==1))||(((i0.u59.p155==1)&&(i9.u72.p186==1))&&(i15.u113.p351==1)))||(((i13.i0.i2.u33.p85==1)&&(i13.i0.i2.u96.p247==1))&&(i14.u148.p380==1)))||((i5.u26.p66==1)&&(i15.u106.p275==1))))&&(((i14.u44.p116==0)||(i14.u97.p252==0))||(i14.u148.p383==0)))&&(((i3.u10.p26==0)||(i9.u73.p192==0))||(i3.u112.p289==0)))&&((i14.u35.p89==0)||(i14.u123.p323==0)))) U EF((((((((i3.u7.p19==1)||(i0.u57.p151==1))||(i5.u28.p55==1))||(((i13.i0.i2.u33.p85==1)&&(i13.i0.i2.u96.p247==1))&&(i13.i1.i1.u138.p362==1)))||(((i1.u52.p134==1)&&(i8.u77.p202==1))&&(i1.u128.p335==1)))||(((i4.u16.p43==1)&&(i4.u82.p212==1))&&(i4.u115.p352==1)))||((i14.u35.p89==1)&&(i14.u123.p323==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (((((((i3.u7.p19==1)||(i0.u57.p151==1))||(i5.u28.p55==1))||(((i13.i0.i2.u33.p85==1)&&(i13.i0.i2.u96.p247==1))&&(i13.i1.i1.u138.p362==1)))||(((i1.u52.p134==1)&&(i8.u77.p202==1))&&(i1.u128.p335==1)))||(((i4.u16.p43==1)&&(i4.u82.p212==1))&&(i4.u115.p352==1)))||((i14.u35.p89==1)&&(i14.u123.p323==1))))) U (!((((E(TRUE U ((i1.u2.p6==1)||(i15.u133.p346==1))) * E(TRUE U (((((((((i14.u44.p116==1)&&(i14.u97.p252==1))&&(i14.u148.p383==1))||(i2.u69.p183==1))||(i8.u78.p199==1))||(i13.i0.i2.u121.p317==1))||(i1.u53.p138==1))||(((i13.i0.i1.u29.p71==1)&&(i7.u99.p256==1))&&(i15.u113.p351==1)))||(((i14.u44.p116==1)&&(i14.u97.p252==1))&&(i14.u122.p322==1))))) * EG(((((i1.u51.p133==1)||(i7.u102.p259==1))||(((i4.u15.p39==1)&&(i8.u85.p221==1))&&(i15.u113.p351==1)))||(i2.u107.p299==1)))) + (((((((((i14.u119.p311==0)&&(i5.u21.p57==0))&&(i7.u100.p254==0))&&(i8.u67.p175==0))&&(i3.u5.p14==0))&&((((((i5.u26.p67==1)||(i2.u50.p129==1))||(i13.i0.i2.u121.p317==1))||(((i0.u59.p155==1)&&(i9.u72.p186==1))&&(i15.u113.p351==1)))||(((i13.i0.i2.u33.p85==1)&&(i13.i0.i2.u96.p247==1))&&(i14.u148.p380==1)))||((i5.u26.p66==1)&&(i15.u106.p275==1))))&&(((i14.u44.p116==0)||(i14.u97.p252==0))||(i14.u148.p383==0)))&&(((i3.u10.p26==0)||(i9.u73.p192==0))||(i3.u112.p289==0)))&&((i14.u35.p89==0)||(i14.u123.p323==0))))) * !(E(TRUE U (((((((i3.u7.p19==1)||(i0.u57.p151==1))||(i5.u28.p55==1))||(((i13.i0.i2.u33.p85==1)&&(i13.i0.i2.u96.p247==1))&&(i13.i1.i1.u138.p362==1)))||(((i1.u52.p134==1)&&(i8.u77.p202==1))&&(i1.u128.p335==1)))||(((i4.u16.p43==1)&&(i4.u82.p212==1))&&(i4.u115.p352==1)))||((i14.u35.p89==1)&&(i14.u123.p323==1))))))) + EG(!(E(TRUE U (((((((i3.u7.p19==1)||(i0.u57.p151==1))||(i5.u28.p55==1))||(((i13.i0.i2.u33.p85==1)&&(i13.i0.i2.u96.p247==1))&&(i13.i1.i1.u138.p362==1)))||(((i1.u52.p134==1)&&(i8.u77.p202==1))&&(i1.u128.p335==1)))||(((i4.u16.p43==1)&&(i4.u82.p212==1))&&(i4.u115.p352==1)))||((i14.u35.p89==1)&&(i14.u123.p323==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t34, t38, t82, t194, t197, t236, t240, t246, i0.t170, i0.u55.t177, i0.u57.t173, i0.u59.t169, i1.u51.t185, i1.u53.t181, i2.t163, i2.u107.t28, i2.u107.t62, i2.u107.t81, i2.u70.t164, i3.t260, i3.t252, i3.u8.t256, i3.u7.t258, i3.u9.t255, i4.t140, i4.u15.t245, i4.u82.t141, i5.t235, i5.t231, i5.t229, i5.t227, i5.t224, i5.t222, i5.t128, i5.u19.t239, i5.u88.t129, i6.t76, i6.u108.t80, i7.t120, i7.t104, i7.t100, i7.u61.t166, i7.u92.t121, i7.u99.t105, i7.u101.t101, i8.t148, i8.t144, i8.t136, i8.t132, i8.u77.t149, i8.u80.t145, i8.u84.t137, i8.u85.t133, i9.t160, i9.t156, i9.t152, i9.u72.t161, i9.u73.t157, i9.u76.t153, i10.t251, i11.u47.t193, i11.u49.t189, i12.t116, i12.u93.t117, i13.t201, i13.i0.t199, i13.i0.i1.u29.t205, i13.i0.i1.u29.t209, i13.i0.i1.u29.t213, i13.i0.i1.u29.t219, i13.i0.i2.t112, i13.i0.i2.u96.t113, i13.i1.i0.t124, i13.i1.i0.u89.t125, i14.t108, i14.u97.t109, i15.t94, i15.t87, i15.t78, i15.t74, i15.t69, i15.t60, i15.t58, i15.t31, i15.t26, i15.t23, i15.t20, i15.t17, i15.t14, i15.u113.t12, i15.u113.t42, i15.u113.t46, i15.u113.t50, i15.u113.t56, i15.u113.t67, i15.u113.t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/225/96/357
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found 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
Detected timeout of ITS tools.
[2021-05-11 20:05:31] [INFO ] Applying decomposition
[2021-05-11 20:05:31] [INFO ] Flatten gal took : 13 ms
[2021-05-11 20:05:31] [INFO ] Decomposing Gal with order
[2021-05-11 20:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:05:31] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-11 20:05:31] [INFO ] Flatten gal took : 70 ms
[2021-05-11 20:05:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-11 20:05:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3335897950027283121.gal : 6 ms
[2021-05-11 20:05:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16617893472769786425.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3335897950027283121.gal, -t, CGAL, -ctl, /tmp/CTLFireability16617893472769786425.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3335897950027283121.gal -t CGAL -ctl /tmp/CTLFireability16617893472769786425.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:26:11] [INFO ] Flatten gal took : 210 ms
[2021-05-11 20:26:12] [INFO ] Input system was already deterministic with 358 transitions.
[2021-05-11 20:26:12] [INFO ] Transformed 383 places.
[2021-05-11 20:26:12] [INFO ] Transformed 358 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 20:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4500412711360111338.gal : 9 ms
[2021-05-11 20:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4672145491016251077.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4500412711360111338.gal, -t, CGAL, -ctl, /tmp/CTLFireability4672145491016251077.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4500412711360111338.gal -t CGAL -ctl /tmp/CTLFireability4672145491016251077.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-07"
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-07, 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 r026-tajo-162038143800370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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