Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 6.5K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 23:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 141K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652629730669

Running Version 202205111006
[2022-05-15 15:48:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 15:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:48:52] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-15 15:48:52] [INFO ] Transformed 567 places.
[2022-05-15 15:48:52] [INFO ] Transformed 508 transitions.
[2022-05-15 15:48:52] [INFO ] Found NUPN structural information;
[2022-05-15 15:48:52] [INFO ] Parsed PT model containing 567 places and 508 transitions in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-11-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 76 place count 484 transition count 429
Iterating global reduction 1 with 72 rules applied. Total rules applied 148 place count 484 transition count 429
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 185 place count 447 transition count 392
Iterating global reduction 1 with 37 rules applied. Total rules applied 222 place count 447 transition count 392
Applied a total of 222 rules in 107 ms. Remains 447 /560 variables (removed 113) and now considering 392/501 (removed 109) transitions.
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:52] [INFO ] Computed 91 place invariants in 30 ms
[2022-05-15 15:48:52] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:52] [INFO ] Computed 91 place invariants in 14 ms
[2022-05-15 15:48:53] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:53] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-15 15:48:53] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/560 places, 392/501 transitions.
Finished structural reductions, in 1 iterations. Remains : 447/560 places, 392/501 transitions.
Support contains 42 out of 447 places after structural reductions.
[2022-05-15 15:48:53] [INFO ] Flatten gal took : 60 ms
[2022-05-15 15:48:53] [INFO ] Flatten gal took : 27 ms
[2022-05-15 15:48:53] [INFO ] Input system was already deterministic with 392 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 26) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 392 rows 447 cols
[2022-05-15 15:48:54] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-15 15:48:54] [INFO ] [Real]Absence check using 49 positive place invariants in 16 ms returned sat
[2022-05-15 15:48:54] [INFO ] [Real]Absence check using 49 positive and 42 generalized place invariants in 36 ms returned sat
[2022-05-15 15:48:54] [INFO ] After 211ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:14
[2022-05-15 15:48:55] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 5 ms to minimize.
[2022-05-15 15:48:55] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2022-05-15 15:48:55] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 1 ms to minimize.
[2022-05-15 15:48:55] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2022-05-15 15:48:55] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 1 ms to minimize.
[2022-05-15 15:48:55] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 0 ms to minimize.
[2022-05-15 15:48:55] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 1 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 1 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 1 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2022-05-15 15:48:56] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 1 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 0 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:48:57] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 0 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 1 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-05-15 15:48:58] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 0 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2022-05-15 15:48:59] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 0 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:49:00] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 1 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 3 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 0 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 0 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 0 ms to minimize.
[2022-05-15 15:49:01] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 7003 ms
[2022-05-15 15:49:02] [INFO ] After 7252ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 15:49:02] [INFO ] After 7527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-15 15:49:02] [INFO ] [Nat]Absence check using 49 positive place invariants in 18 ms returned sat
[2022-05-15 15:49:02] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 15 ms returned sat
[2022-05-15 15:49:02] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :10
[2022-05-15 15:49:02] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:49:02] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2022-05-15 15:49:03] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 0 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 1 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 1 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 0 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 0 ms to minimize.
[2022-05-15 15:49:04] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 0 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 0 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2022-05-15 15:49:05] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-05-15 15:49:06] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 0 ms to minimize.
[2022-05-15 15:49:06] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3363 ms
[2022-05-15 15:49:06] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-15 15:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2022-05-15 15:49:06] [INFO ] After 4159ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :10
Attempting to minimize the solution found.
Minimization took 282 ms.
[2022-05-15 15:49:06] [INFO ] After 4788ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :10
Fused 15 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 179 ms.
Support contains 17 out of 447 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 447/447 places, 392/392 transitions.
Graph (complete) has 1003 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 446 transition count 344
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 399 transition count 342
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 397 transition count 342
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 99 place count 397 transition count 253
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 294 place count 291 transition count 253
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 298 place count 287 transition count 249
Iterating global reduction 3 with 4 rules applied. Total rules applied 302 place count 287 transition count 249
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 523 place count 175 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 524 place count 175 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 525 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 526 place count 174 transition count 138
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 534 place count 174 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 535 place count 173 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 536 place count 172 transition count 137
Applied a total of 536 rules in 88 ms. Remains 172 /447 variables (removed 275) and now considering 137/392 (removed 255) transitions.
Finished structural reductions, in 1 iterations. Remains : 172/447 places, 137/392 transitions.
Incomplete random walk after 10000 steps, including 837 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 224 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 263 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 194 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 244 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 223 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Probably explored full state space saw : 37778 states, properties seen :9
Probabilistic random walk after 156433 steps, saw 37778 distinct states, run finished after 457 ms. (steps per millisecond=342 ) properties seen :9
Explored full state space saw : 37778 states, properties seen :0
Exhaustive walk after 156433 steps, saw 37778 distinct states, run finished after 335 ms. (steps per millisecond=466 ) properties seen :0
FORMULA BusinessProcesses-PT-11-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-11-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-11-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 432 stabilizing places and 377 stable transitions
Graph (complete) has 1003 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
FORMULA BusinessProcesses-PT-11-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 439 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 439 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 438 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 35 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:09] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-15 15:49:09] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:09] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-15 15:49:09] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:09] [INFO ] Computed 91 place invariants in 8 ms
[2022-05-15 15:49:10] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/447 places, 383/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s310 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Computed a total of 423 stabilizing places and 368 stable transitions
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 423 stabilizing places and 368 stable transitions
Detected a total of 423/438 stabilizing places and 368/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-02 finished in 1881 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0)||p1))))'
Support contains 6 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 439 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 439 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 438 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 26 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:11] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-15 15:49:11] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:11] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-15 15:49:11] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:11] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-15 15:49:11] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/447 places, 383/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s430 1) (EQ s433 1) (EQ s436 1)), p1:(AND (EQ s37 1) (EQ s248 1) (EQ s399 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-03 finished in 954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((F(p0) U p1))))||G(p0)))'
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 439 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 439 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 438 transition count 383
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 438 transition count 383
Applied a total of 18 rules in 27 ms. Remains 438 /447 variables (removed 9) and now considering 383/392 (removed 9) transitions.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:12] [INFO ] Computed 91 place invariants in 7 ms
[2022-05-15 15:49:12] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:12] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-15 15:49:12] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
// Phase 1: matrix 383 rows 438 cols
[2022-05-15 15:49:12] [INFO ] Computed 91 place invariants in 7 ms
[2022-05-15 15:49:12] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 438/447 places, 383/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 438/447 places, 383/392 transitions.
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s388 1), p1:(AND (EQ s61 1) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-05 finished in 1273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 205 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 997 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 440 transition count 334
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 390 transition count 334
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 102 place count 390 transition count 241
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 306 place count 279 transition count 241
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 313 place count 272 transition count 234
Iterating global reduction 2 with 7 rules applied. Total rules applied 320 place count 272 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 320 place count 272 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 271 transition count 233
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 541 place count 160 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 543 place count 159 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 158 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 545 place count 157 transition count 128
Applied a total of 545 rules in 72 ms. Remains 157 /447 variables (removed 290) and now considering 128/392 (removed 264) transitions.
// Phase 1: matrix 128 rows 157 cols
[2022-05-15 15:49:13] [INFO ] Computed 69 place invariants in 2 ms
[2022-05-15 15:49:13] [INFO ] Implicit Places using invariants in 111 ms returned [40, 41, 46, 47, 48, 49, 50, 51, 52]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 113 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/447 places, 128/392 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 148/447 places, 128/392 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s80 1) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-07 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U !p1)))'
Support contains 7 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 440 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 439 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 439 transition count 384
Applied a total of 16 rules in 24 ms. Remains 439 /447 variables (removed 8) and now considering 384/392 (removed 8) transitions.
// Phase 1: matrix 384 rows 439 cols
[2022-05-15 15:49:13] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-15 15:49:13] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 384 rows 439 cols
[2022-05-15 15:49:13] [INFO ] Computed 91 place invariants in 6 ms
[2022-05-15 15:49:14] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
// Phase 1: matrix 384 rows 439 cols
[2022-05-15 15:49:14] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-15 15:49:14] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/447 places, 384/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 439/447 places, 384/392 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p0, (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s254 1), p1:(OR (NOT (AND (EQ s190 1) (EQ s340 1) (EQ s400 1))) (AND (EQ s85 1) (EQ s258 1) (EQ s366 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Computed a total of 424 stabilizing places and 369 stable transitions
Graph (complete) has 993 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 424 stabilizing places and 369 stable transitions
Detected a total of 424/439 stabilizing places and 369/384 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-11-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-08 finished in 1768 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X((G(p0)&&p1)))))))'
Support contains 2 out of 447 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Graph (trivial) has 204 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 997 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 440 transition count 335
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 391 transition count 335
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 100 place count 391 transition count 241
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 306 place count 279 transition count 241
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 313 place count 272 transition count 234
Iterating global reduction 2 with 7 rules applied. Total rules applied 320 place count 272 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 320 place count 272 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 271 transition count 233
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 543 place count 159 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 545 place count 158 transition count 128
Applied a total of 545 rules in 44 ms. Remains 158 /447 variables (removed 289) and now considering 128/392 (removed 264) transitions.
// Phase 1: matrix 128 rows 158 cols
[2022-05-15 15:49:15] [INFO ] Computed 70 place invariants in 3 ms
[2022-05-15 15:49:15] [INFO ] Implicit Places using invariants in 101 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 101 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/447 places, 128/392 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 140/447 places, 128/392 transitions.
Stuttering acceptance computed with spot in 39 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s104 0), p1:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21652 reset in 329 ms.
Stuttering criterion allowed to conclude after 82593 steps with 17926 reset in 261 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-09 finished in 791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (p1 U !X(((p2 U G(!p0))||p2)))))'
Support contains 5 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 440 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 440 transition count 385
Applied a total of 14 rules in 17 ms. Remains 440 /447 variables (removed 7) and now considering 385/392 (removed 7) transitions.
// Phase 1: matrix 385 rows 440 cols
[2022-05-15 15:49:16] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-15 15:49:16] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 385 rows 440 cols
[2022-05-15 15:49:16] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-15 15:49:16] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
// Phase 1: matrix 385 rows 440 cols
[2022-05-15 15:49:16] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-15 15:49:17] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 440/447 places, 385/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 440/447 places, 385/392 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (AND p0 p2), (NOT p0), p0]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s354 1), p0:(NEQ s310 1), p2:(AND (EQ s37 1) (EQ s237 1) (EQ s401 1))], nbAcceptance=0, 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 50000 reset in 348 ms.
Product exploration explored 100000 steps with 50000 reset in 349 ms.
Computed a total of 425 stabilizing places and 370 stable transitions
Graph (complete) has 995 edges and 440 vertex of which 439 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 425 stabilizing places and 370 stable transitions
Detected a total of 425/440 stabilizing places and 370/385 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 12 factoid took 207 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-11-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-15 finished in 2030 ms.
All properties solved by simple procedures.
Total runtime 26309 ms.

BK_STOP 1652629758280

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-11, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918500404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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