Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690500540.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 146K Mar 5 18:22 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-12-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678362607591

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 11:50:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:50:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:50:09] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-09 11:50:09] [INFO ] Transformed 586 places.
[2023-03-09 11:50:09] [INFO ] Transformed 525 transitions.
[2023-03-09 11:50:09] [INFO ] Found NUPN structural information;
[2023-03-09 11:50:09] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 81 place count 501 transition count 443
Iterating global reduction 1 with 78 rules applied. Total rules applied 159 place count 501 transition count 443
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 195 place count 465 transition count 407
Iterating global reduction 1 with 36 rules applied. Total rules applied 231 place count 465 transition count 407
Applied a total of 231 rules in 102 ms. Remains 465 /582 variables (removed 117) and now considering 407/521 (removed 114) transitions.
// Phase 1: matrix 407 rows 465 cols
[2023-03-09 11:50:10] [INFO ] Computed 95 place invariants in 25 ms
[2023-03-09 11:50:10] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-09 11:50:10] [INFO ] Invariant cache hit.
[2023-03-09 11:50:10] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2023-03-09 11:50:10] [INFO ] Invariant cache hit.
[2023-03-09 11:50:11] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 465/582 places, 407/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1258 ms. Remains : 465/582 places, 407/521 transitions.
Support contains 43 out of 465 places after structural reductions.
[2023-03-09 11:50:11] [INFO ] Flatten gal took : 52 ms
[2023-03-09 11:50:11] [INFO ] Flatten gal took : 30 ms
[2023-03-09 11:50:11] [INFO ] Input system was already deterministic with 407 transitions.
Support contains 40 out of 465 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-09 11:50:12] [INFO ] Invariant cache hit.
[2023-03-09 11:50:12] [INFO ] [Real]Absence check using 54 positive place invariants in 15 ms returned sat
[2023-03-09 11:50:12] [INFO ] [Real]Absence check using 54 positive and 41 generalized place invariants in 9 ms returned sat
[2023-03-09 11:50:12] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 11:50:12] [INFO ] [Nat]Absence check using 54 positive place invariants in 12 ms returned sat
[2023-03-09 11:50:12] [INFO ] [Nat]Absence check using 54 positive and 41 generalized place invariants in 9 ms returned sat
[2023-03-09 11:50:13] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :15
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 4 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 5 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2023-03-09 11:50:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 754 ms
[2023-03-09 11:50:13] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
[2023-03-09 11:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 11:50:14] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2023-03-09 11:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 11:50:14] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 4 ms to minimize.
[2023-03-09 11:50:14] [INFO ] Deduced a trap composed of 30 places in 353 ms of which 0 ms to minimize.
[2023-03-09 11:50:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 629 ms
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 2 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 519 ms
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-09 11:50:15] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 0 ms to minimize.
[2023-03-09 11:50:16] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 0 ms to minimize.
[2023-03-09 11:50:16] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 1 ms to minimize.
[2023-03-09 11:50:16] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 1 ms to minimize.
[2023-03-09 11:50:16] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 0 ms to minimize.
[2023-03-09 11:50:16] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2023-03-09 11:50:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 784 ms
[2023-03-09 11:50:16] [INFO ] After 3913ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :14
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-09 11:50:16] [INFO ] After 4524ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :14
Fused 19 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 142 ms.
Support contains 22 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (complete) has 1048 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 464 transition count 365
Reduce places removed 41 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 423 transition count 362
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 420 transition count 362
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 89 place count 420 transition count 267
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 295 place count 309 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 296 place count 308 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 308 transition count 266
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 528 place count 192 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 529 place count 192 transition count 150
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 4 with 2 rules applied. Total rules applied 531 place count 191 transition count 154
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 537 place count 191 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 538 place count 190 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 539 place count 189 transition count 153
Applied a total of 539 rules in 130 ms. Remains 189 /465 variables (removed 276) and now considering 153/407 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 189/465 places, 153/407 transitions.
Incomplete random walk after 10000 steps, including 892 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 225 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 223 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 230 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 226 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 245 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 237 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 232 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 224 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :1
Running SMT prover for 12 properties.
// Phase 1: matrix 153 rows 189 cols
[2023-03-09 11:50:18] [INFO ] Computed 77 place invariants in 3 ms
[2023-03-09 11:50:18] [INFO ] [Real]Absence check using 51 positive place invariants in 6 ms returned sat
[2023-03-09 11:50:18] [INFO ] [Real]Absence check using 51 positive and 26 generalized place invariants in 4 ms returned sat
[2023-03-09 11:50:18] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-09 11:50:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:50:18] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 11:50:18] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-09 11:50:18] [INFO ] [Nat]Absence check using 51 positive place invariants in 16 ms returned sat
[2023-03-09 11:50:18] [INFO ] [Nat]Absence check using 51 positive and 26 generalized place invariants in 4 ms returned sat
[2023-03-09 11:50:18] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-09 11:50:18] [INFO ] After 129ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 0 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 6 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2023-03-09 11:50:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 432 ms
[2023-03-09 11:50:19] [INFO ] After 1116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-09 11:50:20] [INFO ] After 1594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 3 properties in 32 ms.
Support contains 16 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 153/153 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 189 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 187 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 187 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 180 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 179 transition count 146
Applied a total of 16 rules in 28 ms. Remains 179 /189 variables (removed 10) and now considering 146/153 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 179/189 places, 146/153 transitions.
Incomplete random walk after 10000 steps, including 976 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 266 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 206 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Finished probabilistic random walk after 45592 steps, run visited all 9 properties in 136 ms. (steps per millisecond=335 )
Probabilistic random walk after 45592 steps, saw 11591 distinct states, run finished after 137 ms. (steps per millisecond=332 ) properties seen :9
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 450 stabilizing places and 392 stable transitions
Graph (complete) has 1048 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
FORMULA BusinessProcesses-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 6 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (complete) has 1048 edges and 465 vertex of which 464 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 463 transition count 359
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 417 transition count 357
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 415 transition count 357
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 97 place count 415 transition count 257
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 315 place count 297 transition count 257
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 322 place count 290 transition count 250
Iterating global reduction 3 with 7 rules applied. Total rules applied 329 place count 290 transition count 250
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 329 place count 290 transition count 249
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 289 transition count 249
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 569 place count 168 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 570 place count 168 transition count 131
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 4 with 2 rules applied. Total rules applied 572 place count 167 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 166 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 574 place count 165 transition count 134
Applied a total of 574 rules in 78 ms. Remains 165 /465 variables (removed 300) and now considering 134/407 (removed 273) transitions.
// Phase 1: matrix 134 rows 165 cols
[2023-03-09 11:50:21] [INFO ] Computed 72 place invariants in 4 ms
[2023-03-09 11:50:22] [INFO ] Implicit Places using invariants in 138 ms returned [34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 141 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/465 places, 134/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 154/465 places, 134/407 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s49 1) (EQ s130 1)), p1:(OR (EQ s32 0) (EQ s70 0) (EQ s128 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12065 reset in 427 ms.
Product exploration explored 100000 steps with 12070 reset in 315 ms.
Computed a total of 149 stabilizing places and 129 stable transitions
Computed a total of 149 stabilizing places and 129 stable transitions
Detected a total of 149/154 stabilizing places and 129/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1199 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 203 steps, run visited all 1 properties in 4 ms. (steps per millisecond=50 )
Probabilistic random walk after 203 steps, saw 104 distinct states, run finished after 5 ms. (steps per millisecond=40 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Support contains 3 out of 154 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 154 cols
[2023-03-09 11:50:23] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-09 11:50:23] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-09 11:50:23] [INFO ] Invariant cache hit.
[2023-03-09 11:50:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:50:23] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [34, 36, 38, 40, 45, 53, 55, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 321 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/154 places, 134/134 transitions.
Graph (complete) has 446 edges and 126 vertex of which 123 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 123 transition count 122
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 112 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 110 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 110 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 110 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 109 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 108 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 108 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 47 place count 99 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 98 transition count 109
Applied a total of 49 rules in 17 ms. Remains 98 /126 variables (removed 28) and now considering 109/134 (removed 25) transitions.
// Phase 1: matrix 109 rows 98 cols
[2023-03-09 11:50:23] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-09 11:50:24] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-09 11:50:24] [INFO ] Invariant cache hit.
[2023-03-09 11:50:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-09 11:50:24] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [5, 6, 7, 30, 31]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 278 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/154 places, 109/134 transitions.
Graph (complete) has 355 edges and 93 vertex of which 84 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 76 transition count 73
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 76 transition count 73
Applied a total of 17 rules in 5 ms. Remains 76 /93 variables (removed 17) and now considering 73/109 (removed 36) transitions.
// Phase 1: matrix 73 rows 76 cols
[2023-03-09 11:50:24] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-09 11:50:24] [INFO ] Implicit Places using invariants in 55 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 75/154 places, 73/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 685 ms. Remains : 75/154 places, 73/134 transitions.
Computed a total of 70 stabilizing places and 68 stable transitions
Computed a total of 70 stabilizing places and 68 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1239 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 318 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 153 steps, run visited all 1 properties in 4 ms. (steps per millisecond=38 )
Probabilistic random walk after 153 steps, saw 86 distinct states, run finished after 4 ms. (steps per millisecond=38 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1)]
Product exploration explored 100000 steps with 12310 reset in 146 ms.
Product exploration explored 100000 steps with 12339 reset in 138 ms.
Built C files in :
/tmp/ltsmin8468833875669942784
[2023-03-09 11:50:25] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2023-03-09 11:50:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:50:25] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2023-03-09 11:50:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:50:25] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2023-03-09 11:50:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:50:25] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8468833875669942784
Running compilation step : cd /tmp/ltsmin8468833875669942784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin8468833875669942784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin8468833875669942784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7573959832427816242.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 4149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U p2))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (trivial) has 215 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1042 edges and 460 vertex of which 459 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 458 transition count 349
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 408 transition count 349
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 102 place count 408 transition count 252
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 314 place count 293 transition count 252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 320 place count 287 transition count 246
Iterating global reduction 2 with 6 rules applied. Total rules applied 326 place count 287 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 326 place count 287 transition count 245
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 328 place count 286 transition count 245
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 566 place count 165 transition count 128
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 568 place count 164 transition count 132
Applied a total of 568 rules in 60 ms. Remains 164 /465 variables (removed 301) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 164 cols
[2023-03-09 11:50:25] [INFO ] Computed 73 place invariants in 3 ms
[2023-03-09 11:50:26] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 151 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/465 places, 132/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 145/465 places, 132/407 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(EQ s111 1), p1:(EQ s37 1), p0:(EQ s37 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((!p1 U p2)))))'
Support contains 7 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (complete) has 1048 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 463 transition count 360
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 418 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 416 transition count 358
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 95 place count 416 transition count 260
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 308 place count 301 transition count 260
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 314 place count 295 transition count 254
Iterating global reduction 3 with 6 rules applied. Total rules applied 320 place count 295 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 320 place count 295 transition count 253
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 294 transition count 253
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 564 place count 171 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 565 place count 171 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 567 place count 170 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 169 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 569 place count 168 transition count 136
Applied a total of 569 rules in 112 ms. Remains 168 /465 variables (removed 297) and now considering 136/407 (removed 271) transitions.
// Phase 1: matrix 136 rows 168 cols
[2023-03-09 11:50:26] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-09 11:50:27] [INFO ] Implicit Places using invariants in 541 ms returned [51, 52, 53, 54, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 545 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/465 places, 136/407 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 662 ms. Remains : 163/465 places, 136/407 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s124 0), p2:(AND (EQ s31 1) (EQ s69 1) (EQ s122 1)), p1:(AND (EQ s49 1) (EQ s101 1) (EQ s138 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12188 reset in 404 ms.
Product exploration explored 100000 steps with 12126 reset in 333 ms.
Computed a total of 158 stabilizing places and 131 stable transitions
Computed a total of 158 stabilizing places and 131 stable transitions
Detected a total of 158/163 stabilizing places and 131/136 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1046 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1192 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 347 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 136 rows 163 cols
[2023-03-09 11:50:29] [INFO ] Computed 68 place invariants in 2 ms
[2023-03-09 11:50:29] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:50:29] [INFO ] [Nat]Absence check using 46 positive place invariants in 6 ms returned sat
[2023-03-09 11:50:29] [INFO ] [Nat]Absence check using 46 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-09 11:50:29] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 11:50:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:50:29] [INFO ] After 43ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-09 11:50:29] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-03-09 11:50:29] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2023-03-09 11:50:29] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2023-03-09 11:50:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 236 ms
[2023-03-09 11:50:30] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-03-09 11:50:30] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-03-09 11:50:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-03-09 11:50:30] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-09 11:50:30] [INFO ] After 764ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 136/136 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 136
Applied a total of 1 rules in 10 ms. Remains 163 /163 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 163/163 places, 136/136 transitions.
Incomplete random walk after 10000 steps, including 1217 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 376 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 366 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 247 steps, run visited all 2 properties in 5 ms. (steps per millisecond=49 )
Probabilistic random walk after 247 steps, saw 121 distinct states, run finished after 5 ms. (steps per millisecond=49 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (F (AND p0 (NOT p2) p1)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 1188 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 136/136 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-09 11:50:31] [INFO ] Invariant cache hit.
[2023-03-09 11:50:32] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-09 11:50:32] [INFO ] Invariant cache hit.
[2023-03-09 11:50:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:50:32] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [52, 59, 61, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 483 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/163 places, 136/136 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 140 transition count 126
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 130 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 128 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 128 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 128 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 127 transition count 122
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 44 place count 116 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 48 place count 114 transition count 113
Applied a total of 48 rules in 16 ms. Remains 114 /140 variables (removed 26) and now considering 113/136 (removed 23) transitions.
// Phase 1: matrix 113 rows 114 cols
[2023-03-09 11:50:32] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-09 11:50:32] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 11:50:32] [INFO ] Invariant cache hit.
[2023-03-09 11:50:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-09 11:50:32] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [5, 6, 7, 29, 30, 33, 34, 35, 37, 39, 41, 42, 43, 44, 45]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 285 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/163 places, 113/136 transitions.
Graph (complete) has 372 edges and 99 vertex of which 90 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 81 transition count 73
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 81 transition count 73
Applied a total of 19 rules in 4 ms. Remains 81 /99 variables (removed 18) and now considering 73/113 (removed 40) transitions.
// Phase 1: matrix 73 rows 81 cols
[2023-03-09 11:50:32] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-09 11:50:32] [INFO ] Implicit Places using invariants in 61 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 78/163 places, 73/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 878 ms. Remains : 78/163 places, 73/136 transitions.
Computed a total of 73 stabilizing places and 68 stable transitions
Computed a total of 73 stabilizing places and 68 stable transitions
Detected a total of 73/78 stabilizing places and 68/73 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1013 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1215 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 325 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 368 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 352 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 73 rows 78 cols
[2023-03-09 11:50:34] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-09 11:50:34] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 11:50:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-09 11:50:34] [INFO ] [Nat]Absence check using 11 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-09 11:50:34] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 11:50:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:50:34] [INFO ] After 46ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-09 11:50:34] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-09 11:50:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-09 11:50:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-09 11:50:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 11:50:34] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 11:50:34] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 73/73 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 78/78 places, 73/73 transitions.
Incomplete random walk after 10000 steps, including 1248 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 350 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Finished probabilistic random walk after 195 steps, run visited all 3 properties in 5 ms. (steps per millisecond=39 )
Probabilistic random walk after 195 steps, saw 106 distinct states, run finished after 5 ms. (steps per millisecond=39 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (F (AND p1 (NOT p2) p0)), (F (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 20 factoid took 1588 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 12240 reset in 165 ms.
Product exploration explored 100000 steps with 12341 reset in 176 ms.
Built C files in :
/tmp/ltsmin9586553435962016042
[2023-03-09 11:50:37] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2023-03-09 11:50:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:50:37] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2023-03-09 11:50:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:50:37] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2023-03-09 11:50:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:50:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9586553435962016042
Running compilation step : cd /tmp/ltsmin9586553435962016042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 248 ms.
Running link step : cd /tmp/ltsmin9586553435962016042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9586553435962016042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17333835554768955263.hoa' '--buchi-type=spotba'
LTSmin run took 888 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 11983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (trivial) has 213 edges and 465 vertex of which 6 / 465 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1042 edges and 460 vertex of which 459 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 458 transition count 351
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 410 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 409 transition count 350
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 100 place count 409 transition count 253
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 312 place count 294 transition count 253
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 318 place count 288 transition count 247
Iterating global reduction 3 with 6 rules applied. Total rules applied 324 place count 288 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 324 place count 288 transition count 246
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 326 place count 287 transition count 246
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 237 rules applied. Total rules applied 563 place count 168 transition count 128
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 3 with 2 rules applied. Total rules applied 565 place count 167 transition count 132
Applied a total of 565 rules in 36 ms. Remains 167 /465 variables (removed 298) and now considering 132/407 (removed 275) transitions.
// Phase 1: matrix 132 rows 167 cols
[2023-03-09 11:50:38] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-09 11:50:38] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 50, 51, 52, 53, 54, 55, 56, 57, 161, 163, 165]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 189 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/465 places, 132/407 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 145/465 places, 132/407 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s32 1), p1:(EQ s111 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-08 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 459 transition count 401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 459 transition count 401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 455 transition count 397
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 455 transition count 397
Applied a total of 20 rules in 20 ms. Remains 455 /465 variables (removed 10) and now considering 397/407 (removed 10) transitions.
// Phase 1: matrix 397 rows 455 cols
[2023-03-09 11:50:38] [INFO ] Computed 95 place invariants in 3 ms
[2023-03-09 11:50:39] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-09 11:50:39] [INFO ] Invariant cache hit.
[2023-03-09 11:50:39] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2023-03-09 11:50:39] [INFO ] Invariant cache hit.
[2023-03-09 11:50:39] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/465 places, 397/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1146 ms. Remains : 455/465 places, 397/407 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s307 1), p1:(OR (EQ s307 1) (EQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1167 reset in 173 ms.
Stack based approach found an accepted trace after 781 steps with 9 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-09 finished in 1452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Graph (trivial) has 215 edges and 465 vertex of which 6 / 465 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 1042 edges and 460 vertex of which 459 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
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 458 transition count 350
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 409 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 408 transition count 349
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 102 place count 408 transition count 253
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 311 place count 295 transition count 253
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 318 place count 288 transition count 246
Iterating global reduction 3 with 7 rules applied. Total rules applied 325 place count 288 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 325 place count 288 transition count 245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 287 transition count 245
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 565 place count 166 transition count 128
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 3 with 2 rules applied. Total rules applied 567 place count 165 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 568 place count 164 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 163 transition count 131
Applied a total of 569 rules in 34 ms. Remains 163 /465 variables (removed 302) and now considering 131/407 (removed 276) transitions.
// Phase 1: matrix 131 rows 163 cols
[2023-03-09 11:50:40] [INFO ] Computed 73 place invariants in 2 ms
[2023-03-09 11:50:40] [INFO ] Implicit Places using invariants in 389 ms returned [49, 50, 51, 52, 53, 54, 55, 125]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 391 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/465 places, 131/407 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 155/465 places, 131/407 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s33 1), p1:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-14 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (X(p1)||G(p0)))))))'
Support contains 2 out of 465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 465/465 places, 407/407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 459 transition count 401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 459 transition count 401
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 455 transition count 397
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 455 transition count 397
Applied a total of 20 rules in 41 ms. Remains 455 /465 variables (removed 10) and now considering 397/407 (removed 10) transitions.
// Phase 1: matrix 397 rows 455 cols
[2023-03-09 11:50:40] [INFO ] Computed 95 place invariants in 7 ms
[2023-03-09 11:50:40] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-09 11:50:40] [INFO ] Invariant cache hit.
[2023-03-09 11:50:41] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-09 11:50:41] [INFO ] Invariant cache hit.
[2023-03-09 11:50:41] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 455/465 places, 397/407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 841 ms. Remains : 455/465 places, 397/407 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(NEQ s381 1), p0:(EQ s251 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 1014 ms.
All properties solved by simple procedures.
Total runtime 32070 ms.

BK_STOP 1678362641906

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="BusinessProcesses-PT-12"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, 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 r037-tajo-167813690500540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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