Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102100312.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SemanticWebServices-PT-S064P09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102100312
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 102K May 18 16:43 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 SemanticWebServices-PT-S064P09-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716878752052

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S064P09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 06:45:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:45:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:45:53] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-28 06:45:53] [INFO ] Transformed 100 places.
[2024-05-28 06:45:53] [INFO ] Transformed 164 transitions.
[2024-05-28 06:45:53] [INFO ] Parsed PT model containing 100 places and 164 transitions and 719 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 82/82 transitions.
Ensure Unique test removed 18 places
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 61 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 57 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 57 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 57 transition count 64
Applied a total of 59 rules in 14 ms. Remains 57 /98 variables (removed 41) and now considering 64/82 (removed 18) transitions.
[2024-05-28 06:45:54] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
// Phase 1: matrix 55 rows 57 cols
[2024-05-28 06:45:54] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 06:45:54] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-28 06:45:54] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 06:45:54] [INFO ] Invariant cache hit.
[2024-05-28 06:45:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 06:45:54] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-28 06:45:54] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 06:45:54] [INFO ] Invariant cache hit.
[2024-05-28 06:45:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/98 places, 64/82 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 57/98 places, 64/82 transitions.
Support contains 41 out of 57 places after structural reductions.
[2024-05-28 06:45:54] [INFO ] Flatten gal took : 20 ms
[2024-05-28 06:45:54] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:45:54] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 29) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-28 06:45:54] [INFO ] Flow matrix only has 55 transitions (discarded 9 similar events)
[2024-05-28 06:45:54] [INFO ] Invariant cache hit.
[2024-05-28 06:45:54] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 06:45:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-28 06:45:55] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 37 transition count 51
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 19 place count 28 transition count 42
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 28 transition count 42
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 19 transition count 33
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 19 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 14 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 14 transition count 25
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 14 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 24 edges and 13 vertex of which 12 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 12 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 71 place count 10 transition count 15
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 74 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 75 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 76 place count 9 transition count 12
Applied a total of 76 rules in 15 ms. Remains 9 /57 variables (removed 48) and now considering 12/64 (removed 52) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-28 06:45:55] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 06:45:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 06:45:55] [INFO ] Invariant cache hit.
[2024-05-28 06:45:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 06:45:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-28 06:45:55] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 06:45:55] [INFO ] Invariant cache hit.
[2024-05-28 06:45:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/57 places, 12/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 9/57 places, 12/64 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 350 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 3 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-03 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G((p1 U p2))))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 43 transition count 54
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 36 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 36 transition count 47
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 30 transition count 41
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 30 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 30 transition count 39
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 27 transition count 36
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 27 transition count 36
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 27 transition count 33
Applied a total of 61 rules in 8 ms. Remains 27 /57 variables (removed 30) and now considering 33/64 (removed 31) transitions.
[2024-05-28 06:45:55] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 27 cols
[2024-05-28 06:45:55] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 06:45:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 06:45:55] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-05-28 06:45:55] [INFO ] Invariant cache hit.
[2024-05-28 06:45:55] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-28 06:45:55] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 06:45:55] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
[2024-05-28 06:45:55] [INFO ] Invariant cache hit.
[2024-05-28 06:45:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/57 places, 33/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 27/57 places, 33/64 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(LEQ s4 0), p1:(LEQ 2 s6), p0:(LEQ s20 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-04 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p1 U p2))))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 47 transition count 58
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 39 transition count 50
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 39 transition count 50
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 32 transition count 43
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 32 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 32 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 29 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 29 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 29 transition count 34
Applied a total of 58 rules in 3 ms. Remains 29 /57 variables (removed 28) and now considering 34/64 (removed 30) transitions.
[2024-05-28 06:45:56] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 29 cols
[2024-05-28 06:45:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 06:45:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 06:45:56] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-28 06:45:56] [INFO ] Invariant cache hit.
[2024-05-28 06:45:56] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 06:45:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-28 06:45:56] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-28 06:45:56] [INFO ] Invariant cache hit.
[2024-05-28 06:45:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/57 places, 34/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 29/57 places, 34/64 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s24), p2:(LEQ s21 s9), p1:(LEQ s8 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8 reset in 104 ms.
Product exploration explored 100000 steps with 3 reset in 209 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 294 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Finished random walk after 3339 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=667 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 1 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
[2024-05-28 06:45:58] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-28 06:45:58] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1))))), (X (X p0)), (X (X (NOT p0))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 309 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-08 finished in 1964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 37 transition count 51
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 30 transition count 44
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 30 transition count 44
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 24 transition count 38
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 24 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 24 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 21 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 21 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 21 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 21 transition count 29
Graph (complete) has 44 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 20 transition count 28
Applied a total of 50 rules in 15 ms. Remains 20 /57 variables (removed 37) and now considering 28/64 (removed 36) transitions.
[2024-05-28 06:45:58] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 20 cols
[2024-05-28 06:45:58] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 06:45:58] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 06:45:58] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-28 06:45:58] [INFO ] Invariant cache hit.
[2024-05-28 06:45:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 06:45:58] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-28 06:45:58] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-28 06:45:58] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-28 06:45:58] [INFO ] Invariant cache hit.
[2024-05-28 06:45:58] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/57 places, 28/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 20/57 places, 28/64 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s13 s7), p1:(LEQ 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-09 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 41 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 18 place count 30 transition count 43
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 30 transition count 43
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 22 transition count 35
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 22 transition count 35
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 22 transition count 32
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 18 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 18 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 18 transition count 24
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 18 transition count 21
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 40 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 14 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 13 transition count 18
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 13 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 12 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 72 place count 12 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 75 place count 10 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 76 place count 10 transition count 12
Applied a total of 76 rules in 18 ms. Remains 10 /57 variables (removed 47) and now considering 12/64 (removed 52) transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-05-28 06:45:58] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 06:45:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 06:45:58] [INFO ] Invariant cache hit.
[2024-05-28 06:45:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 06:45:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 06:45:58] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 06:45:58] [INFO ] Invariant cache hit.
[2024-05-28 06:45:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/57 places, 12/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 10/57 places, 12/64 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 168 ms.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-28 06:45:59] [INFO ] Invariant cache hit.
[2024-05-28 06:45:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 06:45:59] [INFO ] Invariant cache hit.
[2024-05-28 06:45:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 06:45:59] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 06:45:59] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 06:45:59] [INFO ] Invariant cache hit.
[2024-05-28 06:45:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 10/10 places, 12/12 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 40 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Built C files in :
/tmp/ltsmin3759115780113470748
[2024-05-28 06:46:00] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-28 06:46:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:46:00] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-28 06:46:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:46:00] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-28 06:46:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:46:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3759115780113470748
Running compilation step : cd /tmp/ltsmin3759115780113470748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin3759115780113470748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3759115780113470748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13588192212988639801.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-28 06:46:15] [INFO ] Invariant cache hit.
[2024-05-28 06:46:15] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 06:46:15] [INFO ] Invariant cache hit.
[2024-05-28 06:46:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 06:46:15] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-28 06:46:15] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 06:46:15] [INFO ] Invariant cache hit.
[2024-05-28 06:46:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 10/10 places, 12/12 transitions.
Built C files in :
/tmp/ltsmin6725599137545681709
[2024-05-28 06:46:15] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-28 06:46:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:46:15] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-28 06:46:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:46:15] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-28 06:46:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:46:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6725599137545681709
Running compilation step : cd /tmp/ltsmin6725599137545681709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin6725599137545681709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6725599137545681709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13913104572286715769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 06:46:31] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:46:31] [INFO ] Flatten gal took : 1 ms
[2024-05-28 06:46:31] [INFO ] Time to serialize gal into /tmp/LTL14929526177106781632.gal : 1 ms
[2024-05-28 06:46:31] [INFO ] Time to serialize properties into /tmp/LTL4483347866337553288.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14929526177106781632.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6875697942945352581.hoa' '-atoms' '/tmp/LTL4483347866337553288.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4483347866337553288.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6875697942945352581.hoa
Detected timeout of ITS tools.
[2024-05-28 06:46:46] [INFO ] Flatten gal took : 0 ms
[2024-05-28 06:46:46] [INFO ] Flatten gal took : 0 ms
[2024-05-28 06:46:46] [INFO ] Time to serialize gal into /tmp/LTL2700082634260589383.gal : 1 ms
[2024-05-28 06:46:46] [INFO ] Time to serialize properties into /tmp/LTL816152278394068241.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2700082634260589383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL816152278394068241.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F("(p17<=p51)"))))
Formula 0 simplified : FG!"(p17<=p51)"
Detected timeout of ITS tools.
[2024-05-28 06:47:01] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:47:01] [INFO ] Applying decomposition
[2024-05-28 06:47:01] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3673300563009121524.txt' '-o' '/tmp/graph3673300563009121524.bin' '-w' '/tmp/graph3673300563009121524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3673300563009121524.bin' '-l' '-1' '-v' '-w' '/tmp/graph3673300563009121524.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:47:01] [INFO ] Decomposing Gal with order
[2024-05-28 06:47:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:47:01] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-28 06:47:01] [INFO ] Flatten gal took : 32 ms
[2024-05-28 06:47:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2024-05-28 06:47:01] [INFO ] Time to serialize gal into /tmp/LTL14279157476086278038.gal : 1 ms
[2024-05-28 06:47:01] [INFO ] Time to serialize properties into /tmp/LTL14465894419063076747.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14279157476086278038.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14465894419063076747.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu2.p17<=gu2.p51)"))))
Formula 0 simplified : FG!"(gu2.p17<=gu2.p51)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6127531076648820187
[2024-05-28 06:47:16] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6127531076648820187
Running compilation step : cd /tmp/ltsmin6127531076648820187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin6127531076648820187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin6127531076648820187;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-10 finished in 92710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(X(p0)) U ((!p0 U p1) U p2))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 44 transition count 55
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 36 transition count 47
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 36 transition count 47
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 28 transition count 39
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 28 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 26 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 26 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 26 transition count 32
Applied a total of 63 rules in 11 ms. Remains 26 /57 variables (removed 31) and now considering 32/64 (removed 32) transitions.
[2024-05-28 06:47:31] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2024-05-28 06:47:31] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 06:47:31] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 06:47:31] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 06:47:31] [INFO ] Invariant cache hit.
[2024-05-28 06:47:31] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 06:47:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-28 06:47:31] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 06:47:31] [INFO ] Invariant cache hit.
[2024-05-28 06:47:31] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/57 places, 32/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 26/57 places, 32/64 transitions.
Stuttering acceptance computed with spot in 230 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=2 dest: 4}], [{ cond=p2, acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 1}]], initial=0, aps=[p2:(LEQ 3 s11), p0:(GT s15 s21), p1:(LEQ s1 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 470 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 8) seen :4
Finished Best-First random walk after 3414 steps, including 1 resets, run visited all 4 properties in 3 ms. (steps per millisecond=1138 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND p2 p0)), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p2)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 12 factoid took 600 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 260 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 06:47:34] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 06:47:34] [INFO ] Invariant cache hit.
[2024-05-28 06:47:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 06:47:34] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 06:47:34] [INFO ] Invariant cache hit.
[2024-05-28 06:47:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 06:47:34] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-28 06:47:34] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-28 06:47:34] [INFO ] Invariant cache hit.
[2024-05-28 06:47:34] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 26/26 places, 32/32 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 344 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Finished Best-First random walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND p2 p0)), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p1 p2)), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 12 factoid took 597 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 232 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 296 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 5 reset in 86 ms.
Product exploration explored 100000 steps with 1 reset in 104 ms.
Applying partial POR strategy [false, true, false, false, false, true]
Stuttering acceptance computed with spot in 237 ms :[p2, (AND p2 p0), (AND p1 p2), p2, (AND p1 p2), (AND p2 p0 p1)]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 32/32 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 8 ms. Remains 26 /26 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-28 06:47:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 06:47:36] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 26 cols
[2024-05-28 06:47:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 06:47:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 32/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 26/26 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin5924832979977397931
[2024-05-28 06:47:36] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5924832979977397931
Running compilation step : cd /tmp/ltsmin5924832979977397931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin5924832979977397931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5924832979977397931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12847401396912606445.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-11 finished in 5815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 45 transition count 56
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 37 transition count 48
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 37 transition count 48
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 29 transition count 40
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 29 transition count 40
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 29 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 25 transition count 33
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 25 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 25 transition count 29
Applied a total of 67 rules in 3 ms. Remains 25 /57 variables (removed 32) and now considering 29/64 (removed 35) transitions.
[2024-05-28 06:47:37] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-05-28 06:47:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 06:47:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 06:47:37] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-05-28 06:47:37] [INFO ] Invariant cache hit.
[2024-05-28 06:47:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-28 06:47:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-28 06:47:37] [INFO ] Flow matrix only has 27 transitions (discarded 2 similar events)
[2024-05-28 06:47:37] [INFO ] Invariant cache hit.
[2024-05-28 06:47:37] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/57 places, 29/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 25/57 places, 29/64 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s21), p1:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-12 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 40 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 37 transition count 52
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 29 transition count 44
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 29 transition count 44
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 22 transition count 37
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 22 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 22 transition count 34
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 19 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 19 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 19 transition count 28
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 54 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 33 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 17 transition count 24
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 16 transition count 22
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 15 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 15 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 15 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 15 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 64 place count 14 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 65 place count 14 transition count 18
Applied a total of 65 rules in 10 ms. Remains 14 /57 variables (removed 43) and now considering 18/64 (removed 46) transitions.
Normalized transition count is 17 out of 18 initially.
// Phase 1: matrix 17 rows 14 cols
[2024-05-28 06:47:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 06:47:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 06:47:37] [INFO ] Invariant cache hit.
[2024-05-28 06:47:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 06:47:37] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-28 06:47:37] [INFO ] Redundant transitions in 17 ms returned [4]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-05-28 06:47:37] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 06:47:37] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/57 places, 17/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 14/57 places, 17/64 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s11 s7), p0:(LEQ 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-13 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p0&&X(p0)&&F(p1))||X(G(p0)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 43 transition count 54
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 37 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 37 transition count 48
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 31 transition count 42
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 31 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 30 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 30 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 30 transition count 37
Applied a total of 54 rules in 5 ms. Remains 30 /57 variables (removed 27) and now considering 37/64 (removed 27) transitions.
[2024-05-28 06:47:37] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 30 cols
[2024-05-28 06:47:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 06:47:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 06:47:37] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-28 06:47:37] [INFO ] Invariant cache hit.
[2024-05-28 06:47:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-28 06:47:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-28 06:47:37] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-28 06:47:37] [INFO ] Invariant cache hit.
[2024-05-28 06:47:37] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 30/57 places, 37/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 30/57 places, 37/64 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(GT 2 s7), p1:(GT s12 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25244 steps with 8525 reset in 39 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-14 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(!p0)))&&((p1 U p2) U (p3||F(p4)))))'
Support contains 9 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 139 edges and 57 vertex of which 42 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 40 transition count 54
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 33 transition count 47
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 33 transition count 47
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 27 transition count 41
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 27 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 27 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 23 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 23 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 23 transition count 32
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 37 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 21 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 20 transition count 26
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 58 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 19 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 19 transition count 22
Applied a total of 60 rules in 8 ms. Remains 19 /57 variables (removed 38) and now considering 22/64 (removed 42) transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-05-28 06:47:38] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 06:47:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 06:47:38] [INFO ] Invariant cache hit.
[2024-05-28 06:47:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 06:47:38] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-28 06:47:38] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-28 06:47:38] [INFO ] Invariant cache hit.
[2024-05-28 06:47:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/57 places, 22/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 19/57 places, 22/64 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR p0 (AND (NOT p3) (NOT p4))), p0, (NOT p4), (AND (NOT p2) (NOT p4)), (AND (NOT p3) (NOT p4)), p0, true]
Running random walk in product with property : SemanticWebServices-PT-S064P09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p4) p2) (AND (NOT p3) (NOT p4) p1)), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p4) p2) (AND (NOT p3) (NOT p4) p1)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT s0 s5), p3:(LEQ 1 s10), p4:(LEQ s1 s15), p2:(LEQ s3 s14), p1:(LEQ s12 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P09-LTLCardinality-15 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-28 06:47:38] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
[2024-05-28 06:47:38] [INFO ] Applying decomposition
[2024-05-28 06:47:38] [INFO ] Flatten gal took : 4 ms
Built C files in :
/tmp/ltsmin12094495082535549528
[2024-05-28 06:47:38] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-28 06:47:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:47:38] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-28 06:47:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:47:38] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-28 06:47:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:47:38] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12094495082535549528
Running compilation step : cd /tmp/ltsmin12094495082535549528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11893971323048537411.txt' '-o' '/tmp/graph11893971323048537411.bin' '-w' '/tmp/graph11893971323048537411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11893971323048537411.bin' '-l' '-1' '-v' '-w' '/tmp/graph11893971323048537411.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:47:38] [INFO ] Decomposing Gal with order
[2024-05-28 06:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:47:38] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-28 06:47:38] [INFO ] Flatten gal took : 23 ms
[2024-05-28 06:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 3 ms.
[2024-05-28 06:47:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality16340146519918631298.gal : 13 ms
[2024-05-28 06:47:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality3552681116841460297.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16340146519918631298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3552681116841460297.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
Compilation finished in 193 ms.
Running link step : cd /tmp/ltsmin12094495082535549528;'gcc' '-shared' '-o' 'gal.so' 'model.o'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu5.p17<=gu5.p51)"))))
Formula 0 simplified : FG!"(gu5.p17<=gu5.p51)"
Link finished in 129 ms.
Running LTSmin : cd /tmp/ltsmin12094495082535549528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 0.016: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.016: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.024: Initializing POR dependencies: labels 65, guards 64
pins2lts-mc-linux64( 5/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.043: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.050: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.050: State length is 58, there are 67 groups
pins2lts-mc-linux64( 0/ 8), 0.050: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.050: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.050: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.050: Visible groups: 0 / 67, labels: 1 / 67
pins2lts-mc-linux64( 0/ 8), 0.050: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.050: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.068: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 3/ 8), 0.178: [Blue] ~240 levels ~1920 states ~1920 transitions
pins2lts-mc-linux64( 1/ 8), 0.282: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 6/ 8), 0.435: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 6/ 8), 0.695: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 6/ 8), 1.246: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 4/ 8), 2.504: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 1/ 8), 3.859: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 6/ 8), 5.648: [Blue] ~30720 levels ~245760 states ~245760 transitions
pins2lts-mc-linux64( 0/ 8), 8.525: [Blue] ~61440 levels ~491520 states ~491520 transitions
pins2lts-mc-linux64( 1/ 8), 12.261: [Blue] ~122880 levels ~983040 states ~983040 transitions
pins2lts-mc-linux64( 0/ 8), 14.579: [Blue] ~245760 levels ~1966080 states ~1966080 transitions
pins2lts-mc-linux64( 1/ 8), 14.579: [Blue] ~245760 levels ~3932160 states ~1966080 transitions
pins2lts-mc-linux64( 5/ 8), 26.456: [Blue] ~983040 levels ~7864320 states ~7864320 transitions
pins2lts-mc-linux64( 7/ 8), 42.067: [Blue] ~1966080 levels ~15728640 states ~15728640 transitions
pins2lts-mc-linux64( 0/ 8), 85.506: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 86.847:
pins2lts-mc-linux64( 0/ 8), 86.847: Explored 28338861 states 28338921 transitions, fanout: 1.000
pins2lts-mc-linux64( 0/ 8), 86.847: Total exploration time 86.760 sec (85.420 sec minimum, 86.101 sec on average)
pins2lts-mc-linux64( 0/ 8), 86.847: States per second: 326635, Transitions per second: 326636
pins2lts-mc-linux64( 0/ 8), 86.847:
pins2lts-mc-linux64( 0/ 8), 86.847: State space has 3542364 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 86.847: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 86.847: blue states: 28338861 (800.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 86.847: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 86.847: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 86.847:
pins2lts-mc-linux64( 0/ 8), 86.847: Total memory used for local state coloring: 432.4MB
pins2lts-mc-linux64( 0/ 8), 86.847:
pins2lts-mc-linux64( 0/ 8), 86.847: Queue width: 8B, total height: 28338861, memory: 216.21MB
pins2lts-mc-linux64( 0/ 8), 86.847: Tree memory: 283.0MB, 83.8 B/state, compr.: 35.8%
pins2lts-mc-linux64( 0/ 8), 86.847: Tree fill ratio (roots/leafs): 2.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 86.847: Stored 64 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 86.847: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 86.847: Est. total memory use: 499.2MB (~1240.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12094495082535549528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12094495082535549528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 07:08:14] [INFO ] Flatten gal took : 3 ms
[2024-05-28 07:08:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality9371104339616221641.gal : 1 ms
[2024-05-28 07:08:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality13513544723012174301.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9371104339616221641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13513544723012174301.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(p17<=p51)"))))
Formula 0 simplified : FG!"(p17<=p51)"
Detected timeout of ITS tools.
[2024-05-28 07:28:49] [INFO ] Flatten gal took : 5 ms
[2024-05-28 07:28:49] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-28 07:28:49] [INFO ] Transformed 57 places.
[2024-05-28 07:28:49] [INFO ] Transformed 64 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 07:28:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality17088326691763406365.gal : 1 ms
[2024-05-28 07:28:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality5291600296815887614.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17088326691763406365.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5291600296815887614.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p17<=p51)"))))
Formula 0 simplified : FG!"(p17<=p51)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2089324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039616 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SemanticWebServices-PT-S064P09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SemanticWebServices-PT-S064P09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r351-tall-171679102100312"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P09.tgz
mv SemanticWebServices-PT-S064P09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;