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

About the Execution of ITS-Tools for DBSingleClientW-PT-d0m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
331.151 22967.00 41081.00 89.50 FFTFFTFTFTTTTFFF 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.r312-tall-165472281800130.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 DBSingleClientW-PT-d0m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281800130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 119K Jun 6 12:11 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 DBSingleClientW-PT-d0m04-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1654774199695

Running Version 202205111006
[2022-06-09 11:30:00] [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-06-09 11:30:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:30:01] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-06-09 11:30:01] [INFO ] Transformed 553 places.
[2022-06-09 11:30:01] [INFO ] Transformed 150 transitions.
[2022-06-09 11:30:01] [INFO ] Parsed PT model containing 553 places and 150 transitions in 215 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 67 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 99 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 99 transition count 136
Applied a total of 24 rules in 17 ms. Remains 99 /109 variables (removed 10) and now considering 136/150 (removed 14) transitions.
// Phase 1: matrix 136 rows 99 cols
[2022-06-09 11:30:01] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 11:30:01] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 136 rows 99 cols
[2022-06-09 11:30:01] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 11:30:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 11:30:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
// Phase 1: matrix 136 rows 99 cols
[2022-06-09 11:30:01] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 11:30:01] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/109 places, 136/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/109 places, 136/150 transitions.
Support contains 67 out of 99 places after structural reductions.
[2022-06-09 11:30:01] [INFO ] Flatten gal took : 63 ms
[2022-06-09 11:30:01] [INFO ] Flatten gal took : 27 ms
[2022-06-09 11:30:01] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 65 out of 99 places (down from 67) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 63) seen :27
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 66 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
// Phase 1: matrix 136 rows 99 cols
[2022-06-09 11:30:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:30:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 11:30:03] [INFO ] After 276ms SMT Verify possible using state equation in real domain returned unsat :6 sat :1 real:29
[2022-06-09 11:30:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 11:30:03] [INFO ] After 16ms SMT Verify possible using 61 Read/Feed constraints in real domain returned unsat :6 sat :0 real:30
[2022-06-09 11:30:03] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:30
[2022-06-09 11:30:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:30:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:04] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :30
[2022-06-09 11:30:04] [INFO ] After 479ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :6 sat :30
[2022-06-09 11:30:05] [INFO ] After 1156ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :30
Attempting to minimize the solution found.
Minimization took 474 ms.
[2022-06-09 11:30:05] [INFO ] After 2200ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :30
Fused 36 Parikh solutions to 30 different solutions.
Parikh walk visited 1 properties in 166 ms.
Support contains 37 out of 99 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 93 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 93 transition count 128
Applied a total of 12 rules in 15 ms. Remains 93 /99 variables (removed 6) and now considering 128/136 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/99 places, 128/136 transitions.
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 62 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 118 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 114 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 128 rows 93 cols
[2022-06-09 11:30:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:30:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 8 ms returned sat
[2022-06-09 11:30:07] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2022-06-09 11:30:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:30:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:30:07] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2022-06-09 11:30:07] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 11:30:07] [INFO ] After 362ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2022-06-09 11:30:08] [INFO ] After 852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 390 ms.
[2022-06-09 11:30:08] [INFO ] After 1667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 213 ms.
Support contains 35 out of 93 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 128/128 transitions.
Applied a total of 0 rules in 12 ms. Remains 93 /93 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/93 places, 128/128 transitions.
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 26) seen :0
Probably explored full state space saw : 9937 states, properties seen :23
Probabilistic random walk after 23766 steps, saw 9937 distinct states, run finished after 212 ms. (steps per millisecond=112 ) properties seen :23
Explored full state space saw : 10013 states, properties seen :0
Exhaustive walk after 23842 steps, saw 10013 distinct states, run finished after 124 ms. (steps per millisecond=192 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-09 11:30:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-06-09 11:30:09] [INFO ] Flatten gal took : 10 ms
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-09 11:30:09] [INFO ] Flatten gal took : 11 ms
[2022-06-09 11:30:09] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 42 out of 99 places (down from 50) after GAL structural reductions.
Computed a total of 6 stabilizing places and 6 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 97
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 68 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 68 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 66 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 63 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 63 transition count 74
Applied a total of 77 rules in 14 ms. Remains 63 /99 variables (removed 36) and now considering 74/136 (removed 62) transitions.
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:30:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:10] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:30:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:10] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:30:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:10] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/99 places, 74/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/99 places, 74/136 transitions.
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:10] [INFO ] Input system was already deterministic with 74 transitions.
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3428241406908718141.gal : 2 ms
[2022-06-09 11:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1481324068468949604.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/CTLFireability3428241406908718141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1481324068468949604.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,4788,0.077596,7392,2,1519,5,11605,6,0,326,7684,0


Converting to forward existential form...Done !
original formula: AX(EF(AG((((p33>=1)&&(l0>=1))||((p34>=1)&&(l122>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !((((p33>=1)&&(l0>=1))||((p34>=1)&&(l122>=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t44, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t6...301
(forward)formula 0,0,0.298016,15492,1,0,143,44846,170,59,2248,27642,162
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 63 transition count 73
Applied a total of 77 rules in 25 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:10] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:10] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:30:10] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-06-09 11:30:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:10] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/99 places, 73/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/99 places, 73/136 transitions.
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 44 ms
[2022-06-09 11:30:10] [INFO ] Input system was already deterministic with 73 transitions.
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:10] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5094272643921978370.gal : 1 ms
[2022-06-09 11:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8272181247623043171.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/CTLFireability5094272643921978370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8272181247623043171.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,4900,0.063365,7488,2,1636,5,10625,6,0,325,7666,0


Converting to forward existential form...Done !
original formula: EG(EF(((s1>=1)&&(l503>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((s1>=1)&&(l503>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t48, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,1,0.430965,21704,1,0,269,74108,173,135,2204,59313,273
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 86 transition count 108
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 86 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 80 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 80 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 80 transition count 100
Applied a total of 40 rules in 5 ms. Remains 80 /99 variables (removed 19) and now considering 100/136 (removed 36) transitions.
// Phase 1: matrix 100 rows 80 cols
[2022-06-09 11:30:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:11] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 100 rows 80 cols
[2022-06-09 11:30:11] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:30:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 11:30:11] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 80 cols
[2022-06-09 11:30:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/99 places, 100/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/99 places, 100/136 transitions.
[2022-06-09 11:30:11] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:30:11] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:30:11] [INFO ] Input system was already deterministic with 100 transitions.
[2022-06-09 11:30:11] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:11] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:11] [INFO ] Time to serialize gal into /tmp/CTLFireability13474712801393471564.gal : 1 ms
[2022-06-09 11:30:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12210096534375514433.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/CTLFireability13474712801393471564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12210096534375514433.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,8429,0.162368,11684,2,2677,5,25882,6,0,420,16411,0


Converting to forward existential form...Done !
original formula: EX(((AF((((s1>=1)&&(l486>=1))&&(((s1<1)||(l342<1))||((s1<1)||(l486<1))))) * (((!(E(((s1>=1)&&(l32>=1)) U ((p34>=1)&&(l122>=1)))) + ((s9>=...389
=> equivalent forward existential formula: ([(EY((EY(Init) * (!(EG(!((((s1>=1)&&(l486>=1))&&(((s1<1)||(l342<1))||((s1<1)||(l486<1))))))) * (((!(E(((s1>=1)&...693
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t55, t56, t60, t61, t62, t63, t70, t71, t72, t73, t74, t7...377
(forward)formula 0,0,1.54228,55504,1,0,444,252674,239,206,2895,184342,512
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 63 transition count 73
Applied a total of 77 rules in 11 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:13] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:13] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:30:13] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:13] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/99 places, 73/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/99 places, 73/136 transitions.
[2022-06-09 11:30:13] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:13] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:13] [INFO ] Input system was already deterministic with 73 transitions.
[2022-06-09 11:30:13] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:30:13] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8232999878320380642.gal : 3 ms
[2022-06-09 11:30:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18138428046770064565.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/CTLFireability8232999878320380642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18138428046770064565.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,4900,0.067737,7320,2,1636,5,10625,6,0,325,7666,0


Converting to forward existential form...Done !
original formula: EX(AX(AF(AG(((s1>=1)&&(l505>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(EG(!(!(E(TRUE U !(((s1>=1)&&(l505>=1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t48, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,0,0.598119,24648,1,0,197,92183,171,86,2235,72315,220
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 62 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 61 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 70
Applied a total of 82 rules in 15 ms. Remains 61 /99 variables (removed 38) and now considering 70/136 (removed 66) transitions.
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:30:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:14] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:30:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:14] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-09 11:30:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:30:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/99 places, 70/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/99 places, 70/136 transitions.
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:14] [INFO ] Input system was already deterministic with 70 transitions.
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16798041542418491072.gal : 0 ms
[2022-06-09 11:30:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17167342981400624692.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/CTLFireability16798041542418491072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17167342981400624692.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,4626,0.058131,6976,2,1464,5,9933,6,0,314,6857,0


Converting to forward existential form...Done !
original formula: EF(EG(((s1<1)||(l335<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((s1<1)||(l335<1)))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/69
(forward)formula 0,1,0.242613,13816,1,0,18,37635,19,3,1636,23072,16
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 58 transition count 64
Applied a total of 90 rules in 18 ms. Remains 58 /99 variables (removed 41) and now considering 64/136 (removed 72) transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:14] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:30:14] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-06-09 11:30:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/99 places, 64/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/99 places, 64/136 transitions.
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 10 ms
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:14] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished Best-First random walk after 932 steps, including 40 resets, run visited all 1 properties in 3 ms. (steps per millisecond=310 )
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 77 transition count 95
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 63 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 62 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 62 transition count 71
Applied a total of 80 rules in 12 ms. Remains 62 /99 variables (removed 37) and now considering 71/136 (removed 65) transitions.
// Phase 1: matrix 71 rows 62 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:14] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 71 rows 62 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:30:14] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-06-09 11:30:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 62 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/99 places, 71/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/99 places, 71/136 transitions.
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:14] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:14] [INFO ] Input system was already deterministic with 71 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8325 steps, run visited all 1 properties in 17 ms. (steps per millisecond=489 )
Probabilistic random walk after 8325 steps, saw 3629 distinct states, run finished after 17 ms. (steps per millisecond=489 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 63 transition count 73
Applied a total of 77 rules in 28 ms. Remains 63 /99 variables (removed 36) and now considering 73/136 (removed 63) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:14] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:30:15] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-09 11:30:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:30:15] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:30:15] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/99 places, 73/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/99 places, 73/136 transitions.
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 9 ms
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:15] [INFO ] Input system was already deterministic with 73 transitions.
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 544 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7203 steps, run visited all 1 properties in 15 ms. (steps per millisecond=480 )
Probabilistic random walk after 7203 steps, saw 3196 distinct states, run finished after 15 ms. (steps per millisecond=480 ) properties seen :1
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 78 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 67 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 59 transition count 65
Applied a total of 88 rules in 13 ms. Remains 59 /99 variables (removed 40) and now considering 65/136 (removed 71) transitions.
// Phase 1: matrix 65 rows 59 cols
[2022-06-09 11:30:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:15] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 65 rows 59 cols
[2022-06-09 11:30:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:30:15] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-06-09 11:30:15] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 65 rows 59 cols
[2022-06-09 11:30:15] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:30:15] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/99 places, 65/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/99 places, 65/136 transitions.
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:15] [INFO ] Input system was already deterministic with 65 transitions.
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1188078111082448118.gal : 1 ms
[2022-06-09 11:30:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2018220311965835759.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/CTLFireability1188078111082448118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2018220311965835759.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,3440,0.062894,7216,2,1692,5,9736,6,0,301,6769,0


Converting to forward existential form...Done !
original formula: EG(AF(((s6<1)||(l0<1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((s6<1)||(l0<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...291
(forward)formula 0,1,0.338308,16896,1,0,140,46510,155,56,2077,34176,153
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 99
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 79 transition count 98
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 70 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 69 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 69 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 69 transition count 84
Applied a total of 64 rules in 3 ms. Remains 69 /99 variables (removed 30) and now considering 84/136 (removed 52) transitions.
// Phase 1: matrix 84 rows 69 cols
[2022-06-09 11:30:15] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 11:30:15] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 84 rows 69 cols
[2022-06-09 11:30:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:15] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:30:15] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 69 cols
[2022-06-09 11:30:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:15] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/99 places, 84/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/99 places, 84/136 transitions.
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 9 ms
[2022-06-09 11:30:15] [INFO ] Input system was already deterministic with 84 transitions.
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:15] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7735231473162763745.gal : 1 ms
[2022-06-09 11:30:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16639250437739337789.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/CTLFireability7735231473162763745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16639250437739337789.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,6731,0.143482,10272,2,2324,5,22141,6,0,360,15451,0


Converting to forward existential form...Done !
original formula: AF(((EG(!(E(EX(((s1>=1)&&(l116>=1))) U A(((s1>=1)&&(l510>=1)) U ((s1>=1)&&(l336>=1)))))) + AG(((s1<1)||(l509<1)))) + AG(AX(((s1<1)||(l504...163
=> equivalent forward existential formula: [FwdG(Init,!(((EG(!(E(EX(((s1>=1)&&(l116>=1))) U !((E(!(((s1>=1)&&(l336>=1))) U (!(((s1>=1)&&(l510>=1))) * !(((s...307
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t29, t49, t52, t53, t54, t61, t62, t63, t64, t65, t66, t67, t6...331
Using saturation style SCC detection
(forward)formula 0,1,1.85385,55356,1,0,456,261241,218,237,2551,206639,531
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 80 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 80 transition count 101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 72 transition count 93
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 72 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 72 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 70 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 69 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 68 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 68 transition count 81
Applied a total of 68 rules in 19 ms. Remains 68 /99 variables (removed 31) and now considering 81/136 (removed 55) transitions.
// Phase 1: matrix 81 rows 68 cols
[2022-06-09 11:30:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:17] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 81 rows 68 cols
[2022-06-09 11:30:17] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:30:18] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-06-09 11:30:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 68 cols
[2022-06-09 11:30:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:18] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/99 places, 81/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/99 places, 81/136 transitions.
[2022-06-09 11:30:18] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:18] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:18] [INFO ] Input system was already deterministic with 81 transitions.
[2022-06-09 11:30:18] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:18] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4897138608713027479.gal : 1 ms
[2022-06-09 11:30:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9212439887659074869.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/CTLFireability4897138608713027479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9212439887659074869.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,5557,0.12065,9952,2,2410,5,19016,6,0,353,12735,0


Converting to forward existential form...Done !
original formula: EF(!(A((AF(!(((s1<1)||(l124<1)))) + E((((s1>=1)&&(l491>=1))&&((s1>=1)&&(l133>=1))) U (((s1>=1)&&(l345>=1))||((s1>=1)&&(l502>=1))))) U EF(...179
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(TRUE U ((s9>=1)&&(l152>=1))))) * !((!(EG(!(!(((s1<1)||(l124<1)))))) + E((((s1>=1)&&...356
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t29, t46, t48, t49, t50, t53, t54, t55, t59, t60, t61,...349
(forward)formula 0,1,1.15107,42212,1,0,317,191413,199,138,2420,139734,359
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 79 transition count 99
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 79 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 69 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 66 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 64 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 61 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 83 place count 61 transition count 70
Applied a total of 83 rules in 4 ms. Remains 61 /99 variables (removed 38) and now considering 70/136 (removed 66) transitions.
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:30:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:19] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:30:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:30:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-09 11:30:19] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 70 rows 61 cols
[2022-06-09 11:30:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/99 places, 70/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/99 places, 70/136 transitions.
[2022-06-09 11:30:19] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:19] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:19] [INFO ] Input system was already deterministic with 70 transitions.
[2022-06-09 11:30:19] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:19] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:19] [INFO ] Time to serialize gal into /tmp/CTLFireability622134696727373613.gal : 1 ms
[2022-06-09 11:30:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14828683112235476394.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/CTLFireability622134696727373613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14828683112235476394.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,3850,0.069697,7412,2,1522,5,11347,6,0,314,7907,0


Converting to forward existential form...Done !
original formula: AX(AF((EG(((p27>=1)&&(l0>=1))) * AX(EG(((s1<1)||(l488<1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((EG(((p27>=1)&&(l0>=1))) * !(EX(!(EG(((s1<1)||(l488<1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t42, t43, t44, t45, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...306
(forward)formula 0,0,0.713923,28100,1,0,238,112022,169,101,2187,91353,276
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 81 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 81 transition count 104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 73 transition count 96
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 73 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 71 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 69 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 68 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 68 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 68 transition count 86
Applied a total of 65 rules in 9 ms. Remains 68 /99 variables (removed 31) and now considering 86/136 (removed 50) transitions.
// Phase 1: matrix 86 rows 68 cols
[2022-06-09 11:30:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:20] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 86 rows 68 cols
[2022-06-09 11:30:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:20] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 11:30:20] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 86 rows 68 cols
[2022-06-09 11:30:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:20] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/99 places, 86/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/99 places, 86/136 transitions.
[2022-06-09 11:30:20] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:20] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:20] [INFO ] Input system was already deterministic with 86 transitions.
[2022-06-09 11:30:20] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:20] [INFO ] Flatten gal took : 4 ms
[2022-06-09 11:30:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7598411434810936275.gal : 1 ms
[2022-06-09 11:30:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3925260724215580842.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/CTLFireability7598411434810936275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3925260724215580842.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,5556,0.083336,8008,2,1543,5,14268,6,0,358,8203,0


Converting to forward existential form...Done !
original formula: AF(((!(E(((s1>=1)&&(l505>=1)) U !(((p20>=1)&&(l115>=1))))) * EF((!(A(((s1>=1)&&(l33>=1)) U ((s8>=1)&&(l151>=1)))) * AX(((s1<1)||(l488<1))...258
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(((s1>=1)&&(l505>=1)) U !(((p20>=1)&&(l115>=1))))) * E(TRUE U (!(!((E(!(((s8>=1)&&(l151>=1))) ...396
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t43, t44, t45, t46, t47, t48, t55, t56, t57, t58, t60, t64,...359
(forward)formula 0,0,1.15203,43096,1,0,429,187983,222,216,2495,171534,487
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 136/136 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 81 transition count 104
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 81 transition count 104
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 71 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 71 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 71 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 68 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 66 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 66 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 63 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 63 transition count 76
Applied a total of 78 rules in 8 ms. Remains 63 /99 variables (removed 36) and now considering 76/136 (removed 60) transitions.
// Phase 1: matrix 76 rows 63 cols
[2022-06-09 11:30:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:30:21] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 76 rows 63 cols
[2022-06-09 11:30:21] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:30:21] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-06-09 11:30:21] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 63 cols
[2022-06-09 11:30:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:30:21] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/99 places, 76/136 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/99 places, 76/136 transitions.
[2022-06-09 11:30:21] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:21] [INFO ] Flatten gal took : 3 ms
[2022-06-09 11:30:21] [INFO ] Input system was already deterministic with 76 transitions.
[2022-06-09 11:30:21] [INFO ] Flatten gal took : 2 ms
[2022-06-09 11:30:21] [INFO ] Flatten gal took : 2 ms
[2022-06-09 11:30:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14130456897862751610.gal : 1 ms
[2022-06-09 11:30:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13155842402314542583.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/CTLFireability14130456897862751610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13155842402314542583.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,3927,0.080569,7724,2,1939,5,12332,6,0,328,8578,0


Converting to forward existential form...Done !
original formula: EX((A((AG(((s1>=1)&&(l133>=1))) * !(((s1>=1)&&(l150>=1)))) U AF(((s2>=1)&&(l497>=1)))) + EF(AG(((p24>=1)&&(l0>=1))))))
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(!(EG(!(((s2>=1)&&(l497>=1))))))))) * !(E(!(!(EG(!(((s2>=1)&&(l497>=1)))))) U (!((!(E(TRUE ...334
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t48, t54, t5...356
Using saturation style SCC detection
(forward)formula 0,0,0.765538,31000,1,0,236,124087,192,114,2294,95637,294
FORMULA DBSingleClientW-PT-d0m04-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2022-06-09 11:30:22] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:30:22] [INFO ] Flatten gal took : 5 ms
Total runtime 21735 ms.

BK_STOP 1654774222662

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="DBSingleClientW-PT-d0m04"
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 DBSingleClientW-PT-d0m04, 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 r312-tall-165472281800130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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