fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254772300618
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Dekker-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3557.403 185889.00 217793.00 1104.80 FFTTFFFFFTTTTTTT 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.r060-tall-165254772300618.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 Dekker-PT-050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 Dekker-PT-050-CTLFireability-00
FORMULA_NAME Dekker-PT-050-CTLFireability-01
FORMULA_NAME Dekker-PT-050-CTLFireability-02
FORMULA_NAME Dekker-PT-050-CTLFireability-03
FORMULA_NAME Dekker-PT-050-CTLFireability-04
FORMULA_NAME Dekker-PT-050-CTLFireability-05
FORMULA_NAME Dekker-PT-050-CTLFireability-06
FORMULA_NAME Dekker-PT-050-CTLFireability-07
FORMULA_NAME Dekker-PT-050-CTLFireability-08
FORMULA_NAME Dekker-PT-050-CTLFireability-09
FORMULA_NAME Dekker-PT-050-CTLFireability-10
FORMULA_NAME Dekker-PT-050-CTLFireability-11
FORMULA_NAME Dekker-PT-050-CTLFireability-12
FORMULA_NAME Dekker-PT-050-CTLFireability-13
FORMULA_NAME Dekker-PT-050-CTLFireability-14
FORMULA_NAME Dekker-PT-050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652631589701

Running Version 202205111006
[2022-05-15 16:19:50] [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 16:19:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:19:51] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2022-05-15 16:19:51] [INFO ] Transformed 250 places.
[2022-05-15 16:19:51] [INFO ] Transformed 2600 transitions.
[2022-05-15 16:19:51] [INFO ] Found NUPN structural information;
[2022-05-15 16:19:51] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 321 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 36 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:19:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2022-05-15 16:19:51] [INFO ] Computed 150 place invariants in 21 ms
[2022-05-15 16:19:51] [INFO ] Implicit Places using invariants in 297 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 331 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 20 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/250 places, 2600/2600 transitions.
Support contains 150 out of 201 places after structural reductions.
[2022-05-15 16:19:52] [INFO ] Flatten gal took : 224 ms
[2022-05-15 16:19:52] [INFO ] Flatten gal took : 148 ms
[2022-05-15 16:19:52] [INFO ] Input system was already deterministic with 2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 95) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:19:53] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:19:53] [INFO ] Computed 101 place invariants in 11 ms
[2022-05-15 16:19:53] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2022-05-15 16:19:53] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:19:53] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:19:53] [INFO ] [Nat]Absence check using 100 positive place invariants in 20 ms returned sat
[2022-05-15 16:19:53] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:19:53] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:19:53] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:19:53] [INFO ] After 30ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:19:53] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 6 ms to minimize.
[2022-05-15 16:19:53] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2022-05-15 16:19:53] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2022-05-15 16:19:53] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-15 16:19:53] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2022-05-15 16:19:54] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 16:19:54] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-05-15 16:19:54] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 16:19:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 16:19:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 16:19:54] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 16:19:54] [INFO ] Trap strengthening procedure interrupted after too many repetitions 983 ms
[2022-05-15 16:19:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 983 ms
[2022-05-15 16:19:54] [INFO ] After 1031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 16:19:54] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 160 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 755973 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 755973 steps, saw 617625 distinct states, run finished after 3002 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:19:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:19:57] [INFO ] Computed 101 place invariants in 5 ms
[2022-05-15 16:19:57] [INFO ] [Real]Absence check using 100 positive place invariants in 10 ms returned sat
[2022-05-15 16:19:57] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 16:19:57] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:19:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 10 ms returned sat
[2022-05-15 16:19:57] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 16:19:57] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:19:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:19:58] [INFO ] After 32ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:19:58] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 16:19:58] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 16:19:58] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-05-15 16:19:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 16:19:58] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 16:19:58] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 16:19:58] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-05-15 16:19:59] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 26 ms to minimize.
[2022-05-15 16:19:59] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 0 ms to minimize.
[2022-05-15 16:19:59] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2022-05-15 16:19:59] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 16:19:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1650 ms
[2022-05-15 16:19:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1651 ms
[2022-05-15 16:19:59] [INFO ] After 1696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-15 16:19:59] [INFO ] After 1848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 115 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 143 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:19:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:19:59] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-15 16:20:00] [INFO ] Implicit Places using invariants in 464 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 469 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 59 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 828036 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 828036 steps, saw 672518 distinct states, run finished after 3001 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:20:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:20:03] [INFO ] Computed 100 place invariants in 8 ms
[2022-05-15 16:20:03] [INFO ] [Real]Absence check using 100 positive place invariants in 11 ms returned sat
[2022-05-15 16:20:03] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:20:03] [INFO ] [Nat]Absence check using 100 positive place invariants in 10 ms returned sat
[2022-05-15 16:20:03] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:20:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:20:03] [INFO ] After 27ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
[2022-05-15 16:20:04] [INFO ] Trap strengthening procedure interrupted after too many repetitions 918 ms
[2022-05-15 16:20:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 919 ms
[2022-05-15 16:20:04] [INFO ] After 961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 16:20:04] [INFO ] After 1114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 57 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 54 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:20:04] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-15 16:20:05] [INFO ] Implicit Places using invariants in 367 ms returned []
[2022-05-15 16:20:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:20:05] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-15 16:20:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:20:05] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2022-05-15 16:20:06] [INFO ] Redundant transitions in 195 ms returned []
[2022-05-15 16:20:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2022-05-15 16:20:06] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-15 16:20:06] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 2600/2600 transitions.
Graph (complete) has 300 edges and 200 vertex of which 12 are kept as prefixes of interest. Removing 188 places using SCC suffix rule.4 ms
Discarding 188 places :
Also discarding 2444 output transitions
Drop transitions removed 2444 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 12 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 12 transition count 11
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 149 place count 10 transition count 10
Applied a total of 149 rules in 14 ms. Remains 10 /200 variables (removed 190) and now considering 10/2600 (removed 2590) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 10 cols
[2022-05-15 16:20:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 16:20:06] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2022-05-15 16:20:06] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 16:20:06] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:20:06] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:20:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 16:20:06] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:20:06] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-15 16:20:06] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 16:20:06] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:20:06] [INFO ] Flatten gal took : 1 ms
[2022-05-15 16:20:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7120611925303706228.gal : 6 ms
[2022-05-15 16:20:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1772863482884368241.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9465777127016619495;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7120611925303706228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1772863482884368241.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1772863482884368241.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,18,0.009309,3784,2,18,6,78,7,0,59,40,0
Total reachable state count : 18

Verifying 1 reachability properties.
Reachability property AtomicPropp74 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp74,1,0.009687,3784,2,11,6,78,7,0,68,40,0
[2022-05-15 16:20:07] [INFO ] Flatten gal took : 117 ms
[2022-05-15 16:20:07] [INFO ] Flatten gal took : 123 ms
[2022-05-15 16:20:07] [INFO ] Input system was already deterministic with 2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 283 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:07] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-15 16:20:08] [INFO ] Implicit Places using invariants in 383 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 387 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 80 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:20:08] [INFO ] Flatten gal took : 97 ms
[2022-05-15 16:20:08] [INFO ] Flatten gal took : 109 ms
[2022-05-15 16:20:08] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:20:08] [INFO ] Flatten gal took : 97 ms
[2022-05-15 16:20:08] [INFO ] Flatten gal took : 99 ms
[2022-05-15 16:20:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2579956562546330004.gal : 63 ms
[2022-05-15 16:20:08] [INFO ] Time to serialize properties into /tmp/CTLFireability17607855412835728896.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/CTLFireability2579956562546330004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17607855412835728896.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,2.92734e+16,0.672094,36696,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EF((AG(AF((((flag_1_1==1)&&(flag_1_22==1))&&(p1_1==1)))) * !(A(((EF((((flag_1_0==1)&&(flag_1_45==1))&&(p1_0==1))) * !((((flag_1_29==1)&&(...295
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((((flag_1_1==1)&&(flag_1_22==1))&&(p1_1==1))))))))),!(EG((((flag...611
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,4.98747,159520,1,0,5267,1.04933e+06,5244,2608,35551,512932,5229
FORMULA Dekker-PT-050-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:14] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:20:14] [INFO ] Implicit Places using invariants in 348 ms returned []
[2022-05-15 16:20:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:14] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:20:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-15 16:20:14] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2022-05-15 16:20:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:14] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:20:15] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 2600/2600 transitions.
[2022-05-15 16:20:15] [INFO ] Flatten gal took : 88 ms
[2022-05-15 16:20:15] [INFO ] Flatten gal took : 98 ms
[2022-05-15 16:20:15] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:20:16] [INFO ] Flatten gal took : 95 ms
[2022-05-15 16:20:16] [INFO ] Flatten gal took : 94 ms
[2022-05-15 16:20:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7571404961497919533.gal : 9 ms
[2022-05-15 16:20:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16226034117735836545.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/CTLFireability7571404961497919533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16226034117735836545.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,2.92734e+16,0.662039,36840,2,646,5,47154,6,0,3407,14998,0


Converting to forward existential form...Done !
original formula: EX((E(((E((((flag_1_17==1)&&(flag_1_47==1))&&(p1_47==1)) U ((flag_1_0==1)&&(p3_0==1))) + (((flag_1_5==1)&&(flag_1_8==1))&&(p1_8==1))) + (...358
=> equivalent forward existential formula: [(FwdU((EY(Init) * E(((E((((flag_1_17==1)&&(flag_1_47==1))&&(p1_47==1)) U ((flag_1_0==1)&&(p3_0==1))) + (((flag_...434
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,4.3926,153432,1,0,5260,1.03411e+06,5221,2603,35383,497600,5213
FORMULA Dekker-PT-050-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:20] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:20:20] [INFO ] Implicit Places using invariants in 255 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:20:20] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:20:21] [INFO ] Flatten gal took : 97 ms
[2022-05-15 16:20:21] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:20:21] [INFO ] Flatten gal took : 95 ms
[2022-05-15 16:20:21] [INFO ] Flatten gal took : 96 ms
[2022-05-15 16:20:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5418316445674420335.gal : 10 ms
[2022-05-15 16:20:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10637729142096179182.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/CTLFireability5418316445674420335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10637729142096179182.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,2.92734e+16,0.670938,36676,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AX(((!(A(!((((flag_1_25==1)&&(flag_1_32==1))&&(p1_32==1))) U ((((flag_1_36==1)&&(flag_1_47==1))&&((p1_36==1)&&(flag_1_12==1)))&&((flag_1_...916
=> equivalent forward existential formula: (([((EY(Init) * !(EG(!(((((flag_1_36==1)&&(flag_1_47==1))&&((p1_36==1)&&(flag_1_12==1)))&&((flag_1_27==1)&&(p1_1...1693
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,6.63306,215252,1,0,5301,1.33722e+06,5270,2639,35633,682926,5292
FORMULA Dekker-PT-050-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 8 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:28] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-15 16:20:28] [INFO ] Implicit Places using invariants in 307 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:20:28] [INFO ] Flatten gal took : 103 ms
[2022-05-15 16:20:28] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:20:28] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:20:28] [INFO ] Flatten gal took : 91 ms
[2022-05-15 16:20:29] [INFO ] Flatten gal took : 91 ms
[2022-05-15 16:20:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4834485565191167183.gal : 9 ms
[2022-05-15 16:20:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5389082273666427600.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/CTLFireability4834485565191167183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5389082273666427600.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.670308,36640,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: E(!((((EF(EG((((flag_1_3==1)&&(flag_1_39==1))&&(p1_39==1)))) * ((AF((((flag_1_18==1)&&(flag_1_26==1))&&(p1_18==1))) + (((flag_1_34==1)&&(...1540
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!((((E(TRUE U EG((((flag_1_3==1)&&(flag_1_39==1))&&(p1_39==1)))) * ((!(EG(!((((flag_1_18==1)&&...1938
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,17.4636,476640,1,0,5385,3.4228e+06,5251,2727,35735,1.45643e+06,5409
FORMULA Dekker-PT-050-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:46] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:20:47] [INFO ] Implicit Places using invariants in 404 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 407 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:20:47] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:20:47] [INFO ] Flatten gal took : 99 ms
[2022-05-15 16:20:47] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:20:47] [INFO ] Flatten gal took : 92 ms
[2022-05-15 16:20:47] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:20:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6481506870944614517.gal : 14 ms
[2022-05-15 16:20:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7519699243503660591.ctl : 277 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/CTLFireability6481506870944614517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7519699243503660591.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.68564,36812,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AX(E((EG((((flag_1_9==1)&&(flag_1_37==1))&&(p1_9==1))) + (((flag_1_2==1)&&(flag_1_40==1))&&(p1_40==1))) U !(EG(EF((((flag_1_20==1)&&(flag...183
=> equivalent forward existential formula: [(EY(Init) * !(E((EG((((flag_1_9==1)&&(flag_1_37==1))&&(p1_9==1))) + (((flag_1_2==1)&&(flag_1_40==1))&&(p1_40==1...236
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,5.17926,158952,1,0,5265,1.04351e+06,5233,2609,35518,511124,5228
FORMULA Dekker-PT-050-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:53] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:53] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:20:53] [INFO ] Implicit Places using invariants in 328 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:20:53] [INFO ] Flatten gal took : 85 ms
[2022-05-15 16:20:53] [INFO ] Flatten gal took : 96 ms
[2022-05-15 16:20:53] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:20:53] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:20:54] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:20:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9600052852556525241.gal : 8 ms
[2022-05-15 16:20:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13716999777307693189.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/CTLFireability9600052852556525241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13716999777307693189.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,2.92734e+16,0.692697,36688,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AX((((((flag_1_8==0)||(flag_1_47==0))||(p1_8==0)) * (!(E(AG((((((((flag_0_0==1)&&(flag_0_1==1))&&((flag_0_2==1)&&(flag_0_3==1)))&&(((flag...1172
=> equivalent forward existential formula: ([FwdG(FwdU((EY(Init) * !(((((flag_1_8==0)||(flag_1_47==0))||(p1_8==0)) * (!(E(!(E(TRUE U !((((((((flag_0_0==1)&...2326
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Hit Full ! (commute/partial/dont) 2401/346/199
(forward)formula 0,0,5.65665,164976,1,0,5270,1.07326e+06,5243,2612,36620,526436,5229
FORMULA Dekker-PT-050-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 71 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:20:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:20:59] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-15 16:21:00] [INFO ] Implicit Places using invariants in 388 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 71 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:21:00] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:21:00] [INFO ] Flatten gal took : 98 ms
[2022-05-15 16:21:00] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:21:00] [INFO ] Flatten gal took : 95 ms
[2022-05-15 16:21:00] [INFO ] Flatten gal took : 97 ms
[2022-05-15 16:21:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16431363137885238351.gal : 10 ms
[2022-05-15 16:21:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3428148884658509522.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/CTLFireability16431363137885238351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3428148884658509522.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,2.92734e+16,0.682529,36800,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AG((AG(((((flag_1_7==0)||(flag_1_9==0))||((p1_7==0)||(flag_1_21==0)))||((flag_1_33==0)||(p1_21==0)))) + (((flag_1_14==1)&&(flag_1_33==1))...170
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((((flag_1_14==1)&&(flag_1_33==1))&&(p1_33==1)))),TRUE) * !(((((flag_1_7==0)||(flag_1...234
(forward)formula 0,0,0.881225,36800,1,0,10,55024,12,4,8051,19860,4
FORMULA Dekker-PT-050-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 74 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:01] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:21:02] [INFO ] Implicit Places using invariants in 399 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 80 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:21:02] [INFO ] Flatten gal took : 85 ms
[2022-05-15 16:21:02] [INFO ] Flatten gal took : 97 ms
[2022-05-15 16:21:02] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:21:02] [INFO ] Flatten gal took : 90 ms
[2022-05-15 16:21:02] [INFO ] Flatten gal took : 88 ms
[2022-05-15 16:21:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10726693571078391255.gal : 8 ms
[2022-05-15 16:21:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12862165404945802962.ctl : 64 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/CTLFireability10726693571078391255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12862165404945802962.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.652428,36852,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EF(AG((AG((((flag_1_1==1)&&(flag_1_21==1))&&(p1_21==1))) * AF((((flag_1_21==1)&&(flag_1_28==1))&&(p1_21==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !((((flag_1_1==1)&&(flag_1_21==1))&&(p1_21==1))))) * !(EG(!((((flag...212
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,4.79677,154708,1,0,5263,1.03236e+06,5230,2606,35531,501680,5220
FORMULA Dekker-PT-050-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 19 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:07] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:21:08] [INFO ] Implicit Places using invariants in 359 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 362 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:21:08] [INFO ] Flatten gal took : 86 ms
[2022-05-15 16:21:08] [INFO ] Flatten gal took : 106 ms
[2022-05-15 16:21:08] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:21:08] [INFO ] Flatten gal took : 91 ms
[2022-05-15 16:21:08] [INFO ] Flatten gal took : 91 ms
[2022-05-15 16:21:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11875318922359839381.gal : 10 ms
[2022-05-15 16:21:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8636904854082680173.ctl : 69 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/CTLFireability11875318922359839381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8636904854082680173.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,2.92734e+16,0.670885,36628,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EF((AX((AF((((flag_1_13==1)&&(flag_1_46==1))&&(p1_46==1))) + AF((((flag_1_0==0)||(flag_1_1==0))||(p1_1==0))))) * AX(((EG((((flag_1_27==1)...376
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!((!(EG(!((((flag_1_13==1)&&(flag_1_46==1))&&(p1_46==1))))) + !(EG(!((((flag_1_0==0)||...579
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,0,5.42932,173300,1,0,5279,1.12934e+06,5238,2621,35355,566556,5244
FORMULA Dekker-PT-050-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:14] [INFO ] Computed 101 place invariants in 3 ms
[2022-05-15 16:21:14] [INFO ] Implicit Places using invariants in 381 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:21:14] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:21:14] [INFO ] Flatten gal took : 102 ms
[2022-05-15 16:21:14] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:21:14] [INFO ] Flatten gal took : 94 ms
[2022-05-15 16:21:15] [INFO ] Flatten gal took : 92 ms
[2022-05-15 16:21:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5174843382594675710.gal : 8 ms
[2022-05-15 16:21:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12831373728245606452.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/CTLFireability5174843382594675710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12831373728245606452.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,2.92734e+16,0.697623,36836,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AF(((AG(EX((((flag_1_5!=1)||(flag_1_26!=1))||(p1_5!=1)))) + AG(AX((((flag_1_0==1)&&(flag_1_3==1))&&(p1_3==1))))) + ((((flag_1_27==1)&&(fl...231
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(EX((((flag_1_5!=1)||(flag_1_26!=1))||(p1_5!=1)))))) + !(E(TRUE U !(!(EX(!((((flag_1_...306
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,5.18678,161332,1,0,5266,1.06758e+06,5230,2608,35553,522667,5221
FORMULA Dekker-PT-050-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:20] [INFO ] Computed 101 place invariants in 4 ms
[2022-05-15 16:21:20] [INFO ] Implicit Places using invariants in 371 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 374 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:21:20] [INFO ] Flatten gal took : 85 ms
[2022-05-15 16:21:20] [INFO ] Flatten gal took : 97 ms
[2022-05-15 16:21:21] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:21:21] [INFO ] Flatten gal took : 90 ms
[2022-05-15 16:21:21] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:21:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5408198263716683693.gal : 8 ms
[2022-05-15 16:21:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8784296352296339356.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/CTLFireability5408198263716683693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8784296352296339356.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.678855,36800,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AG((((flag_1_15==0)||(flag_1_32==0)) + ((p1_32==0) + E(EF((((flag_1_25==1)&&(flag_1_29==1))&&(p1_25==1))) U !((EX((((flag_1_24==1)&&(flag...285
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((flag_1_15==0)||(flag_1_32==0)))) * !((p1_32==0))) * !(E(E(TRUE U (((flag_1_25==1)&&(fl...351
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,4.83853,155768,1,0,5267,1.04779e+06,5224,2608,35389,506898,5221
FORMULA Dekker-PT-050-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 10 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:21:26] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:21:26] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:21:26] [INFO ] Implicit Places using invariants in 268 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 270 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:21:26] [INFO ] Flatten gal took : 111 ms
[2022-05-15 16:21:26] [INFO ] Flatten gal took : 91 ms
[2022-05-15 16:21:26] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:21:26] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:21:26] [INFO ] Flatten gal took : 95 ms
[2022-05-15 16:21:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13774974547636071953.gal : 8 ms
[2022-05-15 16:21:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5513760559862417560.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/CTLFireability13774974547636071953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5513760559862417560.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,2.92734e+16,0.690277,36688,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: (E(AX(E((((!(((flag_1_20==1)&&(flag_1_29==1))&&(p1_29==1)))||(((flag_1_32==1)&&(flag_1_38==1))&&(p1_38==1)))||(((flag_1_5==1)&&(flag_1_26...1096
=> equivalent forward existential formula: ([(Init * !(E(!(EX(!(E((((!(((flag_1_20==1)&&(flag_1_29==1))&&(p1_29==1)))||(((flag_1_32==1)&&(flag_1_38==1))&&(...1800
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2022-05-15 16:21:57] [INFO ] Flatten gal took : 91 ms
[2022-05-15 16:21:57] [INFO ] Applying decomposition
[2022-05-15 16:21:57] [INFO ] Flatten gal took : 92 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/graph2447735645984668234.txt' '-o' '/tmp/graph2447735645984668234.bin' '-w' '/tmp/graph2447735645984668234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2447735645984668234.bin' '-l' '-1' '-v' '-w' '/tmp/graph2447735645984668234.weights' '-q' '0' '-e' '0.001'
[2022-05-15 16:21:57] [INFO ] Decomposing Gal with order
[2022-05-15 16:21:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:21:57] [INFO ] Removed a total of 7200 redundant transitions.
[2022-05-15 16:21:57] [INFO ] Flatten gal took : 243 ms
[2022-05-15 16:21:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 55 ms.
[2022-05-15 16:21:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13646203282211379009.gal : 15 ms
[2022-05-15 16:21:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15268039835534827069.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/CTLFireability13646203282211379009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15268039835534827069.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,2.92734e+16,0.365766,12340,103,10,1570,1350,2815,1245,26,1324,0


Converting to forward existential form...Done !
original formula: (E(AX(E((((!(((u20.flag_1_20==1)&&(u29.flag_1_29==1))&&(u29.p1_29==1)))||(((u32.flag_1_32==1)&&(u38.flag_1_38==1))&&(u38.p1_38==1)))||(((...1335
=> equivalent forward existential formula: ([(Init * !(E(!(EX(!(E((((!(((u20.flag_1_20==1)&&(u29.flag_1_29==1))&&(u29.p1_29==1)))||(((u32.flag_1_32==1)&&(u...2153
Reverse transition relation is NOT exact ! Due to transitions u0.t51, u1.t103, u2.t155, u3.t207, u4.t259, u5.t311, u6.t363, u7.t415, u8.t467, u9.t519, u10....684
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 0,1,3.31928,130200,1,0,281870,1350,20611,357661,173,1324,350149
FORMULA Dekker-PT-050-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:01] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:01] [INFO ] Implicit Places using invariants in 267 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 273 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:22:01] [INFO ] Flatten gal took : 98 ms
[2022-05-15 16:22:01] [INFO ] Flatten gal took : 109 ms
[2022-05-15 16:22:01] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:22:02] [INFO ] Flatten gal took : 100 ms
[2022-05-15 16:22:02] [INFO ] Flatten gal took : 101 ms
[2022-05-15 16:22:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10213840105330865419.gal : 10 ms
[2022-05-15 16:22:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4808175582061273715.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/CTLFireability10213840105330865419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4808175582061273715.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,2.92734e+16,0.68244,36672,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: (E((AF(AX(((((flag_1_22==1)&&(p3_22==1))&&((flag_1_6==1)&&(flag_1_45==1)))&&(p1_6==1)))) + E((!(EG((((flag_1_5==1)&&(flag_1_38==1))&&(p1_...1259
=> equivalent forward existential formula: ([(FwdU(((FwdU(FwdU(Init,(!(EG(!(!(EX(!(((((flag_1_22==1)&&(p3_22==1))&&((flag_1_6==1)&&(flag_1_45==1)))&&(p1_6=...2624
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2022-05-15 16:22:32] [INFO ] Flatten gal took : 95 ms
[2022-05-15 16:22:32] [INFO ] Applying decomposition
[2022-05-15 16:22:32] [INFO ] Flatten gal took : 94 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/graph10795585273687182145.txt' '-o' '/tmp/graph10795585273687182145.bin' '-w' '/tmp/graph10795585273687182145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10795585273687182145.bin' '-l' '-1' '-v' '-w' '/tmp/graph10795585273687182145.weights' '-q' '0' '-e' '0.001'
[2022-05-15 16:22:32] [INFO ] Decomposing Gal with order
[2022-05-15 16:22:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 16:22:32] [INFO ] Removed a total of 7200 redundant transitions.
[2022-05-15 16:22:32] [INFO ] Flatten gal took : 161 ms
[2022-05-15 16:22:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 41 ms.
[2022-05-15 16:22:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6670432440784539090.gal : 9 ms
[2022-05-15 16:22:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4429076387589878339.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/CTLFireability6670432440784539090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4429076387589878339.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.371223,12248,103,10,1473,1350,2815,1196,26,1323,0


Converting to forward existential form...Done !
original formula: (E((AF(AX(((((u22.flag_1_22==1)&&(u22.p3_22==1))&&((u6.flag_1_6==1)&&(u45.flag_1_45==1)))&&(u6.p1_6==1)))) + E((!(EG((((u5.flag_1_5==1)&&...1528
=> equivalent forward existential formula: ([(FwdU(((FwdU(FwdU(Init,(!(EG(!(!(EX(!(((((u22.flag_1_22==1)&&(u22.p3_22==1))&&((u6.flag_1_6==1)&&(u45.flag_1_4...3135
Reverse transition relation is NOT exact ! Due to transitions u0.t51, u1.t103, u2.t155, u3.t207, u4.t259, u5.t311, u6.t363, u7.t415, u8.t467, u9.t519, u10....684
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
(forward)formula 0,1,3.62989,144420,1,0,333502,1350,19719,394543,178,1323,417263
FORMULA Dekker-PT-050-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 24 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:36] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:36] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:22:37] [INFO ] Implicit Places using invariants in 422 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:22:37] [INFO ] Flatten gal took : 86 ms
[2022-05-15 16:22:37] [INFO ] Flatten gal took : 96 ms
[2022-05-15 16:22:37] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:22:37] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:22:37] [INFO ] Flatten gal took : 92 ms
[2022-05-15 16:22:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11922109808251600852.gal : 18 ms
[2022-05-15 16:22:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10355213967892741913.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/CTLFireability11922109808251600852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10355213967892741913.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.746239,36688,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AX(EF((((flag_1_19==1)&&(flag_1_20==1))&&(p1_19==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((flag_1_19==1)&&(flag_1_20==1))&&(p1_19==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,5.07269,151904,1,0,5260,1.01964e+06,5221,2603,35274,490740,5213
FORMULA Dekker-PT-050-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 19 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:42] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:42] [INFO ] Computed 101 place invariants in 2 ms
[2022-05-15 16:22:43] [INFO ] Implicit Places using invariants in 418 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 423 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:22:43] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:22:43] [INFO ] Flatten gal took : 99 ms
[2022-05-15 16:22:43] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:22:43] [INFO ] Flatten gal took : 98 ms
[2022-05-15 16:22:43] [INFO ] Flatten gal took : 101 ms
[2022-05-15 16:22:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11813124704461496126.gal : 10 ms
[2022-05-15 16:22:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8237851366473122899.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/CTLFireability11813124704461496126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8237851366473122899.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,2.92734e+16,0.722581,36816,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: AX(EF((((flag_1_16==1)&&(flag_1_32==1))&&(p1_32==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((flag_1_16==1)&&(flag_1_32==1))&&(p1_32==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,4.90389,152032,1,0,5260,1.01416e+06,5221,2603,35274,488322,5213
FORMULA Dekker-PT-050-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2022-05-15 16:22:48] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2022-05-15 16:22:48] [INFO ] Computed 101 place invariants in 1 ms
[2022-05-15 16:22:49] [INFO ] Implicit Places using invariants in 411 ms returned [180]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 415 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 2600/2600 transitions.
[2022-05-15 16:22:49] [INFO ] Flatten gal took : 87 ms
[2022-05-15 16:22:49] [INFO ] Flatten gal took : 101 ms
[2022-05-15 16:22:49] [INFO ] Input system was already deterministic with 2600 transitions.
[2022-05-15 16:22:49] [INFO ] Flatten gal took : 94 ms
[2022-05-15 16:22:49] [INFO ] Flatten gal took : 95 ms
[2022-05-15 16:22:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8002452337077808135.gal : 9 ms
[2022-05-15 16:22:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6812343255016487412.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/CTLFireability8002452337077808135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6812343255016487412.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92734e+16,0.713005,36724,2,642,5,46701,6,0,3403,14896,0


Converting to forward existential form...Done !
original formula: EX(AX(EG((((flag_1_3==0)||(flag_1_4==0))||(p1_3==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG((((flag_1_3==0)||(flag_1_4==0))||(p1_3==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
(forward)formula 0,1,5.45751,158000,1,0,5266,1.04118e+06,5222,2609,35332,510274,5216
FORMULA Dekker-PT-050-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-05-15 16:22:55] [INFO ] Flatten gal took : 93 ms
[2022-05-15 16:22:55] [INFO ] Flatten gal took : 94 ms
Total runtime 184719 ms.

BK_STOP 1652631775590

--------------------
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="Dekker-PT-050"
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 Dekker-PT-050, 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 r060-tall-165254772300618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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