Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716305587465

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:33:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:33:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:33:09] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-21 15:33:09] [INFO ] Transformed 567 places.
[2024-05-21 15:33:09] [INFO ] Transformed 508 transitions.
[2024-05-21 15:33:09] [INFO ] Found NUPN structural information;
[2024-05-21 15:33:09] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 75 place count 485 transition count 430
Iterating global reduction 1 with 71 rules applied. Total rules applied 146 place count 485 transition count 430
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 182 place count 449 transition count 394
Iterating global reduction 1 with 36 rules applied. Total rules applied 218 place count 449 transition count 394
Applied a total of 218 rules in 199 ms. Remains 449 /560 variables (removed 111) and now considering 394/501 (removed 107) transitions.
// Phase 1: matrix 394 rows 449 cols
[2024-05-21 15:33:10] [INFO ] Computed 91 invariants in 46 ms
[2024-05-21 15:33:10] [INFO ] Implicit Places using invariants in 596 ms returned []
[2024-05-21 15:33:10] [INFO ] Invariant cache hit.
[2024-05-21 15:33:11] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-21 15:33:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/449 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 63 places in 293 ms of which 67 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 88 places in 202 ms of which 13 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 2 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:33:22] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 6 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 2 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:33:23] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 6 ms to minimize.
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 2 ms to minimize.
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 4 ms to minimize.
[2024-05-21 15:33:24] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 6 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 4 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 6 ms to minimize.
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/111 constraints. Problems are: Problem set: 12 solved, 381 unsolved
[2024-05-21 15:33:25] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 92 places in 188 ms of which 3 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 2 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 84 places in 200 ms of which 2 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:33:26] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 2 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:33:27] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 2 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 80 places in 1662 ms of which 3 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2024-05-21 15:33:29] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 8 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 2 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 2 ms to minimize.
[2024-05-21 15:33:30] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/131 constraints. Problems are: Problem set: 21 solved, 372 unsolved
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 5 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:33:31] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 8 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 2 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 5 ms to minimize.
[2024-05-21 15:33:32] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 6 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 83 places in 186 ms of which 4 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:33:33] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 4 ms to minimize.
[2024-05-21 15:33:34] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 2 ms to minimize.
[2024-05-21 15:33:34] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 2 ms to minimize.
[2024-05-21 15:33:34] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 20/151 constraints. Problems are: Problem set: 24 solved, 369 unsolved
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:33:37] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 2 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 3 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:33:38] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 8 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 4 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 4 ms to minimize.
[2024-05-21 15:33:39] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 6 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 6 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 4 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 2 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 5 ms to minimize.
[2024-05-21 15:33:40] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 8 ms to minimize.
[2024-05-21 15:33:41] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 4 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 20/171 constraints. Problems are: Problem set: 26 solved, 367 unsolved
[2024-05-21 15:33:41] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:33:41] [INFO ] Deduced a trap composed of 81 places in 188 ms of which 5 ms to minimize.
SMT process timed out in 30462ms, After SMT, problems are : Problem set: 26 solved, 367 unsolved
Search for dead transitions found 26 dead transitions in 30505ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 449/560 places, 368/501 transitions.
Applied a total of 0 rules in 30 ms. Remains 449 /449 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31952 ms. Remains : 449/560 places, 368/501 transitions.
Support contains 47 out of 449 places after structural reductions.
[2024-05-21 15:33:41] [INFO ] Flatten gal took : 82 ms
[2024-05-21 15:33:41] [INFO ] Flatten gal took : 35 ms
[2024-05-21 15:33:42] [INFO ] Input system was already deterministic with 368 transitions.
RANDOM walk for 40000 steps (300 resets) in 1747 ms. (22 steps per ms) remains 11/28 properties
BEST_FIRST walk for 40004 steps (36 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (51 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (53 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (55 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (55 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (55 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (53 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (57 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (57 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
// Phase 1: matrix 368 rows 449 cols
[2024-05-21 15:33:43] [INFO ] Computed 92 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 120/142 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 179/321 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 118/439 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/440 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 362/802 variables, 440/532 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/802 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 13/815 variables, 7/539 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/815 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 2/817 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/817 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/817 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 817/817 variables, and 541 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4263 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 120/142 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 15:33:47] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 179/321 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 9 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:33:48] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 6 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:33:49] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 3 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:33:50] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:33:51] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:33:52] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 1 ms to minimize.
SMT process timed out in 9459ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 368/368 transitions.
Graph (complete) has 953 edges and 449 vertex of which 448 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 (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 448 transition count 320
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 401 transition count 318
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 399 transition count 318
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 99 place count 399 transition count 230
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 293 place count 293 transition count 230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 298 place count 288 transition count 225
Iterating global reduction 3 with 5 rules applied. Total rules applied 303 place count 288 transition count 225
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 511 place count 182 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 512 place count 182 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 514 place count 181 transition count 126
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 518 place count 181 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 519 place count 180 transition count 125
Applied a total of 519 rules in 162 ms. Remains 180 /449 variables (removed 269) and now considering 125/368 (removed 243) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 180/449 places, 125/368 transitions.
RANDOM walk for 40000 steps (2645 resets) in 1513 ms. (26 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (509 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (640 resets) in 204 ms. (195 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (668 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (671 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (671 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (677 resets) in 219 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (676 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (671 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (673 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (662 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (840 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
Probably explored full state space saw : 63630 states, properties seen :9
Probabilistic random walk after 272121 steps, saw 63630 distinct states, run finished after 1311 ms. (steps per millisecond=207 ) properties seen :9
Explored full state space saw : 63630 states, properties seen :0
Exhaustive walk after 272121 steps, saw 63630 distinct states, run finished after 1645 ms. (steps per millisecond=165 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-11-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 434 stabilizing places and 353 stable transitions
Graph (complete) has 953 edges and 449 vertex of which 448 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 8 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 439 transition count 358
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 439 transition count 358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 438 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 438 transition count 357
Applied a total of 22 rules in 23 ms. Remains 438 /449 variables (removed 11) and now considering 357/368 (removed 11) transitions.
// Phase 1: matrix 357 rows 438 cols
[2024-05-21 15:33:57] [INFO ] Computed 92 invariants in 5 ms
[2024-05-21 15:33:58] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-21 15:33:58] [INFO ] Invariant cache hit.
[2024-05-21 15:33:58] [INFO ] Implicit Places using invariants and state equation in 606 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 901 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 437/449 places, 357/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 437 /437 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 931 ms. Remains : 437/449 places, 357/368 transitions.
Stuttering acceptance computed with spot in 459 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-00 finished in 1458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Graph (complete) has 953 edges and 449 vertex of which 448 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 447 transition count 317
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 398 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 396 transition count 315
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 103 place count 396 transition count 218
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 315 place count 281 transition count 218
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 323 place count 273 transition count 210
Iterating global reduction 3 with 8 rules applied. Total rules applied 331 place count 273 transition count 210
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 553 place count 160 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 554 place count 160 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 159 transition count 104
Applied a total of 556 rules in 112 ms. Remains 159 /449 variables (removed 290) and now considering 104/368 (removed 264) transitions.
// Phase 1: matrix 104 rows 159 cols
[2024-05-21 15:33:59] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 15:33:59] [INFO ] Implicit Places using invariants in 193 ms returned [1, 4, 5, 27, 28, 29, 30, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 208 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/449 places, 104/368 transitions.
Applied a total of 0 rules in 21 ms. Remains 141 /141 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 141/449 places, 104/368 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-01 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||(p1&&G(p2)))))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 359
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 439 transition count 358
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 439 transition count 358
Applied a total of 20 rules in 43 ms. Remains 439 /449 variables (removed 10) and now considering 358/368 (removed 10) transitions.
// Phase 1: matrix 358 rows 439 cols
[2024-05-21 15:34:00] [INFO ] Computed 92 invariants in 5 ms
[2024-05-21 15:34:00] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-21 15:34:00] [INFO ] Invariant cache hit.
[2024-05-21 15:34:00] [INFO ] Implicit Places using invariants and state equation in 569 ms returned [59, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 884 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 437/449 places, 358/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 437 /437 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 934 ms. Remains : 437/449 places, 358/368 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 367 ms.
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Computed a total of 422 stabilizing places and 343 stable transitions
Graph (complete) has 931 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 422 stabilizing places and 343 stable transitions
Detected a total of 422/437 stabilizing places and 343/358 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (OR (NOT p1) (NOT p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 64 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-02 finished in 1968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 2 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 439 transition count 358
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 439 transition count 358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 438 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 438 transition count 357
Applied a total of 22 rules in 30 ms. Remains 438 /449 variables (removed 11) and now considering 357/368 (removed 11) transitions.
// Phase 1: matrix 357 rows 438 cols
[2024-05-21 15:34:01] [INFO ] Computed 92 invariants in 16 ms
[2024-05-21 15:34:02] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-21 15:34:02] [INFO ] Invariant cache hit.
[2024-05-21 15:34:02] [INFO ] Implicit Places using invariants and state equation in 615 ms returned [59, 366]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 953 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/449 places, 357/368 transitions.
Applied a total of 0 rules in 6 ms. Remains 436 /436 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 990 ms. Remains : 436/449 places, 357/368 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-03
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-03 finished in 1121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 359
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 439 transition count 358
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 439 transition count 358
Applied a total of 20 rules in 18 ms. Remains 439 /449 variables (removed 10) and now considering 358/368 (removed 10) transitions.
// Phase 1: matrix 358 rows 439 cols
[2024-05-21 15:34:03] [INFO ] Computed 92 invariants in 3 ms
[2024-05-21 15:34:03] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 15:34:03] [INFO ] Invariant cache hit.
[2024-05-21 15:34:07] [INFO ] Implicit Places using invariants and state equation in 3902 ms returned [60, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4151 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 437/449 places, 358/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 437 /437 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4176 ms. Remains : 437/449 places, 358/368 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Product exploration explored 100000 steps with 33333 reset in 238 ms.
Computed a total of 422 stabilizing places and 343 stable transitions
Graph (complete) has 931 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 422 stabilizing places and 343 stable transitions
Detected a total of 422/437 stabilizing places and 343/358 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT 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 (Minato strategy)
Knowledge based reduction with 7 factoid took 36 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-04 finished in 4905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G(p1)))))))'
Support contains 2 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Graph (trivial) has 206 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 444 vertex of which 443 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 (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 442 transition count 310
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 392 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 391 transition count 309
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 104 place count 391 transition count 215
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 310 place count 279 transition count 215
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 317 place count 272 transition count 208
Iterating global reduction 3 with 7 rules applied. Total rules applied 324 place count 272 transition count 208
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 545 place count 161 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 160 transition count 102
Applied a total of 547 rules in 57 ms. Remains 160 /449 variables (removed 289) and now considering 102/368 (removed 266) transitions.
// Phase 1: matrix 102 rows 160 cols
[2024-05-21 15:34:08] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 15:34:08] [INFO ] Implicit Places using invariants in 248 ms returned [1, 4, 5, 27, 28, 29, 30, 37, 38, 39, 48, 49, 50, 51, 52, 53, 54, 55, 154, 156, 158]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 252 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/449 places, 102/368 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 318 ms. Remains : 139/449 places, 102/368 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-06 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Graph (trivial) has 206 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 442 transition count 310
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 392 transition count 310
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 392 transition count 216
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 308 place count 280 transition count 216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 315 place count 273 transition count 209
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 273 transition count 209
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 548 place count 158 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 550 place count 157 transition count 102
Applied a total of 550 rules in 77 ms. Remains 157 /449 variables (removed 292) and now considering 102/368 (removed 266) transitions.
// Phase 1: matrix 102 rows 157 cols
[2024-05-21 15:34:08] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 15:34:08] [INFO ] Implicit Places using invariants in 189 ms returned [1, 4, 5, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 192 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/449 places, 102/368 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 139/449 places, 102/368 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-07
Stuttering criterion allowed to conclude after 86 steps with 15 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-07 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(p2)))))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Graph (trivial) has 206 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 442 transition count 310
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 392 transition count 310
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 392 transition count 216
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 281 transition count 216
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 315 place count 273 transition count 208
Iterating global reduction 2 with 8 rules applied. Total rules applied 323 place count 273 transition count 208
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 543 place count 161 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 545 place count 160 transition count 104
Applied a total of 545 rules in 35 ms. Remains 160 /449 variables (removed 289) and now considering 104/368 (removed 264) transitions.
// Phase 1: matrix 104 rows 160 cols
[2024-05-21 15:34:08] [INFO ] Computed 71 invariants in 1 ms
[2024-05-21 15:34:09] [INFO ] Implicit Places using invariants in 225 ms returned [1, 4, 5, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 228 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/449 places, 104/368 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 268 ms. Remains : 141/449 places, 104/368 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-08 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(F(p1)))) U !p2))'
Support contains 4 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Graph (trivial) has 204 edges and 449 vertex of which 6 / 449 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 444 vertex of which 443 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 443 transition count 311
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 393 transition count 311
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 102 place count 393 transition count 217
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 282 transition count 217
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 313 place count 276 transition count 211
Iterating global reduction 2 with 6 rules applied. Total rules applied 319 place count 276 transition count 211
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 545 place count 161 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 547 place count 160 transition count 104
Applied a total of 547 rules in 32 ms. Remains 160 /449 variables (removed 289) and now considering 104/368 (removed 264) transitions.
// Phase 1: matrix 104 rows 160 cols
[2024-05-21 15:34:09] [INFO ] Computed 71 invariants in 1 ms
[2024-05-21 15:34:18] [INFO ] Implicit Places using invariants in 8517 ms returned [1, 4, 5, 27, 28, 29, 30, 37, 38, 39, 44, 45, 46, 47, 48, 49, 52, 53, 133]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 8533 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/449 places, 104/368 transitions.
Applied a total of 0 rules in 12 ms. Remains 141 /141 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8577 ms. Remains : 141/449 places, 104/368 transitions.
Stuttering acceptance computed with spot in 203 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-10
Product exploration explored 100000 steps with 28902 reset in 369 ms.
Product exploration explored 100000 steps with 29035 reset in 286 ms.
Computed a total of 132 stabilizing places and 96 stable transitions
Computed a total of 132 stabilizing places and 96 stable transitions
Detected a total of 132/141 stabilizing places and 96/104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 851 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9041 resets) in 1125 ms. (35 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (2951 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3211 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
// Phase 1: matrix 104 rows 141 cols
[2024-05-21 15:34:20] [INFO ] Computed 52 invariants in 1 ms
[2024-05-21 15:34:20] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/39 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/97 variables, 29/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:34:20] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:34:20] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:34:20] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:34:21] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 1 ms to minimize.
[2024-05-21 15:34:21] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:34:21] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 6/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/136 variables, 20/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/138 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 103/241 variables, 138/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 13/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/244 variables, 3/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/245 variables, 1/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/245 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/245 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 213 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 141/141 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/97 variables, 29/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 6/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/136 variables, 20/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/138 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 103/241 variables, 138/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 13/209 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/244 variables, 3/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/245 variables, 1/214 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/245 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/245 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 214 constraints, problems are : Problem set: 1 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 141/141 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1297ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 104/104 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 141 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 141 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 140 transition count 102
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 1 with 2 rules applied. Total rules applied 5 place count 139 transition count 101
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 139 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 137 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 137 transition count 99
Applied a total of 10 rules in 60 ms. Remains 137 /141 variables (removed 4) and now considering 99/104 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 137/141 places, 99/104 transitions.
RANDOM walk for 1343 steps (77 resets) in 12 ms. (103 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 17 factoid took 1407 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 15:34:23] [INFO ] Invariant cache hit.
[2024-05-21 15:34:23] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 15:34:23] [INFO ] Invariant cache hit.
[2024-05-21 15:34:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-21 15:34:23] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [3, 5, 13, 15, 20, 22, 24, 26, 28, 30, 42, 44, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 79, 81, 83, 85, 87, 89, 101, 117, 119, 121]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 447 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/141 places, 104/104 transitions.
Graph (complete) has 281 edges and 104 vertex of which 92 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 92 transition count 87
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 80 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 78 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 78 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 43 place count 70 transition count 78
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 2 with 2 rules applied. Total rules applied 45 place count 69 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 69 transition count 77
Applied a total of 46 rules in 13 ms. Remains 69 /104 variables (removed 35) and now considering 77/104 (removed 27) transitions.
// Phase 1: matrix 77 rows 69 cols
[2024-05-21 15:34:23] [INFO ] Computed 10 invariants in 0 ms
[2024-05-21 15:34:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 15:34:24] [INFO ] Invariant cache hit.
[2024-05-21 15:34:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 15:34:24] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/141 places, 77/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 624 ms. Remains : 69/141 places, 77/104 transitions.
Computed a total of 60 stabilizing places and 69 stable transitions
Computed a total of 60 stabilizing places and 69 stable transitions
Detected a total of 60/69 stabilizing places and 69/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 370 steps (92 resets) in 9 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 21095 reset in 208 ms.
Product exploration explored 100000 steps with 21037 reset in 331 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 77/77 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 67 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 66 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 66 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 2 with 2 rules applied. Total rules applied 8 place count 65 transition count 73
Applied a total of 8 rules in 19 ms. Remains 65 /69 variables (removed 4) and now considering 73/77 (removed 4) transitions.
// Phase 1: matrix 73 rows 65 cols
[2024-05-21 15:34:25] [INFO ] Computed 10 invariants in 0 ms
[2024-05-21 15:34:26] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2024-05-21 15:34:26] [INFO ] Invariant cache hit.
[2024-05-21 15:34:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 15:34:26] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2024-05-21 15:34:26] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 15:34:26] [INFO ] Invariant cache hit.
[2024-05-21 15:34:26] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (OVERLAPS) 72/137 variables, 65/75 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 27/102 constraints. Problems are: Problem set: 10 solved, 61 unsolved
[2024-05-21 15:34:30] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 1/103 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/103 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/104 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/104 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/104 constraints. Problems are: Problem set: 10 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 104 constraints, problems are : Problem set: 10 solved, 61 unsolved in 4444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 10 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 5/10 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 72/137 variables, 65/76 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 27/103 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 61/164 constraints. Problems are: Problem set: 10 solved, 61 unsolved
[2024-05-21 15:34:31] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:34:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 2/166 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/166 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 1/138 variables, 1/167 constraints. Problems are: Problem set: 10 solved, 61 unsolved
[2024-05-21 15:34:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:34:33] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 2/169 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/169 constraints. Problems are: Problem set: 10 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/138 variables, 0/169 constraints. Problems are: Problem set: 10 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 169 constraints, problems are : Problem set: 10 solved, 61 unsolved in 3271 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 61/71 constraints, Known Traps: 5/5 constraints]
After SMT, in 7750ms problems are : Problem set: 10 solved, 61 unsolved
Search for dead transitions found 10 dead transitions in 7764ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/69 places, 63/77 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 3 ms. Remains 63 /65 variables (removed 2) and now considering 63/63 (removed 0) transitions.
[2024-05-21 15:34:34] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 9123 ms. Remains : 63/69 places, 63/77 transitions.
Treatment of property BusinessProcesses-PT-11-LTLFireability-10 finished in 25167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&(G(p1)||X(F(p2))))) U X(X(G(!p2)))))'
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 441 transition count 360
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 441 transition count 360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 440 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 440 transition count 359
Applied a total of 18 rules in 57 ms. Remains 440 /449 variables (removed 9) and now considering 359/368 (removed 9) transitions.
// Phase 1: matrix 359 rows 440 cols
[2024-05-21 15:34:34] [INFO ] Computed 92 invariants in 3 ms
[2024-05-21 15:34:38] [INFO ] Implicit Places using invariants in 3898 ms returned []
[2024-05-21 15:34:38] [INFO ] Invariant cache hit.
[2024-05-21 15:34:39] [INFO ] Implicit Places using invariants and state equation in 816 ms returned [60, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4732 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 438/449 places, 359/368 transitions.
Applied a total of 0 rules in 19 ms. Remains 438 /438 variables (removed 0) and now considering 359/359 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4809 ms. Remains : 438/449 places, 359/368 transitions.
Stuttering acceptance computed with spot in 346 ms :[p2, (AND (NOT p0) p2), p2, true, (AND (NOT p0) p2), p2, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-12
Product exploration explored 100000 steps with 20052 reset in 148 ms.
Stack based approach found an accepted trace after 4873 steps with 961 reset with depth 5 and stack size 5 in 8 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-12 finished in 5340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 7 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 368/368 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 440 transition count 359
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 440 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 439 transition count 358
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 439 transition count 358
Applied a total of 20 rules in 18 ms. Remains 439 /449 variables (removed 10) and now considering 358/368 (removed 10) transitions.
// Phase 1: matrix 358 rows 439 cols
[2024-05-21 15:34:40] [INFO ] Computed 92 invariants in 4 ms
[2024-05-21 15:34:40] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-21 15:34:40] [INFO ] Invariant cache hit.
[2024-05-21 15:34:41] [INFO ] Implicit Places using invariants and state equation in 832 ms returned [59, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1128 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 437/449 places, 358/368 transitions.
Applied a total of 0 rules in 7 ms. Remains 437 /437 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1153 ms. Remains : 437/449 places, 358/368 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 422 stabilizing places and 343 stable transitions
Graph (complete) has 931 edges and 437 vertex of which 436 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 422 stabilizing places and 343 stable transitions
Detected a total of 422/437 stabilizing places and 343/358 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 38 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-13 finished in 1775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(F(p1)))) U !p2))'
[2024-05-21 15:34:42] [INFO ] Flatten gal took : 47 ms
[2024-05-21 15:34:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 15:34:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 449 places, 368 transitions and 1124 arcs took 11 ms.
Total runtime 92915 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-11

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 449
TRANSITIONS: 368
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.001s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1417
MODEL NAME: /home/mcc/execution/418/model
449 places, 368 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-11-LTLFireability-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716306304160

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;