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.r472-tajo-171620399800579.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 ltsminxred
Input is BusinessProcesses-PT-17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717226012106

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:33] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-01 07:13:33] [INFO ] Transformed 650 places.
[2024-06-01 07:13:33] [INFO ] Transformed 580 transitions.
[2024-06-01 07:13:33] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:33] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-17-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 85 place count 561 transition count 494
Iterating global reduction 1 with 82 rules applied. Total rules applied 167 place count 561 transition count 494
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 212 place count 516 transition count 449
Iterating global reduction 1 with 45 rules applied. Total rules applied 257 place count 516 transition count 449
Applied a total of 257 rules in 124 ms. Remains 516 /646 variables (removed 130) and now considering 449/576 (removed 127) transitions.
// Phase 1: matrix 449 rows 516 cols
[2024-06-01 07:13:33] [INFO ] Computed 105 invariants in 30 ms
[2024-06-01 07:13:34] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-06-01 07:13:34] [INFO ] Invariant cache hit.
[2024-06-01 07:13:34] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2024-06-01 07:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/515 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/516 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 29 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 4 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 6 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
Problem TDEAD378 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 20/125 constraints. Problems are: Problem set: 10 solved, 438 unsolved
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 4 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 4 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 20/145 constraints. Problems are: Problem set: 10 solved, 438 unsolved
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 4 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 5 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 2 ms to minimize.
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 20/165 constraints. Problems are: Problem set: 18 solved, 430 unsolved
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 99 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 15 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 20/185 constraints. Problems are: Problem set: 18 solved, 430 unsolved
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 117 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 20/205 constraints. Problems are: Problem set: 18 solved, 430 unsolved
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
SMT process timed out in 30277ms, After SMT, problems are : Problem set: 18 solved, 430 unsolved
Search for dead transitions found 18 dead transitions in 30297ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 516/646 places, 431/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 516 /516 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31479 ms. Remains : 516/646 places, 431/576 transitions.
Support contains 35 out of 516 places after structural reductions.
[2024-06-01 07:14:05] [INFO ] Flatten gal took : 93 ms
[2024-06-01 07:14:05] [INFO ] Flatten gal took : 59 ms
[2024-06-01 07:14:05] [INFO ] Input system was already deterministic with 431 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (261 resets) in 1081 ms. (36 steps per ms) remains 8/19 properties
BEST_FIRST walk for 40004 steps (44 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (47 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 186 ms. (213 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (45 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (56 resets) in 105 ms. (377 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (46 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (44 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
// Phase 1: matrix 431 rows 516 cols
[2024-06-01 07:14:06] [INFO ] Computed 105 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 246/337 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 153/490 variables, 39/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 20/510 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 427/937 variables, 510/615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/937 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 9/946 variables, 5/620 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/946 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/947 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/947 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 947/947 variables, and 621 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1194 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 246/337 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 153/490 variables, 39/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 15 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
SMT process timed out in 6305ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 431/431 transitions.
Graph (trivial) has 230 edges and 516 vertex of which 6 / 516 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1109 edges and 511 vertex of which 510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 510 transition count 366
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 453 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 452 transition count 365
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 118 place count 452 transition count 263
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 341 place count 331 transition count 263
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 347 place count 325 transition count 257
Iterating global reduction 3 with 6 rules applied. Total rules applied 353 place count 325 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 353 place count 325 transition count 256
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 324 transition count 256
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 609 place count 195 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 611 place count 194 transition count 135
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 613 place count 194 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 615 place count 192 transition count 133
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 618 place count 192 transition count 133
Applied a total of 618 rules in 176 ms. Remains 192 /516 variables (removed 324) and now considering 133/431 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 192/516 places, 133/431 transitions.
RANDOM walk for 40000 steps (884 resets) in 1128 ms. (35 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (283 resets) in 236 ms. (168 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (396 resets) in 198 ms. (201 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (310 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
// Phase 1: matrix 133 rows 192 cols
[2024-06-01 07:14:13] [INFO ] Computed 82 invariants in 3 ms
[2024-06-01 07:14:13] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 93/143 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/188 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/190 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 133/323 variables, 190/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 13/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/325 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/325 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 192/192 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 93/143 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 45/188 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/190 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 133/323 variables, 190/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 13/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/323 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/323 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/325 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/325 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 296 constraints, problems are : Problem set: 0 solved, 2 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 192/192 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 168 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 18 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-17-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 214 stabilizing places and 186 stable transitions
Graph (complete) has 1116 edges and 516 vertex of which 515 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Graph (trivial) has 241 edges and 516 vertex of which 6 / 516 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 1110 edges and 511 vertex of which 510 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 509 transition count 363
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 449 transition count 363
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 122 place count 449 transition count 256
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 356 place count 322 transition count 256
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 367 place count 311 transition count 245
Iterating global reduction 2 with 11 rules applied. Total rules applied 378 place count 311 transition count 245
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 378 place count 311 transition count 243
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 382 place count 309 transition count 243
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 637 place count 179 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 639 place count 178 transition count 122
Applied a total of 639 rules in 56 ms. Remains 178 /516 variables (removed 338) and now considering 122/431 (removed 309) transitions.
// Phase 1: matrix 122 rows 178 cols
[2024-06-01 07:14:14] [INFO ] Computed 80 invariants in 9 ms
[2024-06-01 07:14:14] [INFO ] Implicit Places using invariants in 123 ms returned [6, 7, 10, 11, 35, 36, 37, 38, 45, 46, 47, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 125 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/516 places, 122/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 159/516 places, 122/431 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-01
Product exploration explored 100000 steps with 17800 reset in 300 ms.
Product exploration explored 100000 steps with 17828 reset in 248 ms.
Computed a total of 32 stabilizing places and 24 stable transitions
Computed a total of 32 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (7964 resets) in 1367 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2574 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 660 steps, run visited all 1 properties in 16 ms. (steps per millisecond=41 )
Probabilistic random walk after 660 steps, saw 296 distinct states, run finished after 19 ms. (steps per millisecond=34 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 76 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 159 cols
[2024-06-01 07:14:16] [INFO ] Computed 61 invariants in 3 ms
[2024-06-01 07:14:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 07:14:16] [INFO ] Invariant cache hit.
[2024-06-01 07:14:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:14:16] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [8, 10, 27, 31, 33, 35, 42, 44, 46, 48, 50, 57, 59, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 135, 137, 139, 147]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 420 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/159 places, 122/122 transitions.
Graph (complete) has 349 edges and 121 vertex of which 114 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 114 transition count 107
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 102 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 101 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 31 place count 97 transition count 99
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 97 transition count 99
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 3 with 2 rules applied. Total rules applied 37 place count 97 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 95 transition count 97
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 41 place count 93 transition count 95
Iterating global reduction 5 with 2 rules applied. Total rules applied 43 place count 93 transition count 95
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 61 place count 82 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 65 place count 80 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 80 transition count 85
Applied a total of 66 rules in 24 ms. Remains 80 /121 variables (removed 41) and now considering 85/122 (removed 37) transitions.
// Phase 1: matrix 85 rows 80 cols
[2024-06-01 07:14:16] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 07:14:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 07:14:16] [INFO ] Invariant cache hit.
[2024-06-01 07:14:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 07:14:16] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [3, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 158 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/159 places, 85/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 612 ms. Remains : 78/159 places, 85/122 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Graph (complete) has 268 edges and 78 vertex of which 75 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8044 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2609 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 415 steps, run visited all 1 properties in 5 ms. (steps per millisecond=83 )
Probabilistic random walk after 415 steps, saw 202 distinct states, run finished after 5 ms. (steps per millisecond=83 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18207 reset in 120 ms.
Product exploration explored 100000 steps with 18083 reset in 111 ms.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 78 cols
[2024-06-01 07:14:17] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 07:14:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 07:14:17] [INFO ] Invariant cache hit.
[2024-06-01 07:14:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:14:17] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-01 07:14:18] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 07:14:18] [INFO ] Invariant cache hit.
[2024-06-01 07:14:18] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 8 (OVERLAPS) 84/162 variables, 78/98 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 5/103 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/103 constraints. Problems are: Problem set: 15 solved, 65 unsolved
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/162 variables, 4/107 constraints. Problems are: Problem set: 15 solved, 65 unsolved
[2024-06-01 07:14:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 1/108 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 15 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/163 variables, and 108 constraints, problems are : Problem set: 15 solved, 65 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 15 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 4/6 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 6/12 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 7/19 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/25 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 84/162 variables, 78/103 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 5/108 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 65/173 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/163 variables, and 173 constraints, problems are : Problem set: 15 solved, 65 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 65/80 constraints, Known Traps: 12/12 constraints]
After SMT, in 4163ms problems are : Problem set: 15 solved, 65 unsolved
Search for dead transitions found 15 dead transitions in 4164ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/78 places, 70/85 transitions.
Ensure Unique test removed 4 places
Applied a total of 0 rules in 3 ms. Remains 74 /78 variables (removed 4) and now considering 70/70 (removed 0) transitions.
[2024-06-01 07:14:22] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4384 ms. Remains : 74/78 places, 70/85 transitions.
Treatment of property BusinessProcesses-PT-17-LTLCardinality-01 finished in 7802 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((p0||F(G(p1)))))'
Support contains 5 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 417
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 417
Applied a total of 28 rules in 35 ms. Remains 502 /516 variables (removed 14) and now considering 417/431 (removed 14) transitions.
// Phase 1: matrix 417 rows 502 cols
[2024-06-01 07:14:22] [INFO ] Computed 105 invariants in 3 ms
[2024-06-01 07:14:22] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 07:14:22] [INFO ] Invariant cache hit.
[2024-06-01 07:14:22] [INFO ] Implicit Places using invariants and state equation in 456 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 608 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/516 places, 417/431 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 652 ms. Remains : 501/516 places, 417/431 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-02
Product exploration explored 100000 steps with 659 reset in 259 ms.
Product exploration explored 100000 steps with 663 reset in 272 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1095 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
RANDOM walk for 40000 steps (260 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (43 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 942126 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 942126 steps, saw 144467 distinct states, run finished after 3008 ms. (steps per millisecond=313 ) properties seen :0
// Phase 1: matrix 417 rows 501 cols
[2024-06-01 07:14:26] [INFO ] Computed 104 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 295/330 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:26] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 137/467 variables, 34/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/495 variables, 11/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:27] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 413/908 variables, 495/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/908 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/908 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/917 variables, 5/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:14:28] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:29] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/917 variables, 17/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/917 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/918 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/918 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/918 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 918/918 variables, and 644 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3670 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 295/330 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 137/467 variables, 34/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/495 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 413/908 variables, 495/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/908 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 6/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/917 variables, 5/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/917 variables, 9/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/917 variables, 4/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/917 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/918 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/918 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/918 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 918/918 variables, and 660 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 54/54 constraints]
After SMT, in 5136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 417/417 transitions.
Graph (trivial) has 228 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1088 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 358
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 444 transition count 358
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 104 place count 444 transition count 251
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 338 place count 317 transition count 251
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 615 place count 176 transition count 115
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 617 place count 175 transition count 119
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 619 place count 175 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 621 place count 173 transition count 117
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 622 place count 173 transition count 117
Applied a total of 622 rules in 61 ms. Remains 173 /501 variables (removed 328) and now considering 117/417 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 173/501 places, 117/417 transitions.
RANDOM walk for 40000 steps (1109 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (629 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 246 steps, run visited all 1 properties in 6 ms. (steps per millisecond=41 )
Probabilistic random walk after 246 steps, saw 145 distinct states, run finished after 6 ms. (steps per millisecond=41 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Support contains 1 out of 501 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 : 501/501 places, 417/417 transitions.
Graph (trivial) has 226 edges and 501 vertex of which 6 / 501 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 1089 edges and 496 vertex of which 495 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 359
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 444 transition count 359
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 104 place count 444 transition count 254
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 333 place count 320 transition count 254
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 602 place count 183 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 2 with 2 rules applied. Total rules applied 604 place count 182 transition count 126
Applied a total of 604 rules in 41 ms. Remains 182 /501 variables (removed 319) and now considering 126/417 (removed 291) transitions.
// Phase 1: matrix 126 rows 182 cols
[2024-06-01 07:14:32] [INFO ] Computed 80 invariants in 2 ms
[2024-06-01 07:14:32] [INFO ] Implicit Places using invariants in 149 ms returned [16, 58, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 152 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/501 places, 126/417 transitions.
Applied a total of 0 rules in 15 ms. Remains 179 /179 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 179/501 places, 126/417 transitions.
Computed a total of 47 stabilizing places and 33 stable transitions
Computed a total of 47 stabilizing places and 33 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
RANDOM walk for 40000 steps (5054 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1106 steps, run visited all 1 properties in 8 ms. (steps per millisecond=138 )
Probabilistic random walk after 1106 steps, saw 584 distinct states, run finished after 8 ms. (steps per millisecond=138 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 11760 reset in 229 ms.
Product exploration explored 100000 steps with 11818 reset in 248 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 126/126 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 178 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 176 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 173 transition count 120
Applied a total of 10 rules in 11 ms. Remains 173 /179 variables (removed 6) and now considering 120/126 (removed 6) transitions.
// Phase 1: matrix 120 rows 173 cols
[2024-06-01 07:14:33] [INFO ] Computed 77 invariants in 2 ms
[2024-06-01 07:14:33] [INFO ] Implicit Places using invariants in 156 ms returned [1, 2, 3, 4, 5, 8, 9, 31, 32, 33, 34, 41, 42, 43, 48, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 156 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/179 places, 120/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 153/179 places, 120/126 transitions.
Treatment of property BusinessProcesses-PT-17-LTLCardinality-02 finished in 11507 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)))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 417
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 417
Applied a total of 28 rules in 16 ms. Remains 502 /516 variables (removed 14) and now considering 417/431 (removed 14) transitions.
// Phase 1: matrix 417 rows 502 cols
[2024-06-01 07:14:33] [INFO ] Computed 105 invariants in 4 ms
[2024-06-01 07:14:33] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 07:14:33] [INFO ] Invariant cache hit.
[2024-06-01 07:14:34] [INFO ] Implicit Places using invariants and state equation in 553 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 741 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/516 places, 417/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 765 ms. Remains : 501/516 places, 417/431 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1095 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLCardinality-05 finished in 1221 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(G(p0)))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 417
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 417
Applied a total of 28 rules in 18 ms. Remains 502 /516 variables (removed 14) and now considering 417/431 (removed 14) transitions.
// Phase 1: matrix 417 rows 502 cols
[2024-06-01 07:14:35] [INFO ] Computed 105 invariants in 5 ms
[2024-06-01 07:14:35] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 07:14:35] [INFO ] Invariant cache hit.
[2024-06-01 07:14:35] [INFO ] Implicit Places using invariants and state equation in 476 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 678 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/516 places, 417/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 704 ms. Remains : 501/516 places, 417/431 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-06 finished in 820 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((X(X(p0))&&G(F(p0))&&(F(p2)||p1))))'
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 503 transition count 418
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 503 transition count 418
Applied a total of 26 rules in 19 ms. Remains 503 /516 variables (removed 13) and now considering 418/431 (removed 13) transitions.
// Phase 1: matrix 418 rows 503 cols
[2024-06-01 07:14:35] [INFO ] Computed 105 invariants in 7 ms
[2024-06-01 07:14:36] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 07:14:36] [INFO ] Invariant cache hit.
[2024-06-01 07:14:36] [INFO ] Implicit Places using invariants and state equation in 499 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 728 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 418/431 transitions.
Applied a total of 0 rules in 7 ms. Remains 502 /502 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 755 ms. Remains : 502/516 places, 418/431 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-10 finished in 998 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(X(F(p0))))'
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 502 transition count 417
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 502 transition count 417
Applied a total of 28 rules in 17 ms. Remains 502 /516 variables (removed 14) and now considering 417/431 (removed 14) transitions.
// Phase 1: matrix 417 rows 502 cols
[2024-06-01 07:14:36] [INFO ] Computed 105 invariants in 4 ms
[2024-06-01 07:14:37] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 07:14:37] [INFO ] Invariant cache hit.
[2024-06-01 07:14:37] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 815 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/516 places, 417/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 840 ms. Remains : 501/516 places, 417/431 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-12
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-12 finished in 980 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)))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Graph (trivial) has 241 edges and 516 vertex of which 6 / 516 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 1110 edges and 511 vertex of which 510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 509 transition count 362
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 448 transition count 362
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 124 place count 448 transition count 257
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 353 place count 324 transition count 257
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 364 place count 313 transition count 246
Iterating global reduction 2 with 11 rules applied. Total rules applied 375 place count 313 transition count 246
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 375 place count 313 transition count 244
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 379 place count 311 transition count 244
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 637 place count 180 transition count 117
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 639 place count 179 transition count 121
Applied a total of 639 rules in 56 ms. Remains 179 /516 variables (removed 337) and now considering 121/431 (removed 310) transitions.
// Phase 1: matrix 121 rows 179 cols
[2024-06-01 07:14:37] [INFO ] Computed 82 invariants in 2 ms
[2024-06-01 07:14:37] [INFO ] Implicit Places using invariants in 119 ms returned [1, 2, 3, 4, 7, 10, 11, 34, 35, 36, 37, 44, 45, 48, 53, 54, 55, 56, 57, 58, 59, 60, 133, 145]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 120 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/516 places, 121/431 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 155/516 places, 121/431 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-13
Product exploration explored 100000 steps with 21524 reset in 197 ms.
Product exploration explored 100000 steps with 21700 reset in 258 ms.
Computed a total of 32 stabilizing places and 24 stable transitions
Computed a total of 32 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 5204 steps (1267 resets) in 16 ms. (306 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 155 cols
[2024-06-01 07:14:38] [INFO ] Computed 58 invariants in 1 ms
[2024-06-01 07:14:38] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 07:14:38] [INFO ] Invariant cache hit.
[2024-06-01 07:14:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:14:39] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [5, 6, 23, 27, 29, 31, 40, 42, 44, 46, 48, 55, 57, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 131, 133, 135, 143]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 295 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/155 places, 121/121 transitions.
Graph (complete) has 338 edges and 117 vertex of which 108 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 108 transition count 105
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 96 transition count 105
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 91 transition count 96
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 91 transition count 96
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 91 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 90 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 40 place count 87 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 87 transition count 92
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 61 place count 76 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 74 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 74 transition count 82
Applied a total of 66 rules in 12 ms. Remains 74 /117 variables (removed 43) and now considering 82/121 (removed 39) transitions.
// Phase 1: matrix 82 rows 74 cols
[2024-06-01 07:14:39] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 07:14:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 07:14:39] [INFO ] Invariant cache hit.
[2024-06-01 07:14:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:14:39] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [6, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 148 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/155 places, 82/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 462 ms. Remains : 72/155 places, 82/121 transitions.
Computed a total of 11 stabilizing places and 12 stable transitions
Computed a total of 11 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 23004 steps (5866 resets) in 75 ms. (302 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22123 reset in 110 ms.
Product exploration explored 100000 steps with 22194 reset in 132 ms.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 82/82 (removed 0) transitions.
// Phase 1: matrix 82 rows 72 cols
[2024-06-01 07:14:39] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 07:14:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 07:14:39] [INFO ] Invariant cache hit.
[2024-06-01 07:14:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:14:39] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-01 07:14:39] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-06-01 07:14:39] [INFO ] Invariant cache hit.
[2024-06-01 07:14:39] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 81/153 variables, 72/81 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 4/85 constraints. Problems are: Problem set: 13 solved, 64 unsolved
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 2/87 constraints. Problems are: Problem set: 13 solved, 64 unsolved
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/89 constraints. Problems are: Problem set: 13 solved, 64 unsolved
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 1/90 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/90 constraints. Problems are: Problem set: 13 solved, 64 unsolved
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/153 variables, 1/91 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/91 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 0/91 constraints. Problems are: Problem set: 13 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/154 variables, and 91 constraints, problems are : Problem set: 13 solved, 64 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 13 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 4/4 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 6/10 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 5/15 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 81/153 variables, 72/87 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 4/91 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 64/155 constraints. Problems are: Problem set: 13 solved, 64 unsolved
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 2/157 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/157 constraints. Problems are: Problem set: 13 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/157 constraints. Problems are: Problem set: 13 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/154 variables, and 157 constraints, problems are : Problem set: 13 solved, 64 unsolved in 1931 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 72/72 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 64/77 constraints, Known Traps: 8/8 constraints]
After SMT, in 4073ms problems are : Problem set: 13 solved, 64 unsolved
Search for dead transitions found 13 dead transitions in 4074ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/72 places, 69/82 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 1 ms. Remains 70 /72 variables (removed 2) and now considering 69/69 (removed 0) transitions.
[2024-06-01 07:14:44] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 4255 ms. Remains : 70/72 places, 69/82 transitions.
Treatment of property BusinessProcesses-PT-17-LTLCardinality-13 finished in 6256 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(G(p0)) U (X(p1) U !p2))&&G(F(p3))))'
Support contains 8 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 431/431 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 505 transition count 420
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 505 transition count 420
Applied a total of 22 rules in 12 ms. Remains 505 /516 variables (removed 11) and now considering 420/431 (removed 11) transitions.
// Phase 1: matrix 420 rows 505 cols
[2024-06-01 07:14:44] [INFO ] Computed 105 invariants in 6 ms
[2024-06-01 07:14:44] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 07:14:44] [INFO ] Invariant cache hit.
[2024-06-01 07:14:44] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 655 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 504/516 places, 420/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 673 ms. Remains : 504/516 places, 420/431 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p3) p2), (NOT p3), (NOT p3), (OR p2 (AND (NOT p0) (NOT p1))), true, (NOT p0), (OR (NOT p1) p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 221 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLCardinality-14 finished in 911 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)))'
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((p0||F(G(p1)))))'
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)))'
[2024-06-01 07:14:45] [INFO ] Flatten gal took : 45 ms
[2024-06-01 07:14:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:14:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 516 places, 431 transitions and 1336 arcs took 9 ms.
Total runtime 72155 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-17-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BusinessProcesses-PT-17-LTLCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-17-LTLCardinality-13

BK_STOP 1717226372360

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-17-LTLCardinality-01
ltl formula formula --ltl=/tmp/1741/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 516 places, 431 transitions and 1336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1741/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1741/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1741/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1741/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 518 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 517, there are 440 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~472 levels ~10000 states ~35892 transitions
pnml2lts-mc( 0/ 4): ~472 levels ~20000 states ~84372 transitions
pnml2lts-mc( 0/ 4): ~472 levels ~40000 states ~180368 transitions
pnml2lts-mc( 0/ 4): ~472 levels ~80000 states ~389944 transitions
pnml2lts-mc( 0/ 4): ~472 levels ~160000 states ~842416 transitions
pnml2lts-mc( 0/ 4): ~472 levels ~320000 states ~1845612 transitions
pnml2lts-mc( 0/ 4): ~472 levels ~640000 states ~4093320 transitions
pnml2lts-mc( 3/ 4): ~538 levels ~1280000 states ~8368348 transitions
pnml2lts-mc( 2/ 4): ~742 levels ~2560000 states ~18163684 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~779!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2955127
pnml2lts-mc( 0/ 4): unique states count: 4246327
pnml2lts-mc( 0/ 4): unique transitions count: 32373082
pnml2lts-mc( 0/ 4): - self-loop count: 91
pnml2lts-mc( 0/ 4): - claim dead count: 27618333
pnml2lts-mc( 0/ 4): - claim found count: 518667
pnml2lts-mc( 0/ 4): - claim success count: 4250551
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2326
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4251928 states 32411002 transitions, fanout: 7.623
pnml2lts-mc( 0/ 4): Total exploration time 38.360 sec (38.360 sec minimum, 38.360 sec on average)
pnml2lts-mc( 0/ 4): States per second: 110843, Transitions per second: 844917
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 49.4MB, 12.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/26.0%
pnml2lts-mc( 0/ 4): Stored 434 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 49.4MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-17-LTLCardinality-02
ltl formula formula --ltl=/tmp/1741/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 516 places, 431 transitions and 1336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1741/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1741/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1741/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1741/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 517 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 517, there are 462 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~141 levels ~10000 states ~46864 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~20000 states ~100368 transitions
pnml2lts-mc( 0/ 4): ~876 levels ~40000 states ~183960 transitions
pnml2lts-mc( 0/ 4): ~881 levels ~80000 states ~351096 transitions
pnml2lts-mc( 0/ 4): ~881 levels ~160000 states ~748476 transitions
pnml2lts-mc( 0/ 4): ~881 levels ~320000 states ~1663352 transitions
pnml2lts-mc( 0/ 4): ~881 levels ~640000 states ~3627832 transitions
pnml2lts-mc( 0/ 4): ~881 levels ~1280000 states ~7913328 transitions
pnml2lts-mc( 0/ 4): ~881 levels ~2560000 states ~17089108 transitions
pnml2lts-mc( 0/ 4): ~881 levels ~5120000 states ~36794932 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6169959
pnml2lts-mc( 0/ 4): unique states count: 6920233
pnml2lts-mc( 0/ 4): unique transitions count: 57404076
pnml2lts-mc( 0/ 4): - self-loop count: 83
pnml2lts-mc( 0/ 4): - claim dead count: 50174610
pnml2lts-mc( 0/ 4): - claim found count: 303779
pnml2lts-mc( 0/ 4): - claim success count: 6920244
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3930
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6920244 states 57404104 transitions, fanout: 8.295
pnml2lts-mc( 0/ 4): Total exploration time 65.800 sec (65.780 sec minimum, 65.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 105171, Transitions per second: 872403
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 116.8MB, 17.7 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 434 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 116.8MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-17-LTLCardinality-13
ltl formula formula --ltl=/tmp/1741/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 516 places, 431 transitions and 1336 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1741/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1741/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1741/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1741/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 517 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 517, there are 443 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~141 levels ~10000 states ~40232 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~20000 states ~88440 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~40000 states ~187428 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~80000 states ~413576 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~160000 states ~904356 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~320000 states ~1961120 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~640000 states ~4187688 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~1280000 states ~9006644 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~2560000 states ~19065732 transitions
pnml2lts-mc( 2/ 4): ~141 levels ~5120000 states ~39553016 transitions
pnml2lts-mc( 1/ 4): ~1422 levels ~10240000 states ~74015164 transitions
pnml2lts-mc( 1/ 4): ~2499 levels ~20480000 states ~150085724 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19095675
pnml2lts-mc( 0/ 4): unique states count: 21338156
pnml2lts-mc( 0/ 4): unique transitions count: 183936465
pnml2lts-mc( 0/ 4): - self-loop count: 73
pnml2lts-mc( 0/ 4): - claim dead count: 161694609
pnml2lts-mc( 0/ 4): - claim found count: 898462
pnml2lts-mc( 0/ 4): - claim success count: 21338166
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3106
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21338166 states 183936492 transitions, fanout: 8.620
pnml2lts-mc( 0/ 4): Total exploration time 180.700 sec (180.680 sec minimum, 180.688 sec on average)
pnml2lts-mc( 0/ 4): States per second: 118086, Transitions per second: 1017911
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 226.8MB, 11.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 63.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 434 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 226.8MB (~256.0MB paged-in)

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-17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-17, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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