About the Execution of ITS-Tools for BusinessProcesses-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.600 | 3600000.00 | 2992052.00 | 470952.20 | ?T??TT??FF?FF?TT | normal |
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-165251918600466.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-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600466
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 5.8K Apr 30 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 189K 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-19-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1652638482699
Running Version 202205111006
[2022-05-15 18:14:43] [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 18:14:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:14:44] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2022-05-15 18:14:44] [INFO ] Transformed 772 places.
[2022-05-15 18:14:44] [INFO ] Transformed 685 transitions.
[2022-05-15 18:14:44] [INFO ] Found NUPN structural information;
[2022-05-15 18:14:44] [INFO ] Parsed PT model containing 772 places and 685 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
Support contains 106 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 96 place count 661 transition count 582
Iterating global reduction 1 with 88 rules applied. Total rules applied 184 place count 661 transition count 582
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 227 place count 618 transition count 539
Iterating global reduction 1 with 43 rules applied. Total rules applied 270 place count 618 transition count 539
Applied a total of 270 rules in 157 ms. Remains 618 /757 variables (removed 139) and now considering 539/670 (removed 131) transitions.
// Phase 1: matrix 539 rows 618 cols
[2022-05-15 18:14:44] [INFO ] Computed 117 place invariants in 37 ms
[2022-05-15 18:14:44] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 539 rows 618 cols
[2022-05-15 18:14:44] [INFO ] Computed 117 place invariants in 17 ms
[2022-05-15 18:14:45] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
// Phase 1: matrix 539 rows 618 cols
[2022-05-15 18:14:45] [INFO ] Computed 117 place invariants in 20 ms
[2022-05-15 18:14:45] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 618/757 places, 539/670 transitions.
Finished structural reductions, in 1 iterations. Remains : 618/757 places, 539/670 transitions.
Support contains 106 out of 618 places after structural reductions.
[2022-05-15 18:14:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-15 18:14:45] [INFO ] Flatten gal took : 76 ms
FORMULA BusinessProcesses-PT-19-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 18:14:45] [INFO ] Flatten gal took : 35 ms
[2022-05-15 18:14:46] [INFO ] Input system was already deterministic with 539 transitions.
Support contains 100 out of 618 places (down from 106) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 61) seen :17
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 44) 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 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Running SMT prover for 44 properties.
// Phase 1: matrix 539 rows 618 cols
[2022-05-15 18:14:47] [INFO ] Computed 117 place invariants in 12 ms
[2022-05-15 18:14:47] [INFO ] [Real]Absence check using 70 positive place invariants in 24 ms returned sat
[2022-05-15 18:14:47] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 16 ms returned sat
[2022-05-15 18:14:47] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2022-05-15 18:14:48] [INFO ] [Nat]Absence check using 70 positive place invariants in 25 ms returned sat
[2022-05-15 18:14:48] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 16 ms returned sat
[2022-05-15 18:14:50] [INFO ] After 1270ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :37
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 4 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 1 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:14:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 914 ms
[2022-05-15 18:14:51] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 0 ms to minimize.
[2022-05-15 18:14:51] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2022-05-15 18:14:51] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-15 18:14:51] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2022-05-15 18:14:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 423 ms
[2022-05-15 18:14:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2022-05-15 18:14:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 0 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 0 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 680 ms
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 1 ms to minimize.
[2022-05-15 18:14:52] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 0 ms to minimize.
[2022-05-15 18:14:53] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 2 ms to minimize.
[2022-05-15 18:14:53] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 1 ms to minimize.
[2022-05-15 18:14:53] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 0 ms to minimize.
[2022-05-15 18:14:53] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 0 ms to minimize.
[2022-05-15 18:14:53] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:14:53] [INFO ] Deduced a trap composed of 148 places in 120 ms of which 1 ms to minimize.
[2022-05-15 18:14:53] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 0 ms to minimize.
[2022-05-15 18:14:54] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 1 ms to minimize.
[2022-05-15 18:14:54] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 0 ms to minimize.
[2022-05-15 18:14:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1599 ms
[2022-05-15 18:14:54] [INFO ] Deduced a trap composed of 115 places in 106 ms of which 1 ms to minimize.
[2022-05-15 18:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-15 18:14:54] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 0 ms to minimize.
[2022-05-15 18:14:54] [INFO ] Deduced a trap composed of 123 places in 102 ms of which 1 ms to minimize.
[2022-05-15 18:14:55] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 0 ms to minimize.
[2022-05-15 18:14:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 433 ms
[2022-05-15 18:14:55] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 0 ms to minimize.
[2022-05-15 18:14:55] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 0 ms to minimize.
[2022-05-15 18:14:56] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 1 ms to minimize.
[2022-05-15 18:14:56] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 0 ms to minimize.
[2022-05-15 18:14:56] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 1 ms to minimize.
[2022-05-15 18:14:56] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 0 ms to minimize.
[2022-05-15 18:14:56] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 0 ms to minimize.
[2022-05-15 18:14:56] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2022-05-15 18:14:56] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 0 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 0 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1673 ms
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 0 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 0 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2022-05-15 18:14:57] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 0 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1262 ms
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 0 ms to minimize.
[2022-05-15 18:14:58] [INFO ] Deduced a trap composed of 117 places in 103 ms of which 1 ms to minimize.
[2022-05-15 18:14:59] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 1 ms to minimize.
[2022-05-15 18:14:59] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 1 ms to minimize.
[2022-05-15 18:14:59] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 2 ms to minimize.
[2022-05-15 18:14:59] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 4 ms to minimize.
[2022-05-15 18:14:59] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 1 ms to minimize.
[2022-05-15 18:14:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 977 ms
[2022-05-15 18:14:59] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 0 ms to minimize.
[2022-05-15 18:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-15 18:14:59] [INFO ] After 11021ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :37
Attempting to minimize the solution found.
Minimization took 1231 ms.
[2022-05-15 18:15:01] [INFO ] After 13242ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :37
Fused 44 Parikh solutions to 37 different solutions.
Parikh walk visited 7 properties in 527 ms.
Support contains 48 out of 618 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 618/618 places, 539/539 transitions.
Graph (complete) has 1350 edges and 618 vertex of which 617 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 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 65 place count 617 transition count 474
Reduce places removed 64 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 71 rules applied. Total rules applied 136 place count 553 transition count 467
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 143 place count 546 transition count 467
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 143 place count 546 transition count 364
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 366 place count 426 transition count 364
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 376 place count 416 transition count 354
Iterating global reduction 3 with 10 rules applied. Total rules applied 386 place count 416 transition count 354
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 386 place count 416 transition count 352
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 390 place count 414 transition count 352
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Deduced a syphon composed of 149 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 301 rules applied. Total rules applied 691 place count 262 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 692 place count 262 transition count 202
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 262 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 694 place count 261 transition count 201
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 704 place count 261 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 705 place count 260 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 706 place count 259 transition count 200
Applied a total of 706 rules in 116 ms. Remains 259 /618 variables (removed 359) and now considering 200/539 (removed 339) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/618 places, 200/539 transitions.
Incomplete random walk after 10000 steps, including 652 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 200 rows 259 cols
[2022-05-15 18:15:02] [INFO ] Computed 96 place invariants in 2 ms
[2022-05-15 18:15:02] [INFO ] [Real]Absence check using 69 positive place invariants in 10 ms returned sat
[2022-05-15 18:15:02] [INFO ] [Real]Absence check using 69 positive and 27 generalized place invariants in 10 ms returned sat
[2022-05-15 18:15:02] [INFO ] After 320ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:18
[2022-05-15 18:15:02] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 0 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2022-05-15 18:15:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 787 ms
[2022-05-15 18:15:03] [INFO ] After 1229ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-15 18:15:03] [INFO ] After 1503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-15 18:15:03] [INFO ] [Nat]Absence check using 69 positive place invariants in 11 ms returned sat
[2022-05-15 18:15:03] [INFO ] [Nat]Absence check using 69 positive and 27 generalized place invariants in 9 ms returned sat
[2022-05-15 18:15:04] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-15 18:15:04] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2022-05-15 18:15:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-15 18:15:04] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:15:04] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 0 ms to minimize.
[2022-05-15 18:15:04] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:15:04] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 0 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 0 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 631 ms
[2022-05-15 18:15:05] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-15 18:15:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-15 18:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-15 18:15:05] [INFO ] After 1615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 258 ms.
[2022-05-15 18:15:05] [INFO ] After 2139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 125 ms.
Support contains 36 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 200/200 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 259 transition count 191
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 247 transition count 191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 246 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 246 transition count 190
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 243 transition count 187
Applied a total of 29 rules in 33 ms. Remains 243 /259 variables (removed 16) and now considering 187/200 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 243/259 places, 187/200 transitions.
Incomplete random walk after 10000 steps, including 816 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 338574 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 11=1, 13=1, 14=1, 15=1, 16=1, 17=1, 21=1}
Probabilistic random walk after 338574 steps, saw 91865 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :15
Running SMT prover for 9 properties.
// Phase 1: matrix 187 rows 243 cols
[2022-05-15 18:15:09] [INFO ] Computed 93 place invariants in 2 ms
[2022-05-15 18:15:09] [INFO ] [Real]Absence check using 68 positive place invariants in 9 ms returned sat
[2022-05-15 18:15:09] [INFO ] [Real]Absence check using 68 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-15 18:15:09] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2022-05-15 18:15:10] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 0 ms to minimize.
[2022-05-15 18:15:10] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 0 ms to minimize.
[2022-05-15 18:15:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2022-05-15 18:15:10] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2022-05-15 18:15:10] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2022-05-15 18:15:10] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 0 ms to minimize.
[2022-05-15 18:15:10] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2022-05-15 18:15:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 260 ms
[2022-05-15 18:15:10] [INFO ] After 702ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6 real:3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-15 18:15:10] [INFO ] After 868ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6 real:3
[2022-05-15 18:15:10] [INFO ] [Nat]Absence check using 68 positive place invariants in 10 ms returned sat
[2022-05-15 18:15:10] [INFO ] [Nat]Absence check using 68 positive and 25 generalized place invariants in 6 ms returned sat
[2022-05-15 18:15:10] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-15 18:15:10] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 0 ms to minimize.
[2022-05-15 18:15:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-15 18:15:11] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-15 18:15:11] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 11 out of 243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 243/243 places, 187/187 transitions.
Graph (trivial) has 26 edges and 243 vertex of which 2 / 243 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 242 transition count 182
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 239 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 238 transition count 181
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 9 place count 238 transition count 169
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 37 place count 222 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 220 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 220 transition count 167
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 59 place count 211 transition count 158
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 211 transition count 155
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 66 place count 207 transition count 155
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 207 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 206 transition count 154
Applied a total of 68 rules in 39 ms. Remains 206 /243 variables (removed 37) and now considering 154/187 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/243 places, 154/187 transitions.
Incomplete random walk after 10000 steps, including 313 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :8
Finished Best-First random walk after 4695 steps, including 43 resets, run visited all 1 properties in 9 ms. (steps per millisecond=521 )
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-19-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 18:15:11] [INFO ] Flatten gal took : 29 ms
[2022-05-15 18:15:11] [INFO ] Flatten gal took : 27 ms
[2022-05-15 18:15:11] [INFO ] Input system was already deterministic with 539 transitions.
Computed a total of 559 stabilizing places and 490 stable transitions
Graph (complete) has 1350 edges and 618 vertex of which 617 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 595 transition count 516
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 595 transition count 516
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 584 transition count 505
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 583 transition count 504
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 583 transition count 504
Applied a total of 70 rules in 47 ms. Remains 583 /618 variables (removed 35) and now considering 504/539 (removed 35) transitions.
// Phase 1: matrix 504 rows 583 cols
[2022-05-15 18:15:11] [INFO ] Computed 117 place invariants in 5 ms
[2022-05-15 18:15:11] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 504 rows 583 cols
[2022-05-15 18:15:11] [INFO ] Computed 117 place invariants in 5 ms
[2022-05-15 18:15:12] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
// Phase 1: matrix 504 rows 583 cols
[2022-05-15 18:15:12] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 18:15:12] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 583/618 places, 504/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 583/618 places, 504/539 transitions.
[2022-05-15 18:15:12] [INFO ] Flatten gal took : 24 ms
[2022-05-15 18:15:12] [INFO ] Flatten gal took : 25 ms
[2022-05-15 18:15:13] [INFO ] Input system was already deterministic with 504 transitions.
[2022-05-15 18:15:13] [INFO ] Flatten gal took : 26 ms
[2022-05-15 18:15:13] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:15:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12476526062466738449.gal : 31 ms
[2022-05-15 18:15:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11984869716445735749.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/CTLFireability12476526062466738449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11984869716445735749.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.
Detected timeout of ITS tools.
[2022-05-15 18:15:43] [INFO ] Flatten gal took : 29 ms
[2022-05-15 18:15:43] [INFO ] Applying decomposition
[2022-05-15 18:15:43] [INFO ] Flatten gal took : 20 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/graph16379132426263434985.txt' '-o' '/tmp/graph16379132426263434985.bin' '-w' '/tmp/graph16379132426263434985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16379132426263434985.bin' '-l' '-1' '-v' '-w' '/tmp/graph16379132426263434985.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:15:43] [INFO ] Decomposing Gal with order
[2022-05-15 18:15:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:15:43] [INFO ] Removed a total of 288 redundant transitions.
[2022-05-15 18:15:43] [INFO ] Flatten gal took : 68 ms
[2022-05-15 18:15:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 17 ms.
[2022-05-15 18:15:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6680118100181396845.gal : 9 ms
[2022-05-15 18:15:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13841891360321152748.ctl : 19 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/CTLFireability6680118100181396845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13841891360321152748.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31291e+33,1.37766,53956,4371,56,98738,668,1248,198949,59,1810,0
Converting to forward existential form...Done !
original formula: EG((E(EF((i15.i1.u154.p535==1)) U ((AX((i19.u188.p715!=1)) * (i6.i1.u39.p114==1)) * (AF((i14.i0.u60.p185==1)) * A((i7.i0.u12.p28==1) U (i...260
=> equivalent forward existential formula: [FwdG(Init,(E(E(TRUE U (i15.i1.u154.p535==1)) U ((!(EX(!((i19.u188.p715!=1)))) * (i6.i1.u39.p114==1)) * (!(EG(!(...489
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t202, t288, t305, t313, t391, t394, t467, t472, t474, t476, t479, t481, t490...1626
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 595 transition count 516
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 595 transition count 516
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 582 transition count 503
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 581 transition count 502
Applied a total of 74 rules in 50 ms. Remains 581 /618 variables (removed 37) and now considering 502/539 (removed 37) transitions.
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:16:13] [INFO ] Computed 117 place invariants in 9 ms
[2022-05-15 18:16:14] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:16:14] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:16:14] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:16:14] [INFO ] Computed 117 place invariants in 5 ms
[2022-05-15 18:16:14] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/618 places, 502/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/618 places, 502/539 transitions.
[2022-05-15 18:16:15] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:16:15] [INFO ] Flatten gal took : 16 ms
[2022-05-15 18:16:15] [INFO ] Input system was already deterministic with 502 transitions.
[2022-05-15 18:16:15] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:16:15] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:16:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16814015866173962178.gal : 3 ms
[2022-05-15 18:16:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12678132469489417718.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/CTLFireability16814015866173962178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12678132469489417718.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.
Detected timeout of ITS tools.
[2022-05-15 18:16:45] [INFO ] Flatten gal took : 16 ms
[2022-05-15 18:16:45] [INFO ] Applying decomposition
[2022-05-15 18:16:45] [INFO ] Flatten gal took : 16 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/graph4525960047289138552.txt' '-o' '/tmp/graph4525960047289138552.bin' '-w' '/tmp/graph4525960047289138552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4525960047289138552.bin' '-l' '-1' '-v' '-w' '/tmp/graph4525960047289138552.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:16:45] [INFO ] Decomposing Gal with order
[2022-05-15 18:16:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:16:45] [INFO ] Removed a total of 291 redundant transitions.
[2022-05-15 18:16:45] [INFO ] Flatten gal took : 32 ms
[2022-05-15 18:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2022-05-15 18:16:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2352741655154376962.gal : 7 ms
[2022-05-15 18:16:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17437293957287188477.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/CTLFireability2352741655154376962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17437293957287188477.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,0.786577,34552,4377,53,62123,656,1328,106121,68,1486,0
Converting to forward existential form...Done !
original formula: (EF((i19.u161.p563==1)) + AX((AF(((EF((((i14.u22.p50==1)&&(i14.u126.p392==1))&&(i19.u161.p737==1))) * (i1.i1.u156.p535==1)) * ((i6.i3.u13...220
=> equivalent forward existential formula: ([FwdG(EY((Init * !(E(TRUE U (i19.u161.p563==1))))),!(((E(TRUE U (((i14.u22.p50==1)&&(i14.u126.p392==1))&&(i19.u...348
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t203, t287, t307, t389, t392, t465, t466, t470, t472, t475, t477, t479, t488...1596
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,8.35716,282828,1,0,568048,656,9185,1.00782e+06,355,1486,1479633
FORMULA BusinessProcesses-PT-19-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 593 transition count 514
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 593 transition count 514
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 581 transition count 502
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 580 transition count 501
Applied a total of 76 rules in 64 ms. Remains 580 /618 variables (removed 38) and now considering 501/539 (removed 38) transitions.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:53] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 18:16:54] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:54] [INFO ] Computed 117 place invariants in 14 ms
[2022-05-15 18:16:54] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:16:54] [INFO ] Computed 117 place invariants in 8 ms
[2022-05-15 18:16:54] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/618 places, 501/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/618 places, 501/539 transitions.
[2022-05-15 18:16:54] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:16:54] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:16:54] [INFO ] Input system was already deterministic with 501 transitions.
[2022-05-15 18:16:55] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:16:55] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:16:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5665641999069423858.gal : 2 ms
[2022-05-15 18:16:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5343888919775335652.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/CTLFireability5665641999069423858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5343888919775335652.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 18:17:25] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:17:25] [INFO ] Applying decomposition
[2022-05-15 18:17:25] [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/graph3131733343645952620.txt' '-o' '/tmp/graph3131733343645952620.bin' '-w' '/tmp/graph3131733343645952620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3131733343645952620.bin' '-l' '-1' '-v' '-w' '/tmp/graph3131733343645952620.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:17:25] [INFO ] Decomposing Gal with order
[2022-05-15 18:17:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:17:25] [INFO ] Removed a total of 285 redundant transitions.
[2022-05-15 18:17:25] [INFO ] Flatten gal took : 65 ms
[2022-05-15 18:17:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2022-05-15 18:17:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1413031646043878175.gal : 4 ms
[2022-05-15 18:17:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15513438749004161703.ctl : 290 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/CTLFireability1413031646043878175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15513438749004161703.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,1.13742,44240,5477,60,83713,992,1275,119680,75,2114,0
Converting to forward existential form...Done !
original formula: ((EG(EF((((i11.i0.u39.p108==1)&&(i15.i1.u135.p448==1))&&(i11.i0.u168.p624==1)))) * EF((((i12.u48.p141==1)&&(i6.i1.u141.p477==1))&&(i0.i2....282
=> equivalent forward existential formula: ([((Init * !((EG(E(TRUE U (((i11.i0.u39.p108==1)&&(i15.i1.u135.p448==1))&&(i11.i0.u168.p624==1)))) * E(TRUE U ((...551
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t202, t286, t298, t306, t310, t314, t388, t391, t464, t465, t469, t471, t473...1580
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 593 transition count 514
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 593 transition count 514
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 581 transition count 502
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 580 transition count 501
Applied a total of 76 rules in 44 ms. Remains 580 /618 variables (removed 38) and now considering 501/539 (removed 38) transitions.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:17:55] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 18:17:55] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:17:55] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:17:56] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:17:56] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:17:56] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/618 places, 501/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/618 places, 501/539 transitions.
[2022-05-15 18:17:56] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:17:56] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:17:56] [INFO ] Input system was already deterministic with 501 transitions.
[2022-05-15 18:17:56] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:17:56] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:17:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17121908509316887900.gal : 2 ms
[2022-05-15 18:17:56] [INFO ] Time to serialize properties into /tmp/CTLFireability996441297586470955.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/CTLFireability17121908509316887900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability996441297586470955.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 18:18:27] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:18:27] [INFO ] Applying decomposition
[2022-05-15 18:18:27] [INFO ] Flatten gal took : 19 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/graph12527204004821173089.txt' '-o' '/tmp/graph12527204004821173089.bin' '-w' '/tmp/graph12527204004821173089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12527204004821173089.bin' '-l' '-1' '-v' '-w' '/tmp/graph12527204004821173089.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:18:27] [INFO ] Decomposing Gal with order
[2022-05-15 18:18:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:18:27] [INFO ] Removed a total of 286 redundant transitions.
[2022-05-15 18:18:27] [INFO ] Flatten gal took : 27 ms
[2022-05-15 18:18:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2022-05-15 18:18:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13041681744089143538.gal : 5 ms
[2022-05-15 18:18:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12070077995560663392.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/CTLFireability13041681744089143538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12070077995560663392.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,11.7486,308772,24119,64,435818,1151,1290,1.1517e+06,70,2502,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Graph (trivial) has 299 edges and 618 vertex of which 6 / 618 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1344 edges and 613 vertex of which 612 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 611 transition count 449
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 529 transition count 449
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 166 place count 529 transition count 328
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 431 place count 385 transition count 328
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 454 place count 362 transition count 305
Iterating global reduction 2 with 23 rules applied. Total rules applied 477 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 477 place count 362 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 481 place count 360 transition count 303
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 299 rules applied. Total rules applied 780 place count 208 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 781 place count 207 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 782 place count 206 transition count 155
Applied a total of 782 rules in 63 ms. Remains 206 /618 variables (removed 412) and now considering 155/539 (removed 384) transitions.
// Phase 1: matrix 155 rows 206 cols
[2022-05-15 18:18:57] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-15 18:18:57] [INFO ] Implicit Places using invariants in 130 ms returned [0, 1, 2, 3, 4, 12, 15, 18, 19, 20, 21, 25, 26, 27, 28, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 136 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 179/618 places, 155/539 transitions.
Applied a total of 0 rules in 10 ms. Remains 179 /179 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 179/618 places, 155/539 transitions.
[2022-05-15 18:18:57] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:18:57] [INFO ] Flatten gal took : 7 ms
[2022-05-15 18:18:57] [INFO ] Input system was already deterministic with 155 transitions.
[2022-05-15 18:18:57] [INFO ] Flatten gal took : 7 ms
[2022-05-15 18:18:57] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:18:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15938852207267285810.gal : 1 ms
[2022-05-15 18:18:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4060416302778579213.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/CTLFireability15938852207267285810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4060416302778579213.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,6.13296e+06,0.343368,20592,2,3732,5,45092,6,0,868,44656,0
Converting to forward existential form...Done !
original formula: AF(((AG(EF(AG((((p95==0)||(p438==0))||(p614==0))))) + (((p100==1)&&(p443==1))&&(p618==1))) + (EG((p577==1)) * EG((p691==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(E(TRUE U !(E(TRUE U !((((p95==0)||(p438==0))||(p614==0))))))))) + (((p100==1)&&(p443...219
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t38, t40, t41, t42, t43, t69, t70, t71, t72, t73, t99, t100, t120, t121, t122, t123, ...291
(forward)formula 0,1,3.62523,126728,1,0,255,747174,308,136,6380,426632,353
FORMULA BusinessProcesses-PT-19-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Graph (trivial) has 309 edges and 618 vertex of which 6 / 618 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 1344 edges and 613 vertex of which 612 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 611 transition count 445
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 174 place count 525 transition count 445
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 174 place count 525 transition count 321
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 447 place count 376 transition count 321
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 473 place count 350 transition count 295
Iterating global reduction 2 with 26 rules applied. Total rules applied 499 place count 350 transition count 295
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 499 place count 350 transition count 293
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 503 place count 348 transition count 293
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 798 place count 198 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 799 place count 197 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 800 place count 196 transition count 147
Applied a total of 800 rules in 52 ms. Remains 196 /618 variables (removed 422) and now considering 147/539 (removed 392) transitions.
// Phase 1: matrix 147 rows 196 cols
[2022-05-15 18:19:01] [INFO ] Computed 86 place invariants in 1 ms
[2022-05-15 18:19:01] [INFO ] Implicit Places using invariants in 122 ms returned [17, 18, 19, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 123 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 177/618 places, 147/539 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 177/618 places, 147/539 transitions.
[2022-05-15 18:19:01] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:19:01] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:19:01] [INFO ] Input system was already deterministic with 147 transitions.
[2022-05-15 18:19:01] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:19:01] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:19:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10951959412401803877.gal : 1 ms
[2022-05-15 18:19:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8910529029255864081.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/CTLFireability10951959412401803877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8910529029255864081.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39512e+06,0.383209,21936,2,5862,5,58761,6,0,852,49088,0
Converting to forward existential form...Done !
original formula: EG(EF((p29==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p29==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t33, t34, t35, t36, t37, t61, t62, t63, t64, t65, t78, t90, t91, t112, t113, t114, t115, ...291
(forward)formula 0,1,2.52926,92096,1,0,298,351899,284,209,6207,220254,378
FORMULA BusinessProcesses-PT-19-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 594 transition count 515
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 594 transition count 515
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 582 transition count 503
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 581 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 581 transition count 502
Applied a total of 74 rules in 54 ms. Remains 581 /618 variables (removed 37) and now considering 502/539 (removed 37) transitions.
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:19:04] [INFO ] Computed 117 place invariants in 6 ms
[2022-05-15 18:19:04] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:19:04] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:19:04] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
// Phase 1: matrix 502 rows 581 cols
[2022-05-15 18:19:04] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:19:05] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 581/618 places, 502/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/618 places, 502/539 transitions.
[2022-05-15 18:19:05] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:19:05] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:19:05] [INFO ] Input system was already deterministic with 502 transitions.
[2022-05-15 18:19:05] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:19:05] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability18103326473604372136.gal : 2 ms
[2022-05-15 18:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14918798559141496599.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/CTLFireability18103326473604372136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14918798559141496599.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.
Detected timeout of ITS tools.
[2022-05-15 18:19:35] [INFO ] Flatten gal took : 27 ms
[2022-05-15 18:19:35] [INFO ] Applying decomposition
[2022-05-15 18:19:35] [INFO ] Flatten gal took : 13 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/graph878357322241080488.txt' '-o' '/tmp/graph878357322241080488.bin' '-w' '/tmp/graph878357322241080488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph878357322241080488.bin' '-l' '-1' '-v' '-w' '/tmp/graph878357322241080488.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:19:35] [INFO ] Decomposing Gal with order
[2022-05-15 18:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:19:35] [INFO ] Removed a total of 288 redundant transitions.
[2022-05-15 18:19:35] [INFO ] Flatten gal took : 50 ms
[2022-05-15 18:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2022-05-15 18:19:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7605926541411454198.gal : 4 ms
[2022-05-15 18:19:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16934386343874410267.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/CTLFireability7605926541411454198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16934386343874410267.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29241e+33,2.31013,73992,6137,70,108713,817,1270,371530,74,1843,0
Converting to forward existential form...Done !
original formula: A((i19.u183.p691==1) U ((!(EF((i18.i3.u154.p551==1))) * !(((i4.i1.u27.p75==1)&&(i4.i1.u28.p78==1)))) + (AF(AX((((i14.i0.u78.p241==1)&&(i1...255
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U (i18.i3.u154.p551==1))) * !(((i4.i1.u27.p75==1)&&(i4.i1.u28.p78==1)))) + (!(EG(!(!...848
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t203, t307, t315, t344, t389, t392, t465, t466, t470, t472, t474, t475, t477...1607
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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 593 transition count 514
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 593 transition count 514
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 580 transition count 501
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 579 transition count 500
Applied a total of 78 rules in 43 ms. Remains 579 /618 variables (removed 39) and now considering 500/539 (removed 39) transitions.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:20:05] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:20:05] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:20:05] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:20:06] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:20:06] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:20:06] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/618 places, 500/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 579/618 places, 500/539 transitions.
[2022-05-15 18:20:06] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:20:06] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:20:06] [INFO ] Input system was already deterministic with 500 transitions.
[2022-05-15 18:20:06] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:20:06] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15113901483437068031.gal : 2 ms
[2022-05-15 18:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability1418935043942950985.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/CTLFireability15113901483437068031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1418935043942950985.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 18:20:36] [INFO ] Flatten gal took : 18 ms
[2022-05-15 18:20:36] [INFO ] Applying decomposition
[2022-05-15 18:20:36] [INFO ] Flatten gal took : 13 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/graph1806729631749173437.txt' '-o' '/tmp/graph1806729631749173437.bin' '-w' '/tmp/graph1806729631749173437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1806729631749173437.bin' '-l' '-1' '-v' '-w' '/tmp/graph1806729631749173437.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:20:36] [INFO ] Decomposing Gal with order
[2022-05-15 18:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:20:36] [INFO ] Removed a total of 289 redundant transitions.
[2022-05-15 18:20:36] [INFO ] Flatten gal took : 37 ms
[2022-05-15 18:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2022-05-15 18:20:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16873457679088548367.gal : 5 ms
[2022-05-15 18:20:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6487276963378358146.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/CTLFireability16873457679088548367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6487276963378358146.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2659e+33,0.836552,34188,3612,56,58852,660,1251,104973,64,1677,0
Converting to forward existential form...Done !
original formula: E((EG((i8.i0.u27.p70==1)) + (i17.i3.u148.p499==1)) U (AG(EF((i17.i1.u63.p190==1))) + EX(E((i14.i0.u54.p157==1) U AX((((i9.i1.u58.p167==1)...207
=> equivalent forward existential formula: ([(FwdU(Init,(EG((i8.i0.u27.p70==1)) + (i17.i3.u148.p499==1))) * !(E(TRUE U !(E(TRUE U (i17.i1.u63.p190==1))))))...353
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t201, t285, t301, t313, t387, t390, t463, t464, t468, t470, t472, t475, t477...1588
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 596 transition count 517
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 596 transition count 517
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 587 transition count 508
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 587 transition count 508
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 586 transition count 507
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 586 transition count 507
Applied a total of 64 rules in 47 ms. Remains 586 /618 variables (removed 32) and now considering 507/539 (removed 32) transitions.
// Phase 1: matrix 507 rows 586 cols
[2022-05-15 18:21:07] [INFO ] Computed 117 place invariants in 5 ms
[2022-05-15 18:21:07] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 507 rows 586 cols
[2022-05-15 18:21:07] [INFO ] Computed 117 place invariants in 6 ms
[2022-05-15 18:21:07] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
// Phase 1: matrix 507 rows 586 cols
[2022-05-15 18:21:07] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 18:21:08] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 586/618 places, 507/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 586/618 places, 507/539 transitions.
[2022-05-15 18:21:08] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:21:08] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:21:08] [INFO ] Input system was already deterministic with 507 transitions.
[2022-05-15 18:21:08] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:21:08] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:21:08] [INFO ] Time to serialize gal into /tmp/CTLFireability18235736856155707296.gal : 2 ms
[2022-05-15 18:21:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11700613790576485642.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/CTLFireability18235736856155707296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11700613790576485642.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.
Detected timeout of ITS tools.
[2022-05-15 18:21:38] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:21:38] [INFO ] Applying decomposition
[2022-05-15 18:21:38] [INFO ] Flatten gal took : 13 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/graph4361805656821916273.txt' '-o' '/tmp/graph4361805656821916273.bin' '-w' '/tmp/graph4361805656821916273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4361805656821916273.bin' '-l' '-1' '-v' '-w' '/tmp/graph4361805656821916273.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:21:38] [INFO ] Decomposing Gal with order
[2022-05-15 18:21:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:21:38] [INFO ] Removed a total of 289 redundant transitions.
[2022-05-15 18:21:38] [INFO ] Flatten gal took : 23 ms
[2022-05-15 18:21:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2022-05-15 18:21:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11703678371495623499.gal : 4 ms
[2022-05-15 18:21:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12363772427202641964.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/CTLFireability11703678371495623499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12363772427202641964.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,1.73162,56064,7386,49,90845,601,1273,172214,57,1493,0
Converting to forward existential form...Done !
original formula: EF((AG(((AX((i7.i0.u41.p116==1)) * ((i5.i0.u8.p18==1)||(((i14.i1.u189.p696==1)&&(i4.i0.u83.p236==1))&&((i15.u154.p522==1)&&(i24.u162.p737...308
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EX(!((i7.i0.u41.p116==1)))) * ((i5.i0.u8.p18==1)||(((i14.i1.u189.p696==1)&...415
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t206, t304, t316, t397, t471, t475, t477, t479, t480, t482, t484, t493, t502...1631
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 592 transition count 513
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 592 transition count 513
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 580 transition count 501
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 579 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 579 transition count 500
Applied a total of 78 rules in 46 ms. Remains 579 /618 variables (removed 39) and now considering 500/539 (removed 39) transitions.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:22:08] [INFO ] Computed 117 place invariants in 9 ms
[2022-05-15 18:22:08] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:22:08] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:22:09] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
// Phase 1: matrix 500 rows 579 cols
[2022-05-15 18:22:09] [INFO ] Computed 117 place invariants in 3 ms
[2022-05-15 18:22:09] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 579/618 places, 500/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 579/618 places, 500/539 transitions.
[2022-05-15 18:22:09] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:22:09] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:22:09] [INFO ] Input system was already deterministic with 500 transitions.
[2022-05-15 18:22:09] [INFO ] Flatten gal took : 27 ms
[2022-05-15 18:22:09] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:22:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6666156703494329795.gal : 1 ms
[2022-05-15 18:22:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17207013538237449193.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/CTLFireability6666156703494329795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17207013538237449193.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 18:22:39] [INFO ] Flatten gal took : 16 ms
[2022-05-15 18:22:39] [INFO ] Applying decomposition
[2022-05-15 18:22:39] [INFO ] Flatten gal took : 13 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/graph17742147222430119655.txt' '-o' '/tmp/graph17742147222430119655.bin' '-w' '/tmp/graph17742147222430119655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17742147222430119655.bin' '-l' '-1' '-v' '-w' '/tmp/graph17742147222430119655.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:22:39] [INFO ] Decomposing Gal with order
[2022-05-15 18:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:22:39] [INFO ] Removed a total of 288 redundant transitions.
[2022-05-15 18:22:39] [INFO ] Flatten gal took : 22 ms
[2022-05-15 18:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2022-05-15 18:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3366637748896573695.gal : 4 ms
[2022-05-15 18:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13013462612945126509.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/CTLFireability3366637748896573695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13013462612945126509.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,4.36485,144000,5167,83,309823,1589,1222,435159,78,4029,0
Converting to forward existential form...Done !
original formula: (EX(((i1.u52.p154==1)&&(i17.i0.u24.p60==1))) + (EF(AG((i12.i0.u184.p697==1))) * EX(EF((i13.i1.u109.p335==0)))))
=> equivalent forward existential formula: ([(EY(Init) * ((i1.u52.p154==1)&&(i17.i0.u24.p60==1)))] != FALSE + [(FwdU(EY((Init * E(TRUE U !(E(TRUE U !((i12....219
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t201, t285, t301, t309, t390, t463, t464, t468, t470, t472, t473, t475, t477...1596
(forward)formula 0,0,9.52426,257108,1,0,553733,1589,8651,718239,396,4029,1386287
FORMULA BusinessProcesses-PT-19-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 594 transition count 515
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 594 transition count 515
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 581 transition count 502
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 580 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 580 transition count 501
Applied a total of 76 rules in 48 ms. Remains 580 /618 variables (removed 38) and now considering 501/539 (removed 38) transitions.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:22:49] [INFO ] Computed 117 place invariants in 9 ms
[2022-05-15 18:22:49] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:22:49] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 18:22:50] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
// Phase 1: matrix 501 rows 580 cols
[2022-05-15 18:22:50] [INFO ] Computed 117 place invariants in 4 ms
[2022-05-15 18:22:50] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/618 places, 501/539 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/618 places, 501/539 transitions.
[2022-05-15 18:22:50] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:22:50] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:22:50] [INFO ] Input system was already deterministic with 501 transitions.
[2022-05-15 18:22:50] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:22:50] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:22:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16852180796249510666.gal : 2 ms
[2022-05-15 18:22:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16418191373929496069.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/CTLFireability16852180796249510666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16418191373929496069.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.
Detected timeout of ITS tools.
[2022-05-15 18:23:20] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:23:20] [INFO ] Applying decomposition
[2022-05-15 18:23:20] [INFO ] Flatten gal took : 21 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/graph1650197770801401395.txt' '-o' '/tmp/graph1650197770801401395.bin' '-w' '/tmp/graph1650197770801401395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1650197770801401395.bin' '-l' '-1' '-v' '-w' '/tmp/graph1650197770801401395.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:23:20] [INFO ] Decomposing Gal with order
[2022-05-15 18:23:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:23:20] [INFO ] Removed a total of 289 redundant transitions.
[2022-05-15 18:23:20] [INFO ] Flatten gal took : 22 ms
[2022-05-15 18:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2022-05-15 18:23:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6876297701939211486.gal : 3 ms
[2022-05-15 18:23:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14885175446327225139.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/CTLFireability6876297701939211486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14885175446327225139.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34407e+33,12.0444,276440,25087,72,437675,941,1087,1.17082e+06,69,2195,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Graph (trivial) has 304 edges and 618 vertex of which 6 / 618 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 1344 edges and 613 vertex of which 612 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 611 transition count 445
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 174 place count 525 transition count 445
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 174 place count 525 transition count 323
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 443 place count 378 transition count 323
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 468 place count 353 transition count 298
Iterating global reduction 2 with 25 rules applied. Total rules applied 493 place count 353 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 493 place count 353 transition count 296
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 497 place count 351 transition count 296
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 786 place count 204 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 787 place count 203 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 788 place count 202 transition count 153
Applied a total of 788 rules in 53 ms. Remains 202 /618 variables (removed 416) and now considering 153/539 (removed 386) transitions.
// Phase 1: matrix 153 rows 202 cols
[2022-05-15 18:23:50] [INFO ] Computed 86 place invariants in 2 ms
[2022-05-15 18:23:50] [INFO ] Implicit Places using invariants in 108 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 123 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 175/618 places, 153/539 transitions.
Applied a total of 0 rules in 4 ms. Remains 175 /175 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 175/618 places, 153/539 transitions.
[2022-05-15 18:23:50] [INFO ] Flatten gal took : 5 ms
[2022-05-15 18:23:50] [INFO ] Flatten gal took : 5 ms
[2022-05-15 18:23:50] [INFO ] Input system was already deterministic with 153 transitions.
[2022-05-15 18:23:50] [INFO ] Flatten gal took : 6 ms
[2022-05-15 18:23:50] [INFO ] Flatten gal took : 5 ms
[2022-05-15 18:23:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7065724476866096486.gal : 0 ms
[2022-05-15 18:23:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13822643404879323469.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/CTLFireability7065724476866096486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13822643404879323469.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,5.9782e+06,0.522263,25212,2,10979,5,64950,6,0,853,56220,0
Converting to forward existential form...Done !
original formula: EF(EG((EF(((p515==1) + AF((p740==1)))) * (AG((p510==0)) + !(E((p475==1) U (p138==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U ((p515==1) + !(EG(!((p740==1)))))) * (!(E(TRUE U !((p510==0)))) + !(E((p475==1) ...181
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t38, t39, t40, t41, t42, t66, t67, t68, t69, t70, t94, t109, t117, t118, t119, t1...301
(forward)formula 0,1,17.822,577352,1,0,635,3.18316e+06,309,326,6521,2.44502e+06,726
FORMULA BusinessProcesses-PT-19-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 618/618 places, 539/539 transitions.
Graph (trivial) has 307 edges and 618 vertex of which 6 / 618 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1344 edges and 613 vertex of which 612 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 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 611 transition count 446
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 526 transition count 446
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 172 place count 526 transition count 323
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 443 place count 378 transition count 323
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 468 place count 353 transition count 298
Iterating global reduction 2 with 25 rules applied. Total rules applied 493 place count 353 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 493 place count 353 transition count 296
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 497 place count 351 transition count 296
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 797 place count 199 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 798 place count 198 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 799 place count 197 transition count 147
Applied a total of 799 rules in 45 ms. Remains 197 /618 variables (removed 421) and now considering 147/539 (removed 392) transitions.
// Phase 1: matrix 147 rows 197 cols
[2022-05-15 18:24:08] [INFO ] Computed 87 place invariants in 2 ms
[2022-05-15 18:24:09] [INFO ] Implicit Places using invariants in 122 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 129 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 169/618 places, 147/539 transitions.
Applied a total of 0 rules in 8 ms. Remains 169 /169 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 169/618 places, 147/539 transitions.
[2022-05-15 18:24:09] [INFO ] Flatten gal took : 5 ms
[2022-05-15 18:24:09] [INFO ] Flatten gal took : 5 ms
[2022-05-15 18:24:09] [INFO ] Input system was already deterministic with 147 transitions.
Incomplete random walk after 10000 steps, including 2123 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 582 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 140 steps, run visited all 1 properties in 12 ms. (steps per millisecond=11 )
Probabilistic random walk after 140 steps, saw 89 distinct states, run finished after 12 ms. (steps per millisecond=11 ) properties seen :1
FORMULA BusinessProcesses-PT-19-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2022-05-15 18:24:09] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:24:09] [INFO ] Flatten gal took : 18 ms
[2022-05-15 18:24:09] [INFO ] Applying decomposition
[2022-05-15 18:24:09] [INFO ] Flatten gal took : 14 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/graph3275966230998277584.txt' '-o' '/tmp/graph3275966230998277584.bin' '-w' '/tmp/graph3275966230998277584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3275966230998277584.bin' '-l' '-1' '-v' '-w' '/tmp/graph3275966230998277584.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:24:09] [INFO ] Decomposing Gal with order
[2022-05-15 18:24:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:24:09] [INFO ] Removed a total of 294 redundant transitions.
[2022-05-15 18:24:09] [INFO ] Flatten gal took : 24 ms
[2022-05-15 18:24:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2022-05-15 18:24:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15141255327334598534.gal : 5 ms
[2022-05-15 18:24:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9203446333229840807.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/CTLFireability15141255327334598534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9203446333229840807.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 7 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.67219e+33,7.47809,169868,7452,54,289899,600,1403,720864,63,1650,0
Converting to forward existential form...Done !
original formula: EG((E(EF((i16.i1.u165.p535==1)) U ((AX((i19.i1.u208.p715!=1)) * (i13.i0.u40.p114==1)) * (AF((i15.i1.u63.p185==1)) * A((i13.i0.u13.p28==1)...262
=> equivalent forward existential formula: [FwdG(Init,(E(E(TRUE U (i16.i1.u165.p535==1)) U ((!(EX(!((i19.i1.u208.p715!=1)))) * (i13.i0.u40.p114==1)) * (!(E...489
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t234, t320, t347, t506, t508, t510, t511, t513, t515, t516, t525, i0.u51.t31...1999
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
[2022-05-15 18:47:17] [INFO ] Applying decomposition
[2022-05-15 18:47:17] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:47:17] [INFO ] Decomposing Gal with order
[2022-05-15 18:47:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:47:17] [INFO ] Removed a total of 138 redundant transitions.
[2022-05-15 18:47:17] [INFO ] Flatten gal took : 39 ms
[2022-05-15 18:47:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 165 ms.
[2022-05-15 18:47:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15000587785232651776.gal : 9 ms
[2022-05-15 18:47:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12847611950125475823.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/CTLFireability15000587785232651776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12847611950125475823.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Detected timeout of ITS tools.
[2022-05-15 19:10:27] [INFO ] Flatten gal took : 113 ms
[2022-05-15 19:10:28] [INFO ] Input system was already deterministic with 539 transitions.
[2022-05-15 19:10:28] [INFO ] Transformed 618 places.
[2022-05-15 19:10:28] [INFO ] Transformed 539 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 19:10:58] [INFO ] Time to serialize gal into /tmp/CTLFireability577403268461342354.gal : 4 ms
[2022-05-15 19:10:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16533343129453658876.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability577403268461342354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16533343129453658876.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...319
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 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-19"
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-19, 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-165251918600466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 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 '
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 ;