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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 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 189K 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-19-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678364608583

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-19
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 12:23:30] [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 12:23:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:23:30] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-09 12:23:30] [INFO ] Transformed 772 places.
[2023-03-09 12:23:30] [INFO ] Transformed 685 transitions.
[2023-03-09 12:23:30] [INFO ] Found NUPN structural information;
[2023-03-09 12:23:30] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 15 places in 17 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 109 place count 648 transition count 569
Iterating global reduction 1 with 101 rules applied. Total rules applied 210 place count 648 transition count 569
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 261 place count 597 transition count 518
Iterating global reduction 1 with 51 rules applied. Total rules applied 312 place count 597 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 313 place count 596 transition count 517
Iterating global reduction 1 with 1 rules applied. Total rules applied 314 place count 596 transition count 517
Applied a total of 314 rules in 148 ms. Remains 596 /757 variables (removed 161) and now considering 517/670 (removed 153) transitions.
// Phase 1: matrix 517 rows 596 cols
[2023-03-09 12:23:30] [INFO ] Computed 117 place invariants in 32 ms
[2023-03-09 12:23:30] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-09 12:23:30] [INFO ] Invariant cache hit.
[2023-03-09 12:23:31] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2023-03-09 12:23:31] [INFO ] Invariant cache hit.
[2023-03-09 12:23:32] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/757 places, 517/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1609 ms. Remains : 596/757 places, 517/670 transitions.
Support contains 44 out of 596 places after structural reductions.
[2023-03-09 12:23:32] [INFO ] Flatten gal took : 61 ms
[2023-03-09 12:23:32] [INFO ] Flatten gal took : 28 ms
[2023-03-09 12:23:32] [INFO ] Input system was already deterministic with 517 transitions.
Support contains 43 out of 596 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-09 12:23:33] [INFO ] Invariant cache hit.
[2023-03-09 12:23:33] [INFO ] [Real]Absence check using 70 positive place invariants in 22 ms returned sat
[2023-03-09 12:23:33] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 19 ms returned sat
[2023-03-09 12:23:33] [INFO ] After 222ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:19
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 6 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 0 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 0 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 0 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 0 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 0 ms to minimize.
[2023-03-09 12:23:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 988 ms
[2023-03-09 12:23:34] [INFO ] After 1238ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-09 12:23:34] [INFO ] After 1584ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-09 12:23:35] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-09 12:23:35] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 17 ms returned sat
[2023-03-09 12:23:35] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :18
[2023-03-09 12:23:35] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2023-03-09 12:23:36] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:23:36] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:23:36] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2023-03-09 12:23:36] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:23:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 878 ms
[2023-03-09 12:23:36] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-09 12:23:37] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:23:37] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2023-03-09 12:23:37] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:23:37] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2023-03-09 12:23:37] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2023-03-09 12:23:37] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 0 ms to minimize.
[2023-03-09 12:23:37] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 0 ms to minimize.
[2023-03-09 12:23:38] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2023-03-09 12:23:38] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 0 ms to minimize.
[2023-03-09 12:23:38] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 0 ms to minimize.
[2023-03-09 12:23:38] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 0 ms to minimize.
[2023-03-09 12:23:38] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 1 ms to minimize.
[2023-03-09 12:23:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1851 ms
[2023-03-09 12:23:38] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:23:39] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2023-03-09 12:23:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2023-03-09 12:23:39] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2023-03-09 12:23:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-09 12:23:39] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 1 ms to minimize.
[2023-03-09 12:23:39] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:23:39] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 1 ms to minimize.
[2023-03-09 12:23:40] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:23:40] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 1 ms to minimize.
[2023-03-09 12:23:40] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:23:40] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 0 ms to minimize.
[2023-03-09 12:23:40] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 0 ms to minimize.
[2023-03-09 12:23:40] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:23:40] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:23:41] [INFO ] Deduced a trap composed of 104 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:23:41] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:23:41] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:23:41] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:23:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2331 ms
[2023-03-09 12:23:41] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2023-03-09 12:23:41] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-09 12:23:42] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2023-03-09 12:23:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2023-03-09 12:23:42] [INFO ] After 7138ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :18
Attempting to minimize the solution found.
Minimization took 453 ms.
[2023-03-09 12:23:42] [INFO ] After 7932ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :18
Fused 21 Parikh solutions to 18 different solutions.
Parikh walk visited 2 properties in 412 ms.
Support contains 23 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (complete) has 1320 edges and 596 vertex of which 595 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
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 595 transition count 453
Reduce places removed 63 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 66 rules applied. Total rules applied 130 place count 532 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 529 transition count 450
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 133 place count 529 transition count 334
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 388 place count 390 transition count 334
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 393 place count 385 transition count 329
Iterating global reduction 3 with 5 rules applied. Total rules applied 398 place count 385 transition count 329
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 710 place count 227 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 711 place count 227 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 713 place count 226 transition count 177
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 720 place count 226 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 721 place count 225 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 722 place count 224 transition count 176
Applied a total of 722 rules in 118 ms. Remains 224 /596 variables (removed 372) and now considering 176/517 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 224/596 places, 176/517 transitions.
Incomplete random walk after 10000 steps, including 1172 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 348 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 350 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 337 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 347 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 368 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 362 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 346 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 319 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 176 rows 224 cols
[2023-03-09 12:23:44] [INFO ] Computed 89 place invariants in 5 ms
[2023-03-09 12:23:44] [INFO ] [Real]Absence check using 69 positive place invariants in 8 ms returned sat
[2023-03-09 12:23:44] [INFO ] [Real]Absence check using 69 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-09 12:23:44] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 12:23:44] [INFO ] [Nat]Absence check using 69 positive place invariants in 8 ms returned sat
[2023-03-09 12:23:44] [INFO ] [Nat]Absence check using 69 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-09 12:23:44] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 12:23:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:23:44] [INFO ] After 102ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 0 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2023-03-09 12:23:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 435 ms
[2023-03-09 12:23:45] [INFO ] After 943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-09 12:23:45] [INFO ] After 1299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 137 ms.
Support contains 14 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 176/176 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 224 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 221 transition count 173
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 221 transition count 171
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 219 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 216 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 216 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 216 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 214 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 211 transition count 164
Applied a total of 25 rules in 57 ms. Remains 211 /224 variables (removed 13) and now considering 164/176 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 211/224 places, 164/176 transitions.
Incomplete random walk after 10000 steps, including 1361 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 436 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 426 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 443 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 429 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 164 rows 211 cols
[2023-03-09 12:23:46] [INFO ] Computed 88 place invariants in 3 ms
[2023-03-09 12:23:46] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 12:23:47] [INFO ] [Nat]Absence check using 69 positive place invariants in 10 ms returned sat
[2023-03-09 12:23:47] [INFO ] [Nat]Absence check using 69 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-09 12:23:47] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 12:23:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 12:23:47] [INFO ] After 98ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 12:23:47] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2023-03-09 12:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 12:23:47] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2023-03-09 12:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 12:23:47] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-09 12:23:47] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 59 ms.
Support contains 11 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 164/164 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 211 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 162
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 0 with 4 rules applied. Total rules applied 9 place count 206 transition count 160
Applied a total of 9 rules in 16 ms. Remains 206 /211 variables (removed 5) and now considering 160/164 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 206/211 places, 160/164 transitions.
Incomplete random walk after 10000 steps, including 1356 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 441 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 430 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Finished probabilistic random walk after 1531 steps, run visited all 7 properties in 39 ms. (steps per millisecond=39 )
Probabilistic random walk after 1531 steps, saw 602 distinct states, run finished after 40 ms. (steps per millisecond=38 ) properties seen :7
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-19-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 537 stabilizing places and 468 stable transitions
Graph (complete) has 1320 edges and 596 vertex of which 595 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.23 ms
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))||p0)))'
Support contains 3 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 284 edges and 596 vertex of which 6 / 596 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1314 edges and 591 vertex of which 590 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 589 transition count 438
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 518 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 146 place count 517 transition count 316
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 412 place count 372 transition count 316
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 422 place count 362 transition count 306
Iterating global reduction 3 with 10 rules applied. Total rules applied 432 place count 362 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 432 place count 362 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 435 place count 360 transition count 305
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 751 place count 200 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 753 place count 199 transition count 152
Applied a total of 753 rules in 86 ms. Remains 199 /596 variables (removed 397) and now considering 152/517 (removed 365) transitions.
// Phase 1: matrix 152 rows 199 cols
[2023-03-09 12:23:49] [INFO ] Computed 88 place invariants in 5 ms
[2023-03-09 12:23:49] [INFO ] Implicit Places using invariants in 173 ms returned [1, 2, 3, 4, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 62, 63, 64, 173]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 180 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/596 places, 152/517 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 171/596 places, 152/517 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s37 1) (EQ s11 1)), p1:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9898 steps with 2086 reset in 92 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-00 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 286 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 146 place count 517 transition count 314
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 417 place count 369 transition count 314
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 428 place count 358 transition count 303
Iterating global reduction 2 with 11 rules applied. Total rules applied 439 place count 358 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 439 place count 358 transition count 301
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 444 place count 355 transition count 301
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 756 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 758 place count 196 transition count 150
Applied a total of 758 rules in 58 ms. Remains 196 /596 variables (removed 400) and now considering 150/517 (removed 367) transitions.
// Phase 1: matrix 150 rows 196 cols
[2023-03-09 12:23:49] [INFO ] Computed 87 place invariants in 3 ms
[2023-03-09 12:23:50] [INFO ] Implicit Places using invariants in 171 ms returned [1, 2, 3, 4, 5, 13, 14, 18, 19, 20, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 174 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/596 places, 150/517 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 239 ms. Remains : 169/596 places, 150/517 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-01 finished in 301 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(F(p0))))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 582 transition count 503
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 582 transition count 503
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 578 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 578 transition count 499
Applied a total of 36 rules in 41 ms. Remains 578 /596 variables (removed 18) and now considering 499/517 (removed 18) transitions.
// Phase 1: matrix 499 rows 578 cols
[2023-03-09 12:23:50] [INFO ] Computed 117 place invariants in 10 ms
[2023-03-09 12:23:50] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-09 12:23:50] [INFO ] Invariant cache hit.
[2023-03-09 12:23:50] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-09 12:23:51] [INFO ] Invariant cache hit.
[2023-03-09 12:23:51] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 578/596 places, 499/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 578/596 places, 499/517 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s161 0) (EQ s515 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 376 ms.
Product exploration explored 100000 steps with 33333 reset in 516 ms.
Computed a total of 521 stabilizing places and 452 stable transitions
Graph (complete) has 1293 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 521 stabilizing places and 452 stable transitions
Detected a total of 521/578 stabilizing places and 452/499 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-02 finished in 2373 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 U p1))))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 286 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 146 place count 517 transition count 315
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 415 place count 370 transition count 315
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 426 place count 359 transition count 304
Iterating global reduction 2 with 11 rules applied. Total rules applied 437 place count 359 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 437 place count 359 transition count 302
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 442 place count 356 transition count 302
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 314 rules applied. Total rules applied 756 place count 197 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 758 place count 196 transition count 150
Applied a total of 758 rules in 85 ms. Remains 196 /596 variables (removed 400) and now considering 150/517 (removed 367) transitions.
// Phase 1: matrix 150 rows 196 cols
[2023-03-09 12:23:52] [INFO ] Computed 87 place invariants in 3 ms
[2023-03-09 12:23:52] [INFO ] Implicit Places using invariants in 164 ms returned [1, 2, 3, 4, 14, 15, 16, 17, 18, 19, 22, 23, 24, 25, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 165 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/596 places, 150/517 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 169/596 places, 150/517 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 1), p0:(NEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-03 finished in 375 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' '!(((p0&&G(p1)) U X(p0)))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 584 transition count 505
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 580 transition count 501
Applied a total of 32 rules in 48 ms. Remains 580 /596 variables (removed 16) and now considering 501/517 (removed 16) transitions.
// Phase 1: matrix 501 rows 580 cols
[2023-03-09 12:23:52] [INFO ] Computed 117 place invariants in 6 ms
[2023-03-09 12:23:53] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-09 12:23:53] [INFO ] Invariant cache hit.
[2023-03-09 12:23:53] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-09 12:23:53] [INFO ] Invariant cache hit.
[2023-03-09 12:23:54] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/596 places, 501/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1185 ms. Remains : 580/596 places, 501/517 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), 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=[p0:(NEQ s435 1), p1:(NEQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Product exploration explored 100000 steps with 50000 reset in 520 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1295 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-07 finished in 2714 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' '!(((!p0 U (p1||G(!p0))) U p2))'
Support contains 6 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 284 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 589 transition count 438
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 518 transition count 438
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 144 place count 518 transition count 317
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 411 place count 372 transition count 317
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 422 place count 361 transition count 306
Iterating global reduction 2 with 11 rules applied. Total rules applied 433 place count 361 transition count 306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 433 place count 361 transition count 304
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 438 place count 358 transition count 304
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 746 place count 202 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 748 place count 201 transition count 155
Applied a total of 748 rules in 65 ms. Remains 201 /596 variables (removed 395) and now considering 155/517 (removed 362) transitions.
// Phase 1: matrix 155 rows 201 cols
[2023-03-09 12:23:55] [INFO ] Computed 87 place invariants in 4 ms
[2023-03-09 12:23:55] [INFO ] Implicit Places using invariants in 185 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 22, 23, 24, 25, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 187 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/596 places, 155/517 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 173/596 places, 155/517 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), true, (AND (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s65 1) (EQ s36 1)), p1:(AND (NEQ s67 1) (NOT (AND (EQ s8 1) (EQ s80 1) (EQ s118 1)))), p0:(AND (EQ s8 1) (EQ s80 1) (EQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-10 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 285 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 146 place count 517 transition count 315
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 415 place count 370 transition count 315
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 426 place count 359 transition count 304
Iterating global reduction 2 with 11 rules applied. Total rules applied 437 place count 359 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 437 place count 359 transition count 302
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 442 place count 356 transition count 302
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 754 place count 198 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 756 place count 197 transition count 151
Applied a total of 756 rules in 69 ms. Remains 197 /596 variables (removed 399) and now considering 151/517 (removed 366) transitions.
// Phase 1: matrix 151 rows 197 cols
[2023-03-09 12:23:56] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-09 12:23:56] [INFO ] Implicit Places using invariants in 191 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 56, 57, 58, 59, 60, 61]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 192 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/596 places, 151/517 transitions.
Applied a total of 0 rules in 17 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 170/596 places, 151/517 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s39 0), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-13 finished in 574 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 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Graph (trivial) has 287 edges and 596 vertex of which 6 / 596 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 1314 edges and 591 vertex of which 590 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 589 transition count 437
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 517 transition count 437
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 146 place count 517 transition count 314
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 417 place count 369 transition count 314
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 429 place count 357 transition count 302
Iterating global reduction 2 with 12 rules applied. Total rules applied 441 place count 357 transition count 302
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 441 place count 357 transition count 300
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 446 place count 354 transition count 300
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 758 place count 196 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 760 place count 195 transition count 149
Applied a total of 760 rules in 65 ms. Remains 195 /596 variables (removed 401) and now considering 149/517 (removed 368) transitions.
// Phase 1: matrix 149 rows 195 cols
[2023-03-09 12:23:56] [INFO ] Computed 87 place invariants in 1 ms
[2023-03-09 12:23:56] [INFO ] Implicit Places using invariants in 274 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 286 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/596 places, 149/517 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 167/596 places, 149/517 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s128 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21471 reset in 206 ms.
Product exploration explored 100000 steps with 21405 reset in 298 ms.
Computed a total of 144 stabilizing places and 131 stable transitions
Computed a total of 144 stabilizing places and 131 stable transitions
Detected a total of 144/167 stabilizing places and 131/149 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 : []
Knowledge based reduction with 4 factoid took 319 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 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2459 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 757 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 6 ms. (steps per millisecond=29 )
Probabilistic random walk after 174 steps, saw 111 distinct states, run finished after 6 ms. (steps per millisecond=29 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 149/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 167 /167 variables (removed 0) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 167 cols
[2023-03-09 12:23:58] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-09 12:23:58] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-09 12:23:58] [INFO ] Invariant cache hit.
[2023-03-09 12:23:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:23:58] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [1, 3, 5, 10, 33, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 59, 74, 76, 80, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 542 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/167 places, 149/149 transitions.
Graph (complete) has 424 edges and 133 vertex of which 122 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 122 transition count 131
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 109 transition count 131
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 40 place count 96 transition count 90
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 96 transition count 90
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 96 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 93 transition count 87
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 62 place count 90 transition count 84
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 90 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 90 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 89 transition count 81
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 84 place count 81 transition count 74
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 6 with 2 rules applied. Total rules applied 86 place count 80 transition count 73
Applied a total of 86 rules in 13 ms. Remains 80 /133 variables (removed 53) and now considering 73/149 (removed 76) transitions.
// Phase 1: matrix 73 rows 80 cols
[2023-03-09 12:23:58] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-09 12:23:58] [INFO ] Implicit Places using invariants in 68 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/167 places, 73/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 633 ms. Remains : 77/167 places, 73/149 transitions.
Computed a total of 54 stabilizing places and 55 stable transitions
Computed a total of 54 stabilizing places and 55 stable transitions
Detected a total of 54/77 stabilizing places and 55/73 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 : []
Knowledge based reduction with 4 factoid took 116 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)]
Incomplete random walk after 10000 steps, including 2511 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 735 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 132 steps, run visited all 1 properties in 4 ms. (steps per millisecond=33 )
Probabilistic random walk after 132 steps, saw 83 distinct states, run finished after 5 ms. (steps per millisecond=26 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 136 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21898 reset in 98 ms.
Product exploration explored 100000 steps with 21865 reset in 90 ms.
Built C files in :
/tmp/ltsmin8722293155287065039
[2023-03-09 12:23:59] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2023-03-09 12:23:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:23:59] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2023-03-09 12:23:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:23:59] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2023-03-09 12:23:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:23:59] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8722293155287065039
Running compilation step : cd /tmp/ltsmin8722293155287065039;'/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 339 ms.
Running link step : cd /tmp/ltsmin8722293155287065039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin8722293155287065039;'/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/stateBased9680084103146867748.hoa' '--buchi-type=spotba'
LTSmin run took 1955 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLFireability-14 finished in 5318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((X(X(G(!p1)))||(p2 U p1)))))'
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 517/517 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 584 transition count 505
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 580 transition count 501
Applied a total of 32 rules in 27 ms. Remains 580 /596 variables (removed 16) and now considering 501/517 (removed 16) transitions.
// Phase 1: matrix 501 rows 580 cols
[2023-03-09 12:24:01] [INFO ] Computed 117 place invariants in 4 ms
[2023-03-09 12:24:02] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-09 12:24:02] [INFO ] Invariant cache hit.
[2023-03-09 12:24:03] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-03-09 12:24:03] [INFO ] Invariant cache hit.
[2023-03-09 12:24:03] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/596 places, 501/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1384 ms. Remains : 580/596 places, 501/517 transitions.
Stuttering acceptance computed with spot in 252 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s378 1) (EQ s487 1)), p1:(AND (EQ s127 1) (EQ s405 1) (EQ s545 1)), p2:(EQ s487 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 553 reset in 231 ms.
Product exploration explored 100000 steps with 556 reset in 230 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 717 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 12:24:05] [INFO ] Invariant cache hit.
[2023-03-09 12:24:05] [INFO ] [Real]Absence check using 70 positive place invariants in 23 ms returned sat
[2023-03-09 12:24:05] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-09 12:24:05] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 12:24:06] [INFO ] [Nat]Absence check using 70 positive place invariants in 19 ms returned sat
[2023-03-09 12:24:06] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-09 12:24:06] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 12:24:06] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:24:06] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 0 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 1 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 0 ms to minimize.
[2023-03-09 12:24:07] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 0 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1989 ms
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2023-03-09 12:24:08] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:24:09] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2023-03-09 12:24:09] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2023-03-09 12:24:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 661 ms
[2023-03-09 12:24:09] [INFO ] After 3287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-09 12:24:09] [INFO ] After 3640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 579 transition count 437
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 516 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 514 transition count 435
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 131 place count 514 transition count 311
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 404 place count 365 transition count 311
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 323 rules applied. Total rules applied 727 place count 201 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 728 place count 201 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 730 place count 200 transition count 154
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 200 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 199 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 198 transition count 153
Applied a total of 738 rules in 82 ms. Remains 198 /580 variables (removed 382) and now considering 153/501 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 198/580 places, 153/501 transitions.
Incomplete random walk after 10000 steps, including 1068 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 278 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 267 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 153 rows 198 cols
[2023-03-09 12:24:10] [INFO ] Computed 86 place invariants in 1 ms
[2023-03-09 12:24:10] [INFO ] [Real]Absence check using 70 positive place invariants in 10 ms returned sat
[2023-03-09 12:24:10] [INFO ] [Real]Absence check using 70 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-09 12:24:10] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 12:24:10] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-09 12:24:10] [INFO ] [Nat]Absence check using 70 positive and 16 generalized place invariants in 6 ms returned sat
[2023-03-09 12:24:10] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 12:24:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:24:10] [INFO ] After 140ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 12:24:10] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-09 12:24:10] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 153/153 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 153/153 transitions.
Incomplete random walk after 10000 steps, including 1088 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1437 steps, run visited all 2 properties in 20 ms. (steps per millisecond=71 )
Probabilistic random walk after 1437 steps, saw 779 distinct states, run finished after 20 ms. (steps per millisecond=71 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 12 factoid took 1088 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 406 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 18 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2023-03-09 12:24:13] [INFO ] Computed 117 place invariants in 9 ms
[2023-03-09 12:24:13] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 12:24:13] [INFO ] Invariant cache hit.
[2023-03-09 12:24:14] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-03-09 12:24:14] [INFO ] Invariant cache hit.
[2023-03-09 12:24:14] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1363 ms. Remains : 580/580 places, 501/501 transitions.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 549 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 754942 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 754942 steps, saw 116810 distinct states, run finished after 3002 ms. (steps per millisecond=251 ) properties seen :5
Running SMT prover for 1 properties.
[2023-03-09 12:24:18] [INFO ] Invariant cache hit.
[2023-03-09 12:24:19] [INFO ] [Real]Absence check using 70 positive place invariants in 25 ms returned sat
[2023-03-09 12:24:19] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 17 ms returned sat
[2023-03-09 12:24:19] [INFO ] After 200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 12:24:19] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:24:19] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-03-09 12:24:19] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 14 ms to minimize.
[2023-03-09 12:24:19] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2023-03-09 12:24:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2023-03-09 12:24:19] [INFO ] After 619ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:24:19] [INFO ] After 767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 12:24:19] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-09 12:24:19] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 18 ms returned sat
[2023-03-09 12:24:19] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 12:24:20] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-09 12:24:20] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 1 ms to minimize.
[2023-03-09 12:24:20] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 0 ms to minimize.
[2023-03-09 12:24:20] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 0 ms to minimize.
[2023-03-09 12:24:20] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:24:20] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 0 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 0 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 1 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 1 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 0 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 109 places in 105 ms of which 0 ms to minimize.
[2023-03-09 12:24:21] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 1 ms to minimize.
[2023-03-09 12:24:22] [INFO ] Deduced a trap composed of 120 places in 102 ms of which 0 ms to minimize.
[2023-03-09 12:24:22] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 0 ms to minimize.
[2023-03-09 12:24:22] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 0 ms to minimize.
[2023-03-09 12:24:22] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 0 ms to minimize.
[2023-03-09 12:24:22] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:24:22] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 1 ms to minimize.
[2023-03-09 12:24:22] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:24:23] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 0 ms to minimize.
[2023-03-09 12:24:23] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 0 ms to minimize.
[2023-03-09 12:24:23] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 0 ms to minimize.
[2023-03-09 12:24:23] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:24:23] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:24:23] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2023-03-09 12:24:23] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3749 ms
[2023-03-09 12:24:23] [INFO ] After 3937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 12:24:23] [INFO ] After 4075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 269 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1289 edges and 575 vertex of which 574 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 306
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 306
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 323 rules applied. Total rules applied 724 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 726 place count 197 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 197 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 730 place count 195 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 731 place count 195 transition count 148
Applied a total of 731 rules in 28 ms. Remains 195 /580 variables (removed 385) and now considering 148/501 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 195/580 places, 148/501 transitions.
Incomplete random walk after 10000 steps, including 449 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 12 factoid took 696 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 552 reset in 196 ms.
Product exploration explored 100000 steps with 556 reset in 226 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 225 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 579 transition count 500
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 579 transition count 566
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 579 transition count 566
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 557 transition count 525
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 557 transition count 525
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 557 transition count 525
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 436 place count 511 transition count 479
Deduced a syphon composed of 277 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 482 place count 511 transition count 479
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 485 place count 511 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 486 place count 511 transition count 490
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 489 place count 508 transition count 484
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 492 place count 508 transition count 484
Deduced a syphon composed of 277 places in 0 ms
Applied a total of 492 rules in 102 ms. Remains 508 /580 variables (removed 72) and now considering 484/501 (removed 17) transitions.
[2023-03-09 12:24:26] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 484 rows 508 cols
[2023-03-09 12:24:26] [INFO ] Computed 117 place invariants in 9 ms
[2023-03-09 12:24:26] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/580 places, 484/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 630 ms. Remains : 508/580 places, 484/501 transitions.
Built C files in :
/tmp/ltsmin14146707826809136546
[2023-03-09 12:24:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14146707826809136546
Running compilation step : cd /tmp/ltsmin14146707826809136546;'/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 665 ms.
Running link step : cd /tmp/ltsmin14146707826809136546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14146707826809136546;'/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/stateBased9606673732933082470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 12 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2023-03-09 12:24:41] [INFO ] Computed 117 place invariants in 6 ms
[2023-03-09 12:24:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-09 12:24:41] [INFO ] Invariant cache hit.
[2023-03-09 12:24:42] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2023-03-09 12:24:42] [INFO ] Invariant cache hit.
[2023-03-09 12:24:42] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1067 ms. Remains : 580/580 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin4055759101602401192
[2023-03-09 12:24:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4055759101602401192
Running compilation step : cd /tmp/ltsmin4055759101602401192;'/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 703 ms.
Running link step : cd /tmp/ltsmin4055759101602401192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4055759101602401192;'/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/stateBased9750760585712577403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 12:24:58] [INFO ] Flatten gal took : 40 ms
[2023-03-09 12:24:58] [INFO ] Flatten gal took : 23 ms
[2023-03-09 12:24:58] [INFO ] Time to serialize gal into /tmp/LTL4742010709063627504.gal : 5 ms
[2023-03-09 12:24:58] [INFO ] Time to serialize properties into /tmp/LTL17081439558112025548.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/LTL4742010709063627504.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11099479486533475623.hoa' '-atoms' '/tmp/LTL17081439558112025548.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...319
Loading property file /tmp/LTL17081439558112025548.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11099479486533475623.hoa
Detected timeout of ITS tools.
[2023-03-09 12:25:13] [INFO ] Flatten gal took : 39 ms
[2023-03-09 12:25:13] [INFO ] Flatten gal took : 30 ms
[2023-03-09 12:25:13] [INFO ] Time to serialize gal into /tmp/LTL12700469919324370567.gal : 10 ms
[2023-03-09 12:25:13] [INFO ] Time to serialize properties into /tmp/LTL11172473056742034742.ltl : 16 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/LTL12700469919324370567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11172473056742034742.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...277
Read 1 LTL properties
Checking formula 0 : !(((F("((p449==1)&&(p606==1))"))U(X((X(X(G(!("(((p146==1)&&(p482==1))&&(p737==1))")))))||(("(p606==1)")U("(((p146==1)&&(p482==1))&&(p7...169
Formula 0 simplified : G!"((p449==1)&&(p606==1))" R X(XXF"(((p146==1)&&(p482==1))&&(p737==1))" & (!"(p606==1)" R !"(((p146==1)&&(p482==1))&&(p737==1))"))
Detected timeout of ITS tools.
[2023-03-09 12:25:28] [INFO ] Flatten gal took : 19 ms
[2023-03-09 12:25:28] [INFO ] Applying decomposition
[2023-03-09 12:25:28] [INFO ] Flatten gal took : 18 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/graph2519188755737340988.txt' '-o' '/tmp/graph2519188755737340988.bin' '-w' '/tmp/graph2519188755737340988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2519188755737340988.bin' '-l' '-1' '-v' '-w' '/tmp/graph2519188755737340988.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:25:28] [INFO ] Decomposing Gal with order
[2023-03-09 12:25:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:25:28] [INFO ] Removed a total of 288 redundant transitions.
[2023-03-09 12:25:28] [INFO ] Flatten gal took : 81 ms
[2023-03-09 12:25:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2023-03-09 12:25:28] [INFO ] Time to serialize gal into /tmp/LTL18237177759739655186.gal : 9 ms
[2023-03-09 12:25:28] [INFO ] Time to serialize properties into /tmp/LTL16053526993854072031.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/LTL18237177759739655186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16053526993854072031.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...256
Read 1 LTL properties
Checking formula 0 : !(((F("((i19.u134.p449==1)&&(i20.u158.p606==1))"))U(X((X(X(G(!("(((i7.u47.p146==1)&&(i9.u142.p482==1))&&(i20.u158.p737==1))")))))||(("...244
Formula 0 simplified : G!"((i19.u134.p449==1)&&(i20.u158.p606==1))" R X(XXF"(((i7.u47.p146==1)&&(i9.u142.p482==1))&&(i20.u158.p737==1))" & (!"(i20.u158.p60...228
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t310, t318, t324, t359, t404, t407, t480, t481, t485, t487, t489, t490, t492...1469
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6764769077083198762
[2023-03-09 12:25:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6764769077083198762
Running compilation step : cd /tmp/ltsmin6764769077083198762;'/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 711 ms.
Running link step : cd /tmp/ltsmin6764769077083198762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin6764769077083198762;'/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' '(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 117058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X((X(X(G(!p1)))||(p2 U p1)))))'
[2023-03-09 12:25:59] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1379279663791386611
[2023-03-09 12:25:59] [INFO ] Computing symmetric may disable matrix : 517 transitions.
[2023-03-09 12:25:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:25:59] [INFO ] Computing symmetric may enable matrix : 517 transitions.
[2023-03-09 12:25:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:25:59] [INFO ] Applying decomposition
[2023-03-09 12:25:59] [INFO ] Flatten gal took : 50 ms
[2023-03-09 12:25:59] [INFO ] Computing Do-Not-Accords matrix : 517 transitions.
[2023-03-09 12:25:59] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:25:59] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1379279663791386611
Running compilation step : cd /tmp/ltsmin1379279663791386611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
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/graph1947693771857539066.txt' '-o' '/tmp/graph1947693771857539066.bin' '-w' '/tmp/graph1947693771857539066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1947693771857539066.bin' '-l' '-1' '-v' '-w' '/tmp/graph1947693771857539066.weights' '-q' '0' '-e' '0.001'
[2023-03-09 12:25:59] [INFO ] Decomposing Gal with order
[2023-03-09 12:25:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:25:59] [INFO ] Removed a total of 282 redundant transitions.
[2023-03-09 12:25:59] [INFO ] Flatten gal took : 55 ms
[2023-03-09 12:25:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 10 ms.
[2023-03-09 12:25:59] [INFO ] Time to serialize gal into /tmp/LTLFireability13905647831512501894.gal : 17 ms
[2023-03-09 12:25:59] [INFO ] Time to serialize properties into /tmp/LTLFireability12197246351393557886.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/LTLFireability13905647831512501894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12197246351393557886.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...278
Read 1 LTL properties
Checking formula 0 : !(((F("((i13.i3.u142.p449==1)&&(i19.u167.p606==1))"))U(X((X(X(G(!("(((i6.i1.u53.p146==1)&&(i17.i0.u150.p482==1))&&(i19.u167.p737==1))"...261
Formula 0 simplified : G!"((i13.i3.u142.p449==1)&&(i19.u167.p606==1))" R X(XXF"(((i6.i1.u53.p146==1)&&(i17.i0.u150.p482==1))&&(i19.u167.p737==1))" & (!"(i1...245
Compilation finished in 1121 ms.
Running link step : cd /tmp/ltsmin1379279663791386611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin1379279663791386611;'/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' '(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t211, t296, t314, t324, t359, t404, t407, t480, t485, t489, t490, t492, t494, t5...1802
Computing Next relation with stutter on 109584 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.059: LTL layer: formula: (<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))
pins2lts-mc-linux64( 4/ 8), 0.059: "(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.059: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.126: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.162: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.167: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.168: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.436: DFS-FIFO for weak LTL, using special progress label 521
pins2lts-mc-linux64( 0/ 8), 0.436: There are 522 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.436: State length is 597, there are 536 groups
pins2lts-mc-linux64( 0/ 8), 0.436: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.436: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.436: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.436: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.909: ~1 levels ~960 states ~6288 transitions
pins2lts-mc-linux64( 2/ 8), 0.974: ~1 levels ~1920 states ~9944 transitions
pins2lts-mc-linux64( 2/ 8), 1.159: ~1 levels ~3840 states ~23000 transitions
pins2lts-mc-linux64( 2/ 8), 1.433: ~1 levels ~7680 states ~49896 transitions
pins2lts-mc-linux64( 7/ 8), 2.053: ~1 levels ~15360 states ~133944 transitions
pins2lts-mc-linux64( 7/ 8), 3.901: ~1 levels ~30720 states ~286368 transitions
pins2lts-mc-linux64( 7/ 8), 6.037: ~1 levels ~61440 states ~600584 transitions
pins2lts-mc-linux64( 7/ 8), 11.544: ~1 levels ~122880 states ~1245848 transitions
pins2lts-mc-linux64( 4/ 8), 21.655: ~1 levels ~245760 states ~2232296 transitions
pins2lts-mc-linux64( 4/ 8), 38.816: ~1 levels ~491520 states ~4666832 transitions
pins2lts-mc-linux64( 0/ 8), 60.288: ~1 levels ~983040 states ~10151232 transitions
pins2lts-mc-linux64( 6/ 8), 89.788: ~1 levels ~1966080 states ~20666120 transitions
pins2lts-mc-linux64( 0/ 8), 139.548: ~1 levels ~3932160 states ~44400040 transitions
pins2lts-mc-linux64( 6/ 8), 231.471: ~1 levels ~7864320 states ~91771256 transitions
pins2lts-mc-linux64( 6/ 8), 416.570: ~1 levels ~15728640 states ~191804656 transitions
pins2lts-mc-linux64( 4/ 8), 495.354: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 495.484:
pins2lts-mc-linux64( 0/ 8), 495.484: mean standard work distribution: 9.0% (states) 9.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 495.484:
pins2lts-mc-linux64( 0/ 8), 495.484: Explored 17392389 states 238078795 transitions, fanout: 13.689
pins2lts-mc-linux64( 0/ 8), 495.485: Total exploration time 494.980 sec (494.880 sec minimum, 494.921 sec on average)
pins2lts-mc-linux64( 0/ 8), 495.485: States per second: 35138, Transitions per second: 480987
pins2lts-mc-linux64( 0/ 8), 495.485:
pins2lts-mc-linux64( 0/ 8), 495.485: Progress states detected: 34494215
pins2lts-mc-linux64( 0/ 8), 495.485: Redundant explorations: -49.5789
pins2lts-mc-linux64( 0/ 8), 495.485:
pins2lts-mc-linux64( 0/ 8), 495.485: Queue width: 8B, total height: 29658679, memory: 226.28MB
pins2lts-mc-linux64( 0/ 8), 495.485: Tree memory: 519.2MB, 15.8 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 495.485: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 495.485: Stored 563 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 495.485: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 495.485: Est. total memory use: 745.4MB (~1250.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1379279663791386611;'/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' '(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1379279663791386611;'/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' '(<>((LTLAPp0==true)) U X((X(X([](!(LTLAPp1==true))))||((LTLAPp2==true) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-09 12:46:49] [INFO ] Applying decomposition
[2023-03-09 12:46:49] [INFO ] Flatten gal took : 20 ms
[2023-03-09 12:46:49] [INFO ] Decomposing Gal with order
[2023-03-09 12:46:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 12:46:49] [INFO ] Removed a total of 138 redundant transitions.
[2023-03-09 12:46:49] [INFO ] Flatten gal took : 58 ms
[2023-03-09 12:46:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 559 ms.
[2023-03-09 12:46:49] [INFO ] Time to serialize gal into /tmp/LTLFireability14031712727486259064.gal : 33 ms
[2023-03-09 12:46:49] [INFO ] Time to serialize properties into /tmp/LTLFireability16193913185711450344.ltl : 2 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/LTLFireability14031712727486259064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16193913185711450344.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...278
Read 1 LTL properties
Checking formula 0 : !(((F("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))"))U(X((X(X(G(!("(((...536
Formula 0 simplified : G!"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))" R X(XXF"(((i0.i0.i0....520
Detected timeout of ITS tools.
[2023-03-09 13:07:41] [INFO ] Flatten gal took : 273 ms
[2023-03-09 13:07:42] [INFO ] Input system was already deterministic with 517 transitions.
[2023-03-09 13:07:42] [INFO ] Transformed 596 places.
[2023-03-09 13:07:42] [INFO ] Transformed 517 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 13:08:12] [INFO ] Time to serialize gal into /tmp/LTLFireability6664733300858860458.gal : 10 ms
[2023-03-09 13:08:12] [INFO ] Time to serialize properties into /tmp/LTLFireability2037553483897961721.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/LTLFireability6664733300858860458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2037553483897961721.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((p449==1)&&(p606==1))"))U(X((X(X(G(!("(((p146==1)&&(p482==1))&&(p737==1))")))))||(("(p606==1)")U("(((p146==1)&&(p482==1))&&(p7...169
Formula 0 simplified : G!"((p449==1)&&(p606==1))" R X(XXF"(((p146==1)&&(p482==1))&&(p737==1))" & (!"(p606==1)" R !"(((p146==1)&&(p482==1))&&(p737==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 156916 kB
After kill :
MemTotal: 16393356 kB
MemFree: 14822156 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-19"
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-19, 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-167813690600596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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