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-167813690500548.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-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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.6K 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 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 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 148K 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-13-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678362987670

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-13
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 11:56:29] [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:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:56:30] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-09 11:56:30] [INFO ] Transformed 593 places.
[2023-03-09 11:56:30] [INFO ] Transformed 536 transitions.
[2023-03-09 11:56:30] [INFO ] Found NUPN structural information;
[2023-03-09 11:56:30] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 86 place count 499 transition count 447
Iterating global reduction 1 with 81 rules applied. Total rules applied 167 place count 499 transition count 447
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 209 place count 457 transition count 405
Iterating global reduction 1 with 42 rules applied. Total rules applied 251 place count 457 transition count 405
Applied a total of 251 rules in 102 ms. Remains 457 /585 variables (removed 128) and now considering 405/528 (removed 123) transitions.
// Phase 1: matrix 405 rows 457 cols
[2023-03-09 11:56:30] [INFO ] Computed 90 place invariants in 35 ms
[2023-03-09 11:56:30] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-09 11:56:30] [INFO ] Invariant cache hit.
[2023-03-09 11:56:31] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2023-03-09 11:56:31] [INFO ] Invariant cache hit.
[2023-03-09 11:56:31] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 457/585 places, 405/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1395 ms. Remains : 457/585 places, 405/528 transitions.
Support contains 49 out of 457 places after structural reductions.
[2023-03-09 11:56:31] [INFO ] Flatten gal took : 86 ms
[2023-03-09 11:56:31] [INFO ] Flatten gal took : 39 ms
[2023-03-09 11:56:32] [INFO ] Input system was already deterministic with 405 transitions.
Support contains 41 out of 457 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) 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 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 5 ms. (steps per millisecond=200 ) 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 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 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 1000 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 13 ms. (steps per millisecond=76 ) 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 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 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 5 ms. (steps per millisecond=200 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-09 11:56:32] [INFO ] Invariant cache hit.
[2023-03-09 11:56:33] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 11:56:33] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-09 11:56:33] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2023-03-09 11:56:33] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-09 11:56:33] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 6 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 10 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 534 ms
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 2 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2023-03-09 11:56:34] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2023-03-09 11:56:35] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2023-03-09 11:56:35] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2023-03-09 11:56:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 723 ms
[2023-03-09 11:56:35] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 1 ms to minimize.
[2023-03-09 11:56:35] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2023-03-09 11:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-09 11:56:35] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2023-03-09 11:56:35] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2023-03-09 11:56:35] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2023-03-09 11:56:36] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2023-03-09 11:56:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 528 ms
[2023-03-09 11:56:36] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-09 11:56:36] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:56:36] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:56:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2023-03-09 11:56:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 518 ms
[2023-03-09 11:56:36] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-09 11:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 11:56:37] [INFO ] After 3630ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :16
Attempting to minimize the solution found.
Minimization took 420 ms.
[2023-03-09 11:56:37] [INFO ] After 4371ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :16
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 10 properties in 273 ms.
Support contains 11 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (complete) has 1038 edges and 457 vertex of which 456 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 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 49 place count 456 transition count 356
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 408 transition count 354
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 406 transition count 354
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 101 place count 406 transition count 262
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 301 place count 298 transition count 262
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 308 place count 291 transition count 255
Iterating global reduction 3 with 7 rules applied. Total rules applied 315 place count 291 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 315 place count 291 transition count 254
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 317 place count 290 transition count 254
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 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 551 place count 171 transition count 139
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 553 place count 170 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 554 place count 170 transition count 142
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 560 place count 170 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 561 place count 169 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 562 place count 168 transition count 141
Applied a total of 562 rules in 163 ms. Remains 168 /457 variables (removed 289) and now considering 141/405 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 168/457 places, 141/405 transitions.
Incomplete random walk after 10000 steps, including 1086 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 419 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 230 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 339 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 348 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 357 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 141 rows 168 cols
[2023-03-09 11:56:38] [INFO ] Computed 69 place invariants in 9 ms
[2023-03-09 11:56:38] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:56:38] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-09 11:56:38] [INFO ] [Nat]Absence check using 52 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-09 11:56:38] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 11:56:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:56:38] [INFO ] After 22ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 11:56:38] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 11:56:38] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 4 properties in 7 ms.
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 141/141 transitions.
Graph (trivial) has 11 edges and 168 vertex of which 2 / 168 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 167 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 165 transition count 137
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 165 transition count 134
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 12 place count 161 transition count 134
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 2 with 4 rules applied. Total rules applied 16 place count 159 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 158 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 158 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 157 transition count 130
Applied a total of 20 rules in 27 ms. Remains 157 /168 variables (removed 11) and now considering 130/141 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 157/168 places, 130/141 transitions.
Incomplete random walk after 10000 steps, including 1796 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 689 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 241 steps, run visited all 1 properties in 12 ms. (steps per millisecond=20 )
Probabilistic random walk after 241 steps, saw 168 distinct states, run finished after 13 ms. (steps per millisecond=18 ) properties seen :1
FORMULA BusinessProcesses-PT-13-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-13-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1038 edges and 457 vertex of which 456 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 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(X(G(F(G(((F(G(p1))&&p1)||p0)))))))'
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (complete) has 1038 edges and 457 vertex of which 456 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 455 transition count 354
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 406 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 404 transition count 352
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 103 place count 404 transition count 256
Deduced a syphon composed of 96 places in 1 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 312 place count 291 transition count 256
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 320 place count 283 transition count 248
Iterating global reduction 3 with 8 rules applied. Total rules applied 328 place count 283 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 283 transition count 247
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 330 place count 282 transition count 247
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 562 place count 164 transition count 133
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 564 place count 163 transition count 137
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 565 place count 163 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 566 place count 163 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 567 place count 162 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 568 place count 161 transition count 135
Applied a total of 568 rules in 101 ms. Remains 161 /457 variables (removed 296) and now considering 135/405 (removed 270) transitions.
// Phase 1: matrix 135 rows 161 cols
[2023-03-09 11:56:39] [INFO ] Computed 68 place invariants in 4 ms
[2023-03-09 11:56:39] [INFO ] Implicit Places using invariants in 120 ms returned [25, 48, 49, 50, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 126 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/457 places, 135/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 156/457 places, 135/405 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s23 0) (EQ s71 0) (EQ s133 0)), p0:(OR (EQ s7 0) (EQ s80 0) (EQ s108 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11416 reset in 323 ms.
Product exploration explored 100000 steps with 11491 reset in 278 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 502 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1142 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 334 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 332 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 357 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 325 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 316 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Probably explored full state space saw : 72988 states, properties seen :3
Probabilistic random walk after 331780 steps, saw 72988 distinct states, run finished after 1292 ms. (steps per millisecond=256 ) properties seen :3
Explored full state space saw : 72988 states, properties seen :0
Exhaustive walk after 331780 steps, saw 72988 distinct states, run finished after 1219 ms. (steps per millisecond=272 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 499 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 135/135 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 156 cols
[2023-03-09 11:56:44] [INFO ] Computed 63 place invariants in 4 ms
[2023-03-09 11:56:44] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 11:56:44] [INFO ] Invariant cache hit.
[2023-03-09 11:56:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:56:45] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [25, 48, 49, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 74, 76, 81, 83, 85, 87, 89, 97, 99, 101, 103, 105]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 399 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/156 places, 135/135 transitions.
Graph (complete) has 425 edges and 130 vertex of which 121 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 121 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 112 transition count 122
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 31 place count 100 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 100 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 100 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 98 transition count 80
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 65 place count 88 transition count 72
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 69 place count 86 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 86 transition count 70
Applied a total of 70 rules in 16 ms. Remains 86 /130 variables (removed 44) and now considering 70/135 (removed 65) transitions.
// Phase 1: matrix 70 rows 86 cols
[2023-03-09 11:56:45] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-09 11:56:45] [INFO ] Implicit Places using invariants in 62 ms returned [23, 24, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/156 places, 70/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 83 /83 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 500 ms. Remains : 83/156 places, 70/135 transitions.
Computed a total of 16 stabilizing places and 5 stable transitions
Computed a total of 16 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 456 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1144 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 348 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 320 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 301 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 338 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 70 rows 83 cols
[2023-03-09 11:56:46] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-09 11:56:46] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:56:46] [INFO ] [Nat]Absence check using 25 positive place invariants in 2 ms returned sat
[2023-03-09 11:56:46] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 0 ms returned sat
[2023-03-09 11:56:46] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 11:56:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 11:56:46] [INFO ] After 17ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-09 11:56:46] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 11:56:46] [INFO ] After 162ms 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 2 ms.
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 70/70 transitions.
Incomplete random walk after 10000 steps, including 1183 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 355 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 364 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished probabilistic random walk after 179 steps, run visited all 2 properties in 21 ms. (steps per millisecond=8 )
Probabilistic random walk after 179 steps, saw 110 distinct states, run finished after 22 ms. (steps per millisecond=8 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 12 factoid took 463 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11687 reset in 248 ms.
Product exploration explored 100000 steps with 11635 reset in 250 ms.
Built C files in :
/tmp/ltsmin6025233187222921367
[2023-03-09 11:56:47] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2023-03-09 11:56:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:56:47] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2023-03-09 11:56:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:56:47] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2023-03-09 11:56:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:56:47] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6025233187222921367
Running compilation step : cd /tmp/ltsmin6025233187222921367;'/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 379 ms.
Running link step : cd /tmp/ltsmin6025233187222921367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin6025233187222921367;'/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/stateBased10163670514815464494.hoa' '--buchi-type=spotba'
LTSmin run took 322 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLFireability-00 finished in 9357 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)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 214 edges and 457 vertex of which 6 / 457 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 1032 edges and 452 vertex of which 451 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 450 transition count 345
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 398 transition count 345
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 106 place count 398 transition count 250
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 313 place count 286 transition count 250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 320 place count 279 transition count 243
Iterating global reduction 2 with 7 rules applied. Total rules applied 327 place count 279 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 327 place count 279 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 278 transition count 242
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 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 563 place count 159 transition count 127
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 565 place count 158 transition count 131
Applied a total of 565 rules in 46 ms. Remains 158 /457 variables (removed 299) and now considering 131/405 (removed 274) transitions.
// Phase 1: matrix 131 rows 158 cols
[2023-03-09 11:56:48] [INFO ] Computed 69 place invariants in 2 ms
[2023-03-09 11:56:48] [INFO ] Implicit Places using invariants in 126 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 128 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/457 places, 131/405 transitions.
Applied a total of 0 rules in 17 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 139/457 places, 131/405 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21818 reset in 338 ms.
Product exploration explored 100000 steps with 21840 reset in 262 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 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 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2494 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 784 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74 steps, run visited all 1 properties in 13 ms. (steps per millisecond=5 )
Probabilistic random walk after 74 steps, saw 46 distinct states, run finished after 14 ms. (steps per millisecond=5 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 139 cols
[2023-03-09 11:56:50] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-09 11:56:50] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 11:56:50] [INFO ] Invariant cache hit.
[2023-03-09 11:56:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:56:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [1, 3, 7, 10, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 87, 89]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 382 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/139 places, 131/131 transitions.
Graph (complete) has 363 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 98 transition count 118
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 90 transition count 118
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 30 place count 77 transition count 76
Iterating global reduction 2 with 13 rules applied. Total rules applied 43 place count 77 transition count 76
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 77 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 75 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 74 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 74 transition count 73
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 66 place count 65 transition count 65
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 68 place count 64 transition count 64
Applied a total of 68 rules in 26 ms. Remains 64 /109 variables (removed 45) and now considering 64/131 (removed 67) transitions.
// Phase 1: matrix 64 rows 64 cols
[2023-03-09 11:56:50] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 11:56:50] [INFO ] Implicit Places using invariants in 59 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/139 places, 64/131 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 488 ms. Remains : 61/139 places, 64/131 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2533 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 793 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 58 steps, run visited all 1 properties in 4 ms. (steps per millisecond=14 )
Probabilistic random walk after 58 steps, saw 38 distinct states, run finished after 5 ms. (steps per millisecond=11 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 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 p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22473 reset in 97 ms.
Product exploration explored 100000 steps with 22432 reset in 115 ms.
Built C files in :
/tmp/ltsmin7130176844308449408
[2023-03-09 11:56:51] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2023-03-09 11:56:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:56:51] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2023-03-09 11:56:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:56:51] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2023-03-09 11:56:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:56:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7130176844308449408
Running compilation step : cd /tmp/ltsmin7130176844308449408;'/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 194 ms.
Running link step : cd /tmp/ltsmin7130176844308449408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7130176844308449408;'/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/stateBased1914141847802820357.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLFireability-01 finished in 2868 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)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 23 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-09 11:56:51] [INFO ] Computed 90 place invariants in 5 ms
[2023-03-09 11:56:51] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-09 11:56:51] [INFO ] Invariant cache hit.
[2023-03-09 11:56:52] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-03-09 11:56:52] [INFO ] Invariant cache hit.
[2023-03-09 11:56:52] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1039 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s257 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 449 ms.
Product exploration explored 100000 steps with 50000 reset in 374 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/446 stabilizing places and 111/394 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-02 finished in 2098 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(G(p0)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 24 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
[2023-03-09 11:56:53] [INFO ] Invariant cache hit.
[2023-03-09 11:56:53] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-09 11:56:53] [INFO ] Invariant cache hit.
[2023-03-09 11:56:54] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2023-03-09 11:56:54] [INFO ] Invariant cache hit.
[2023-03-09 11:56:54] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 993 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s341 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-03 finished in 1209 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)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 213 edges and 457 vertex of which 6 / 457 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 1032 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 450 transition count 346
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 399 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 104 place count 399 transition count 252
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 308 place count 289 transition count 252
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 316 place count 281 transition count 244
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 281 transition count 244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 324 place count 281 transition count 243
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 326 place count 280 transition count 243
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 560 place count 161 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 562 place count 160 transition count 132
Applied a total of 562 rules in 50 ms. Remains 160 /457 variables (removed 297) and now considering 132/405 (removed 273) transitions.
// Phase 1: matrix 132 rows 160 cols
[2023-03-09 11:56:54] [INFO ] Computed 70 place invariants in 2 ms
[2023-03-09 11:56:55] [INFO ] Implicit Places using invariants in 157 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 26, 49, 50, 51, 52, 53, 128]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 159 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/457 places, 132/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 140/457 places, 132/405 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-04 finished in 308 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(X(G((p0||F(p1))))))'
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 20 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-09 11:56:55] [INFO ] Computed 90 place invariants in 3 ms
[2023-03-09 11:56:55] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-09 11:56:55] [INFO ] Invariant cache hit.
[2023-03-09 11:56:55] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-03-09 11:56:55] [INFO ] Invariant cache hit.
[2023-03-09 11:56:56] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1019 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s441 1) (EQ s444 1)), p1:(OR (EQ s285 1) (AND (EQ s190 1) (EQ s276 1) (EQ s407 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1302 reset in 182 ms.
Stack based approach found an accepted trace after 1180 steps with 15 reset with depth 20 and stack size 20 in 3 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 1405 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((G((F(p0)&&F(p1)))||G(p2))))'
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 451 transition count 399
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 451 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 449 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 449 transition count 397
Applied a total of 16 rules in 26 ms. Remains 449 /457 variables (removed 8) and now considering 397/405 (removed 8) transitions.
// Phase 1: matrix 397 rows 449 cols
[2023-03-09 11:56:56] [INFO ] Computed 90 place invariants in 5 ms
[2023-03-09 11:56:56] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-09 11:56:56] [INFO ] Invariant cache hit.
[2023-03-09 11:56:57] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-09 11:56:57] [INFO ] Invariant cache hit.
[2023-03-09 11:56:57] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/457 places, 397/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1091 ms. Remains : 449/457 places, 397/405 transitions.
Stuttering acceptance computed with spot in 437 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s292 0), p0:(EQ s57 0), p1:(EQ s36 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 715 reset in 262 ms.
Product exploration explored 100000 steps with 719 reset in 269 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1026 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 551 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 675796 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 675796 steps, saw 106388 distinct states, run finished after 3004 ms. (steps per millisecond=224 ) properties seen :2
Running SMT prover for 3 properties.
[2023-03-09 11:57:03] [INFO ] Invariant cache hit.
[2023-03-09 11:57:03] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:57:03] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2023-03-09 11:57:03] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 14 ms returned sat
[2023-03-09 11:57:03] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 11:57:03] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
[2023-03-09 11:57:03] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-03-09 11:57:03] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-09 11:57:03] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-03-09 11:57:04] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2023-03-09 11:57:04] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2023-03-09 11:57:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 602 ms
[2023-03-09 11:57:04] [INFO ] After 903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 11:57:04] [INFO ] After 1139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 397/397 transitions.
Graph (trivial) has 203 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1019 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 47 place count 443 transition count 344
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 398 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 397 transition count 343
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 94 place count 397 transition count 248
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 301 place count 285 transition count 248
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 543 place count 162 transition count 129
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 545 place count 161 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 161 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 159 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 550 place count 159 transition count 131
Applied a total of 550 rules in 42 ms. Remains 159 /449 variables (removed 290) and now considering 131/397 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 159/449 places, 131/397 transitions.
Incomplete random walk after 10000 steps, including 414 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 222 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 175 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Finished probabilistic random walk after 89398 steps, run visited all 3 properties in 336 ms. (steps per millisecond=266 )
Probabilistic random walk after 89398 steps, saw 21329 distinct states, run finished after 336 ms. (steps per millisecond=266 ) properties seen :3
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 714 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Applied a total of 0 rules in 8 ms. Remains 449 /449 variables (removed 0) and now considering 397/397 (removed 0) transitions.
[2023-03-09 11:57:06] [INFO ] Invariant cache hit.
[2023-03-09 11:57:06] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-09 11:57:06] [INFO ] Invariant cache hit.
[2023-03-09 11:57:07] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-09 11:57:07] [INFO ] Invariant cache hit.
[2023-03-09 11:57:07] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1104 ms. Remains : 449/449 places, 397/397 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1026 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 517 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 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 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 11:57:08] [INFO ] Invariant cache hit.
[2023-03-09 11:57:08] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:57:08] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-09 11:57:08] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 14 ms returned sat
[2023-03-09 11:57:09] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 11:57:09] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2023-03-09 11:57:09] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2023-03-09 11:57:09] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-09 11:57:09] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2023-03-09 11:57:09] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2023-03-09 11:57:09] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2023-03-09 11:57:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 642 ms
[2023-03-09 11:57:09] [INFO ] After 982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 11:57:09] [INFO ] After 1209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 397/397 transitions.
Graph (trivial) has 203 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1019 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 47 place count 443 transition count 344
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 398 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 397 transition count 343
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 94 place count 397 transition count 248
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 301 place count 285 transition count 248
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 543 place count 162 transition count 129
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 545 place count 161 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 161 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 549 place count 159 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 550 place count 159 transition count 131
Applied a total of 550 rules in 30 ms. Remains 159 /449 variables (removed 290) and now considering 131/397 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 159/449 places, 131/397 transitions.
Incomplete random walk after 10000 steps, including 426 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 195 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 185 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Finished probabilistic random walk after 89398 steps, run visited all 3 properties in 368 ms. (steps per millisecond=242 )
Probabilistic random walk after 89398 steps, saw 21329 distinct states, run finished after 370 ms. (steps per millisecond=241 ) properties seen :3
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 789 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 713 reset in 221 ms.
Product exploration explored 100000 steps with 720 reset in 284 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Graph (trivial) has 203 edges and 449 vertex of which 6 / 449 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 1020 edges and 444 vertex of which 443 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
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 390
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 47 place count 443 transition count 438
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 443 transition count 438
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 129 place count 429 transition count 412
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 143 place count 429 transition count 412
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 146 rules applied. Total rules applied 289 place count 429 transition count 412
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 325 place count 393 transition count 376
Deduced a syphon composed of 209 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 361 place count 393 transition count 376
Deduced a syphon composed of 209 places in 0 ms
Applied a total of 361 rules in 112 ms. Remains 393 /449 variables (removed 56) and now considering 376/397 (removed 21) transitions.
[2023-03-09 11:57:13] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 376 rows 393 cols
[2023-03-09 11:57:13] [INFO ] Computed 90 place invariants in 8 ms
[2023-03-09 11:57:13] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/449 places, 376/397 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 393/449 places, 376/397 transitions.
Built C files in :
/tmp/ltsmin14017901109903365845
[2023-03-09 11:57:13] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14017901109903365845
Running compilation step : cd /tmp/ltsmin14017901109903365845;'/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 740 ms.
Running link step : cd /tmp/ltsmin14017901109903365845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin14017901109903365845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4426643002251916839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 397/397 transitions.
Applied a total of 0 rules in 29 ms. Remains 449 /449 variables (removed 0) and now considering 397/397 (removed 0) transitions.
// Phase 1: matrix 397 rows 449 cols
[2023-03-09 11:57:29] [INFO ] Computed 90 place invariants in 6 ms
[2023-03-09 11:57:29] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-09 11:57:29] [INFO ] Invariant cache hit.
[2023-03-09 11:57:29] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-09 11:57:29] [INFO ] Invariant cache hit.
[2023-03-09 11:57:29] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 449/449 places, 397/397 transitions.
Built C files in :
/tmp/ltsmin17342093227247575643
[2023-03-09 11:57:29] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17342093227247575643
Running compilation step : cd /tmp/ltsmin17342093227247575643;'/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 608 ms.
Running link step : cd /tmp/ltsmin17342093227247575643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17342093227247575643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7570335563199552315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 11:57:45] [INFO ] Flatten gal took : 55 ms
[2023-03-09 11:57:45] [INFO ] Flatten gal took : 19 ms
[2023-03-09 11:57:45] [INFO ] Time to serialize gal into /tmp/LTL16469834281859879761.gal : 5 ms
[2023-03-09 11:57:45] [INFO ] Time to serialize properties into /tmp/LTL1993661014780053653.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16469834281859879761.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6791122059966300771.hoa' '-atoms' '/tmp/LTL1993661014780053653.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1993661014780053653.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6791122059966300771.hoa
Detected timeout of ITS tools.
[2023-03-09 11:58:00] [INFO ] Flatten gal took : 34 ms
[2023-03-09 11:58:00] [INFO ] Flatten gal took : 28 ms
[2023-03-09 11:58:00] [INFO ] Time to serialize gal into /tmp/LTL17483832775726399287.gal : 5 ms
[2023-03-09 11:58:00] [INFO ] Time to serialize properties into /tmp/LTL9413339346237266692.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17483832775726399287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9413339346237266692.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G((F("(p65==0)"))&&(F("(p38==0)"))))||(G("(p343==0)")))))
Formula 0 simplified : X(F(G!"(p65==0)" | G!"(p38==0)") & F!"(p343==0)")
Detected timeout of ITS tools.
[2023-03-09 11:58:15] [INFO ] Flatten gal took : 15 ms
[2023-03-09 11:58:15] [INFO ] Applying decomposition
[2023-03-09 11:58:15] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10311311440013493888.txt' '-o' '/tmp/graph10311311440013493888.bin' '-w' '/tmp/graph10311311440013493888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10311311440013493888.bin' '-l' '-1' '-v' '-w' '/tmp/graph10311311440013493888.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:58:15] [INFO ] Decomposing Gal with order
[2023-03-09 11:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:58:15] [INFO ] Removed a total of 263 redundant transitions.
[2023-03-09 11:58:15] [INFO ] Flatten gal took : 94 ms
[2023-03-09 11:58:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 16 ms.
[2023-03-09 11:58:15] [INFO ] Time to serialize gal into /tmp/LTL1954341930570534519.gal : 9 ms
[2023-03-09 11:58:15] [INFO ] Time to serialize properties into /tmp/LTL18419360970683536612.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1954341930570534519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18419360970683536612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G((F("(i0.i0.u22.p65==0)"))&&(F("(i8.i0.u14.p38==0)"))))||(G("(i12.i1.u105.p343==0)")))))
Formula 0 simplified : X(F(G!"(i0.i0.u22.p65==0)" | G!"(i8.i0.u14.p38==0)") & F!"(i12.i1.u105.p343==0)")
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t167, t263, t272, t378, t379, t388, t389, t395, t400, i0.i0.t256, i0.i0.u21....1194
Computing Next relation with stutter on 1188 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
735 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.40801,242752,1,0,469080,823,7152,795799,320,2602,1096572
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-13-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 88025 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((X(p0)||(p1 U (p2||G(p1))))))'
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 450 transition count 398
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 447 transition count 395
Applied a total of 20 rules in 35 ms. Remains 447 /457 variables (removed 10) and now considering 395/405 (removed 10) transitions.
// Phase 1: matrix 395 rows 447 cols
[2023-03-09 11:58:24] [INFO ] Computed 90 place invariants in 6 ms
[2023-03-09 11:58:24] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-09 11:58:24] [INFO ] Invariant cache hit.
[2023-03-09 11:58:25] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-09 11:58:25] [INFO ] Invariant cache hit.
[2023-03-09 11:58:25] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/457 places, 395/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 931 ms. Remains : 447/457 places, 395/405 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s346 1) (NEQ s112 1)), p1:(NEQ s112 1), p0:(OR (EQ s145 0) (EQ s402 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 707 reset in 198 ms.
Product exploration explored 100000 steps with 715 reset in 212 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1071 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 11:58:27] [INFO ] Invariant cache hit.
[2023-03-09 11:58:27] [INFO ] [Real]Absence check using 52 positive place invariants in 17 ms returned sat
[2023-03-09 11:58:27] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 20 ms returned sat
[2023-03-09 11:58:28] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2023-03-09 11:58:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 793 ms
[2023-03-09 11:58:28] [INFO ] After 967ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:58:28] [INFO ] After 1097ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:58:29] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2023-03-09 11:58:29] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2023-03-09 11:58:29] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-09 11:58:29] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-03-09 11:58:29] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 2 ms to minimize.
[2023-03-09 11:58:29] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2023-03-09 11:58:29] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 0 ms to minimize.
[2023-03-09 11:58:30] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 0 ms to minimize.
[2023-03-09 11:58:30] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2023-03-09 11:58:30] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
[2023-03-09 11:58:30] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 1 ms to minimize.
[2023-03-09 11:58:30] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:58:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1344 ms
[2023-03-09 11:58:30] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2023-03-09 11:58:30] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-09 11:58:31] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2023-03-09 11:58:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2023-03-09 11:58:31] [INFO ] After 2158ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-09 11:58:31] [INFO ] After 2416ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 395/395 transitions.
Graph (trivial) has 200 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1015 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 47 place count 441 transition count 342
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 396 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 396 transition count 249
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 287 transition count 249
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 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 534 place count 165 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 2 with 2 rules applied. Total rules applied 536 place count 164 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 164 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 162 transition count 133
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 162 transition count 133
Applied a total of 545 rules in 28 ms. Remains 162 /447 variables (removed 285) and now considering 133/395 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 162/447 places, 133/395 transitions.
Incomplete random walk after 10000 steps, including 413 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :3
Finished Best-First random walk after 169 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=169 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 21 factoid took 1152 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 395/395 transitions.
Applied a total of 0 rules in 7 ms. Remains 447 /447 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2023-03-09 11:58:32] [INFO ] Invariant cache hit.
[2023-03-09 11:58:33] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-09 11:58:33] [INFO ] Invariant cache hit.
[2023-03-09 11:58:33] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2023-03-09 11:58:33] [INFO ] Invariant cache hit.
[2023-03-09 11:58:33] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 447/447 places, 395/395 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 1022 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 735 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 71 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 11:58:35] [INFO ] Invariant cache hit.
[2023-03-09 11:58:35] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 11:58:35] [INFO ] [Nat]Absence check using 52 positive place invariants in 17 ms returned sat
[2023-03-09 11:58:35] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 13 ms returned sat
[2023-03-09 11:58:35] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 11:58:35] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2023-03-09 11:58:35] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-09 11:58:36] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2023-03-09 11:58:36] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2023-03-09 11:58:36] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2023-03-09 11:58:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 630 ms
[2023-03-09 11:58:36] [INFO ] After 955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-09 11:58:36] [INFO ] After 1195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 395/395 transitions.
Graph (trivial) has 200 edges and 447 vertex of which 6 / 447 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1015 edges and 442 vertex of which 441 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 47 place count 441 transition count 342
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 396 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 92 place count 396 transition count 249
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 294 place count 287 transition count 249
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 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 534 place count 165 transition count 131
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 2 with 2 rules applied. Total rules applied 536 place count 164 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 164 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 162 transition count 133
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 162 transition count 133
Applied a total of 545 rules in 26 ms. Remains 162 /447 variables (removed 285) and now considering 133/395 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 162/447 places, 133/395 transitions.
Incomplete random walk after 10000 steps, including 432 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :3
Finished Best-First random walk after 395 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=197 )
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 18 factoid took 794 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 718 reset in 232 ms.
Product exploration explored 100000 steps with 722 reset in 213 ms.
Built C files in :
/tmp/ltsmin2296176041221185237
[2023-03-09 11:58:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2296176041221185237
Running compilation step : cd /tmp/ltsmin2296176041221185237;'/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 705 ms.
Running link step : cd /tmp/ltsmin2296176041221185237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2296176041221185237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13786989940468965331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 395/395 transitions.
Applied a total of 0 rules in 14 ms. Remains 447 /447 variables (removed 0) and now considering 395/395 (removed 0) transitions.
[2023-03-09 11:58:53] [INFO ] Invariant cache hit.
[2023-03-09 11:58:53] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-09 11:58:53] [INFO ] Invariant cache hit.
[2023-03-09 11:58:54] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-09 11:58:54] [INFO ] Invariant cache hit.
[2023-03-09 11:58:54] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 846 ms. Remains : 447/447 places, 395/395 transitions.
Built C files in :
/tmp/ltsmin6704364088811327759
[2023-03-09 11:58:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6704364088811327759
Running compilation step : cd /tmp/ltsmin6704364088811327759;'/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 541 ms.
Running link step : cd /tmp/ltsmin6704364088811327759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6704364088811327759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18348078609274343673.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 11:59:09] [INFO ] Flatten gal took : 36 ms
[2023-03-09 11:59:09] [INFO ] Flatten gal took : 26 ms
[2023-03-09 11:59:09] [INFO ] Time to serialize gal into /tmp/LTL6735158358488450905.gal : 4 ms
[2023-03-09 11:59:09] [INFO ] Time to serialize properties into /tmp/LTL9436783947370317635.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6735158358488450905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14844801224129478363.hoa' '-atoms' '/tmp/LTL9436783947370317635.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9436783947370317635.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14844801224129478363.hoa
Detected timeout of ITS tools.
[2023-03-09 11:59:24] [INFO ] Flatten gal took : 28 ms
[2023-03-09 11:59:24] [INFO ] Flatten gal took : 23 ms
[2023-03-09 11:59:24] [INFO ] Time to serialize gal into /tmp/LTL316367996154485100.gal : 3 ms
[2023-03-09 11:59:24] [INFO ] Time to serialize properties into /tmp/LTL6306931990641895365.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL316367996154485100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6306931990641895365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((X("((p173==0)||(p538==0))"))||(("(p132!=1)")U(("((p413!=1)&&(p132!=1))")||(G("(p132!=1)")))))))
Formula 0 simplified : F(X!"((p173==0)||(p538==0))" & (!"(p132!=1)" M !"((p413!=1)&&(p132!=1))"))
Detected timeout of ITS tools.
[2023-03-09 11:59:39] [INFO ] Flatten gal took : 29 ms
[2023-03-09 11:59:39] [INFO ] Applying decomposition
[2023-03-09 11:59:39] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4824329055013579587.txt' '-o' '/tmp/graph4824329055013579587.bin' '-w' '/tmp/graph4824329055013579587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4824329055013579587.bin' '-l' '-1' '-v' '-w' '/tmp/graph4824329055013579587.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:59:40] [INFO ] Decomposing Gal with order
[2023-03-09 11:59:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:59:40] [INFO ] Removed a total of 262 redundant transitions.
[2023-03-09 11:59:40] [INFO ] Flatten gal took : 31 ms
[2023-03-09 11:59:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2023-03-09 11:59:40] [INFO ] Time to serialize gal into /tmp/LTL8564302586200190272.gal : 6 ms
[2023-03-09 11:59:40] [INFO ] Time to serialize properties into /tmp/LTL3820367920294950626.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8564302586200190272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3820367920294950626.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("((i18.i1.u53.p173==0)||(i18.i1.u139.p538==0))"))||(("(i3.u42.p132!=1)")U(("((i0.i3.u118.p413!=1)&&(i3.u42.p132!=1))")||(G("(i...177
Formula 0 simplified : F(X!"((i18.i1.u53.p173==0)||(i18.i1.u139.p538==0))" & (!"(i3.u42.p132!=1)" M !"((i0.i3.u118.p413!=1)&&(i3.u42.p132!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t167, t239, t263, t272, t378, t379, t388, t389, t395, t400, i0.i0.u76.t161, ...1209
Computing Next relation with stutter on 1188 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12947081190028979390
[2023-03-09 11:59:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12947081190028979390
Running compilation step : cd /tmp/ltsmin12947081190028979390;'/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 769 ms.
Running link step : cd /tmp/ltsmin12947081190028979390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12947081190028979390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 105689 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)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 32 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-09 12:00:10] [INFO ] Computed 90 place invariants in 6 ms
[2023-03-09 12:00:10] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-09 12:00:10] [INFO ] Invariant cache hit.
[2023-03-09 12:00:10] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-09 12:00:10] [INFO ] Invariant cache hit.
[2023-03-09 12:00:11] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 857 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s402 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-09 finished in 1618 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)))'
Support contains 1 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 449 transition count 397
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 449 transition count 397
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 446 transition count 394
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 446 transition count 394
Applied a total of 22 rules in 19 ms. Remains 446 /457 variables (removed 11) and now considering 394/405 (removed 11) transitions.
[2023-03-09 12:00:11] [INFO ] Invariant cache hit.
[2023-03-09 12:00:12] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-09 12:00:12] [INFO ] Invariant cache hit.
[2023-03-09 12:00:12] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-09 12:00:12] [INFO ] Invariant cache hit.
[2023-03-09 12:00:12] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/457 places, 394/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 446/457 places, 394/405 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s360 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-13-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-13-LTLFireability-12 finished in 1653 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(G((((F(p0) U p1)||F(G(p2))) U p3))))'
Support contains 6 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 450 transition count 398
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 450 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 448 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 448 transition count 396
Applied a total of 18 rules in 35 ms. Remains 448 /457 variables (removed 9) and now considering 396/405 (removed 9) transitions.
// Phase 1: matrix 396 rows 448 cols
[2023-03-09 12:00:13] [INFO ] Computed 90 place invariants in 6 ms
[2023-03-09 12:00:13] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-09 12:00:13] [INFO ] Invariant cache hit.
[2023-03-09 12:00:14] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2023-03-09 12:00:14] [INFO ] Invariant cache hit.
[2023-03-09 12:00:14] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 448/457 places, 396/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 448/457 places, 396/405 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s105 1) (EQ s331 1) (EQ s413 1)), p1:(EQ s214 1), p0:(EQ s376 1), p2:(NEQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 712 reset in 261 ms.
Stack based approach found an accepted trace after 82831 steps with 593 reset with depth 243 and stack size 233 in 206 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 1822 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(X((p0 U G(p1)))))'
Support contains 2 out of 457 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 450 transition count 398
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 450 transition count 398
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 447 transition count 395
Applied a total of 20 rules in 38 ms. Remains 447 /457 variables (removed 10) and now considering 395/405 (removed 10) transitions.
// Phase 1: matrix 395 rows 447 cols
[2023-03-09 12:00:15] [INFO ] Computed 90 place invariants in 6 ms
[2023-03-09 12:00:15] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-09 12:00:15] [INFO ] Invariant cache hit.
[2023-03-09 12:00:16] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-09 12:00:16] [INFO ] Invariant cache hit.
[2023-03-09 12:00:16] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/457 places, 395/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 447/457 places, 395/405 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s326 1), p0:(EQ s390 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 1332 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((X(p0)||(p1 U (p2||G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLFireability-08
Stuttering acceptance computed with spot in 244 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 457/457 places, 405/405 transitions.
Graph (trivial) has 210 edges and 457 vertex of which 6 / 457 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 1032 edges and 452 vertex of which 451 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 450 transition count 346
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 399 transition count 346
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 104 place count 399 transition count 254
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 304 place count 291 transition count 254
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 284 transition count 247
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 284 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 318 place count 284 transition count 246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 283 transition count 246
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 552 place count 165 transition count 132
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 554 place count 164 transition count 136
Applied a total of 554 rules in 51 ms. Remains 164 /457 variables (removed 293) and now considering 136/405 (removed 269) transitions.
// Phase 1: matrix 136 rows 164 cols
[2023-03-09 12:00:17] [INFO ] Computed 70 place invariants in 7 ms
[2023-03-09 12:00:17] [INFO ] Implicit Places using invariants in 160 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 23, 24, 25, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 165 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 146/457 places, 136/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 220 ms. Remains : 146/457 places, 136/405 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s92 1) (NEQ s11 1)), p1:(NEQ s11 1), p0:(OR (EQ s17 0) (EQ s117 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21541 reset in 234 ms.
Product exploration explored 100000 steps with 21670 reset in 244 ms.
Computed a total of 13 stabilizing places and 11 stable transitions
Computed a total of 13 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1035 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2509 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 772 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 751 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 771 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 766 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 724 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 136 rows 146 cols
[2023-03-09 12:00:19] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-09 12:00:19] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 12:00:19] [INFO ] [Real]Absence check using 33 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-09 12:00:19] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 12:00:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-09 12:00:19] [INFO ] [Nat]Absence check using 33 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-09 12:00:19] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-09 12:00:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:00:19] [INFO ] After 28ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-09 12:00:19] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 12:00:20] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 4 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (AND p2 p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X p2)), true, (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 21 factoid took 1212 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 136/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2023-03-09 12:00:21] [INFO ] Invariant cache hit.
[2023-03-09 12:00:21] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 12:00:21] [INFO ] Invariant cache hit.
[2023-03-09 12:00:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 12:00:22] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [1, 3, 7, 10, 13, 38, 39, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 74, 76, 78, 86, 88, 90, 94, 95]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 364 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/146 places, 136/136 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 130
Applied a total of 8 rules in 4 ms. Remains 111 /115 variables (removed 4) and now considering 130/136 (removed 6) transitions.
// Phase 1: matrix 130 rows 111 cols
[2023-03-09 12:00:22] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-09 12:00:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-09 12:00:22] [INFO ] Invariant cache hit.
[2023-03-09 12:00:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:00:22] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/146 places, 130/136 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 593 ms. Remains : 111/146 places, 130/136 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 364 edges and 111 vertex of which 97 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 879 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2451 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 742 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 782 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 778 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 703 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 12:00:23] [INFO ] Invariant cache hit.
[2023-03-09 12:00:23] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 12:00:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 12:00:23] [INFO ] [Nat]Absence check using 7 positive and 16 generalized place invariants in 7 ms returned sat
[2023-03-09 12:00:23] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 12:00:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:00:23] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 12:00:23] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 12:00:23] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 18 factoid took 1178 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 21765 reset in 137 ms.
Product exploration explored 100000 steps with 21747 reset in 153 ms.
Built C files in :
/tmp/ltsmin16003753519965280534
[2023-03-09 12:00:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16003753519965280534
Running compilation step : cd /tmp/ltsmin16003753519965280534;'/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 336 ms.
Running link step : cd /tmp/ltsmin16003753519965280534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16003753519965280534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15845024103286606099.hoa' '--buchi-type=spotba'
LTSmin run took 1174 ms.
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 11048 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-09 12:00:27] [INFO ] Flatten gal took : 10 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 237862 ms.

BK_STOP 1678363228693

--------------------
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-13"
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-13, 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-167813690500548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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